Analysis of an evolvable architecture of internet routers

2007 IEEE Workshop on High Performance Switching and Routing, HPSR

Volumn , Issue , 2007, Pages 24-28

  Dai, Yi ^a   Sun, Zhi Gang ^a   Su, Jin Shu ^a  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

Author keywords

Evolvable; Forwarding and switching; Internet routers; IP lookup

Indexed keywords

COMPUTER NETWORKS; HIGH PERFORMANCE LIQUID CHROMATOGRAPHY; INTERNET; INTERNET PROTOCOLS; PACKET SWITCHING; RESEARCH; SWITCHING;

EVOLVABLE; FORWARDING AND SWITCHING; HIGH PERFORMANCE SWITCHING AND ROUTING; INTERNET ROUTERS; IP LOOKUPS; IP-LOOKUP; LOOKUPS; MULTI-STAGE; MULTIPLE PACKETS;

NETWORK ARCHITECTURE;

EID: 47649127065     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPSR.2007.4281225     Document Type: Conference Paper

References (14)

1. E. Oki, Z. Jing, H. J. Chao, Concurrent round-robin dispatching scheme for a Clos-network switch. In Proceedings of IEEE ICC 2001, pp. 107-111, June 2001
2. G. Sapountzis, M. Katevenis Benes Switching fabrics with O(N)-complexity Internal backpressure. Proc. In Proceedings of IEEE Workshop on High Performance Switching and Routing (HPSR 2003), Torino, Italy, June 2003, pp. 11-16
3. M. Khaoua, L. Machenzie. On the design of hypermesh interconnection networks for multicomputers. Journal of Systems Architecture, 2000, 46:779-792
4. S. Iyer, N. McKeown, Analysis of the parallel packet switch architecture, IEEE/ACM Transactions on Networking (2003) 314-324.
5. W. Dong, W. Wolf, A distributed switch architecture with dynamic load-balancing and parallel input-queued crossbars for terabit switch fabrics. In Proceedings of IEEE INFOCOM, New York: IEEE Communications Society, 2002. 352-361
6. F. Baboescu, S. Rajgopal, LB. Huang, N. Richardson, Hardware implementation of a tree based IP lookup algorithm for OC-768 and beyond. In proceedings of DesignCon 2005.
7. M. Sanchez, E. Biersack, and W. Dabbous, " Survey and taxonomy of IP address lookup algorithms", In IEEE Network Magazine, vol. 15, no. 2 (2001).
8. M. Degermark, A. Brodnik, S. Carlsson and S. Pink. Small Forwarding Tables for Fast Routing Lookups. In Procedings of SIGCOMM '97 1997.
9. W. Eatherton, Z. Dittia, G. Varghese. Tree Bitmap: Hardware/Software IP Lookups with Incremental Updates. ACM SIGCOMM Computer Communication Review, 34(2) 97-122, 2004.
10. S. Nilsson and G. Karlsson. Fast Address Look-up for Internet Routers. In Proceedings of The IEEE Conference on BroadBand Communications Technology. 1998.
11. J. Hasan, T. N. Vijaykumar. Dynamic pipelining: making IP-lookup truly scalable, In Proceedings of SIGCOMM, August 2005.
12. Anindya Basu and Girija Narlikar. Fast Incremental Updates for Pipelined Forwarding Engines. In Proceedings of INFOCOM '03, 2003.
13. F. Baker, Requirements for IP version 4 routers. RFC1812, 1995
14. J. Bennett, C. Partridge, N. Shectman, Packet reordering is not pathological network behavior. IEEE/ACM Trans. on Networking, 1999, 7(6):789-798