Exploring the trade-off between label size and stack depth in MPLS routing

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2003, Pages 544-554

  Gupta, Anupam ^a   Kumar, Amit ^b   Rastogi, Rajeev ^b  

^a Carnegie Mellon University   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; INFORMATION SERVICES; NETWORK PROTOCOLS; ROUTERS; SWITCHING NETWORKS; ECONOMIC AND SOCIAL EFFECTS; ELECTRONIC COMMERCE; FORESTRY; INTERNET SERVICE PROVIDERS; NETWORK LAYERS; ROUTING ALGORITHMS; TELECOMMUNICATION SYSTEMS;

VIRTUAL PRIVATE NETWORKS (VPN);

PACKET NETWORKS; INTERNET PROTOCOLS;

COMPREHENSIVE STUDIES; FIXED NUMBERS; IP SERVICES; LABEL STACK; LOWER BOUNDS; MPLS ROUTING; MULTI PROTOCOL LABEL SWITCHING; MULTICAST TREE; TRAFFIC ENGINEERING; VIRTUAL PRIVATE NETWORKS;

EID: 0041472755     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph, and Jose Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9(1):81-100, 1993.
2. Daniel O. Awduche. MPLS and traffic engineering in IP networks. IEEE Communications Magazine, December 1999.
3. Barun Chandra, Gautam Das, Giri Narasimhan, and Jose Soares. New sparseness results on graph spanners. International Journal of Computational Geometry & Applications, 5(1-2):125-144, 1995.
4. CISCO MPLS web page. http://www.cisco.com/warp/public/732/Tech/mpls/.
5. Lenore Cowen. Compact routing with minimum stretch. In Proceedings of the 10th Annual ACM-SIAM Symposium on Disc= rete Algorithms, pages 255-260, 1999.
6. N. G. Duffield, P. Goyal, A. Greenberg, P. Mishra, K. K. Ramakrishnan, and J. E. van der Merwe. A flexible model for resource management in virtual private networks. In Proceedings ACM SIGCOMM, 1998.
7. Bruce Davie and Yakov Rekhter. MPLS: Technology and Applications. Morgan Kaufmann Publishers, 2000.
8. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In Proceedings ACM SIGCOMM, 1999.
9. Greg N. Frederickson and Ravi Janardan. Designing networks with compact routing tables. Algorithmica, 3:171-190, 1988.
10. Greg N. Frederickson and Ravi Janardan. Efficient message routing in planar networks. SIAM Journal on Computing, 18(4):843-857, 1989.
11. Cyril Gavoille. Routing in distributed networks: Overview and open problems. ACM SIGACT News - Distributed Computing Column, 32(1):36-52, March 2001.
12. Cyril Gavoille, David Peleg, Stephane Perennes, and Ran Raz. Distance labeling in graphs. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 210-219, 2001.
13. S. Keshav. An engineering approach to networking. Addison-Wesley Professional Computing Series, 1997.
14. A. Gupta, A. Kumar and R. Rastogi. Routing Issues in MPLS (Or, How to Travel with a Fez Dispenser). In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS), 2001.
15. A. Gupta, J. Kleinberg, A. Kumar, R. Rastogi and B. Yener. Provisioning a virtual private network: A network design problem for multicommodity flow. In Proceedings of the 33rd ACM Symposium on Theory of Computing, 2001.
16. A. Kumar, R. Rastogi, A. Silberschatz and B. Yener. Algorithms for provisioning virtual private networks in the hose model. In Proceedings ACM SIGCOMM, 2001.
17. MPLS Charter, http://www.ietf.org/html.charters/mpls-charter.html.
18. Nathan Linial, Avner Magen, and Michael Saks. Trees and Euclidean metrics. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 169-177, 1998.
19. Jiří Matoušek. On embedding trees into uniformly convex Banach spaces. Israel Journal of Mathematics, 114:221-237, 1999.
20. Nortel MPLS web page. http://www.nortelnetworks.com/orporate/technology/mpls/index.html.
21. David Peleg. Proximity-preserving labeling schemes and thei applications. In 25th Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 1665, pages 30-41, 1999.
22. David Peleg and Eli Upfal. A trade-off between space and efficiency for routing tables. J. Assoc. Comput. Mach., 36(3):510-530, 1989.
23. Eric C. Rosen, Dan Tappan, Yakov Rekhter, Guy Federkow, Dino Farinacci, Tony Li, and Alex Conta. MPLS label stack encoding (RFC 3032). http://www.ietf.org/rfc/rfc3032.txt, January 2001.
24. Eric C. Rosen, Arun Viswanathan, and Ross Callon. Multiprotocol Label Switching architecture (RFC 3031). http://www.ietf.org/rfc/rfc3031.txt, January 2001.
25. B.M. Waxman. "Routing of Multipoint Connections". IEEE Journal on Selected Areas in Communications, 6(9):1617-1622, December 1988.
26. Peter Winkler. Proof of the squashed cube conjecture. Combinatorica, 3(1):135-139, 1983.