R. P.Draves, C. King, S. Venkatachary, and B. D.Zill, "Constructing optimal IP routing tables, " in Proceedings of IEEE INFOCOM '99, vol. 1, pp. 88--97, Mar. 1999. 44  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Internet Traffic Engineering - Mortier (2002) (2 citations) (Correct)
....been avoided at all costs, as it can increase both the number and size of UPDATE messages, and perhaps more importantly, it increases the size of routeing tables. However, methods to automatically create equivalent forwarding tables containing the (provably) minimum number of prefixes exist [Draves99] and can yield a 45 reduction in the number of prefixes in the forwarding table. Simultaneously, the computational power and memory capabilities of routers have dramatically increased. These facts coupled with the fact that disaggregation of this nature is occurring in any case due to ....
R.P. Draves, C. King, S. Venkatachary, and B.N. Zill. Constructing Optimal IP Routing Tables. In Proceedings of IEEE Infocom 1999, New York, March 1999. Also available as Microsoft Technical Report MSR-TR98 -59. (p 79)
On the Aggregatability of Multicast Forwarding - Thaler, Handley (2000) (Correct)
....be done at gigabit and terabit speeds. Whereas most of them provide faster lookups at the expense of additional state, the Degermark, et.al. 15] method in particular improves performance by constructing very small forwarding tables, so as to provide a high memory cache hit rate. Draves, et.al. [26] describe an algorithm which can be used to compress unicast forwarding state, and which can give an aggregation ratio of about 1.7 for unicast. Like our methods, it does not affect routing protocol state, and aggregation is performed when forwarding state is to be installed. VII. CONCLUSIONS In ....
Richard P. Draves, Christopher King, Srinivasan Venkatachary, and Brian D. Zill, "Constructing optimal IP routing tables," in Proceedings of IEEE INFOCOM, March 1999.
Routing with a Clue - Bremler-Barr, Afek, Har-Peled (1999) (Correct)
.... steps [19] This approach has been improved by relying on the SDRAM technology and performing 6 way search resulting in O(log 6 N) steps [11] 4) Compress the prefixes data structure into the cache [6] 17] 5) Compute locally equivalent forwarding tables that contain minimal number of prefixes [20] and hence most of the table can fit into the cache. 6) Exploit CPU caching as a hardware assist to speed up routing table lookup significantly, by treating IP addresses as virtual memory addresses [4] 7) Minimize the average lookup time per prefix, when the forwarding table is in different ....
R. P. Draves, C. King, S. V., and Zill, B. D. Constructing optimal ip routing tables. In Proc. INFOCOM 99 (March 1999).
On the Aggregatability of Multicast Forwarding State - Thaler, Handley (2000) (41 citations) (Correct)
....be done at gigabit and terabit speeds. Whereas most of them provide faster lookups at the expense of additional state, the Degermark, et.al. 16] method in particular improves performance by constructing very small forwarding tables, so as to provide a high memory cache hit rate. Draves, et.al. [28] describe an algorithm which can be used to compress unicast forwarding state, and which can give an aggregation ratio of about 1.7 for unicast. Like our methods, it does not affect routing protocol state, and aggregation is performed when forwarding state is to be installed. 7 Conclusions In ....
Richard P. Draves, Christopher King, Srinivasan Venkatachary, and Brian D. Zill. Constructing optimal IP routing tables. In Proceedings of IEEE INFOCOM, March 1999. 20
On the Aggregatability of Multicast Forwarding State - Thaler, Handley (1999) (41 citations) (Correct)
....be done at gigabit and terabit speeds. Whereas most of them provide faster lookups at the expense of additional state, the Degermark, et al. 17] method in particular improves performance by constructing very small forwarding tables, so as to provide a high memory cache hit rate. Draves, et al. [28] describe an algorithm which can be used to compress unicast forwarding state, and which can give an aggregation ratio of about 1.7 for unicast. Like our methods, it does not affect routing protocol state, and aggregation is performed when forwarding state is to be installed. VII. CONCLUSIONS In ....
Richard P. Draves, Christopher King, Srinivasan Venkatachary, and Brian D. Zill, "Constructing optimal IP routing tables," in Proceedings of IEEE INFOCOM, March 1999.
Performance Prediction Method for Address Lookup Algorithms Based .. - Kawabe (2002) (Correct)
No context found.
R. P.Draves, C. King, S. Venkatachary, and B. D.Zill, "Constructing optimal IP routing tables, " in Proceedings of IEEE INFOCOM '99, vol. 1, pp. 88--97, Mar. 1999. 44
The Case for Separating Routing from Routers - Feamster, Balakrishnan.. (2004) (7 citations) (Correct)
No context found.
DRAVES, R., KING, C., VENKATACHARY, S., AND ZILL, B. Constructing optimal IP routing tables. In Proc. IEEE INFOCOM (March 1999).
The Case for Separating Routing from Routers - Feamster, Balakrishnan.. (2004) (7 citations) (Correct)
No context found.
DRAVES, R., KING, C., VENKATACHARY, S., AND ZILL, B. Constructing optimal IP routing tables. In Proc. IEEE INFOCOM (March 1999).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC