Tree based MPLS routing

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2003, Pages 193-199

  Gupta, Anupam ^a   Kumar, Amit ^b   Thorup, Mikkel ^c  

^a Carnegie Mellon University   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

MPLS routing; Networks; Routing algorithms

Indexed keywords

COMPUTATIONAL COMPLEXITY; INTERNET; NETWORK PROTOCOLS; PACKET NETWORKS; SWITCHING NETWORKS; TREES (MATHEMATICS);

PACKET HEADERS;

ROUTERS;

EID: 0038379302     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777412.777443     Document Type: Conference Paper

References (20)

1. Daniel O. Awduche. MPLS and traffic engineering in IP networks. IEEE Communications Magazine, December 1999.
2. William Cook and Paul Seymour. Tour merging via branch-decomposition. http://www.isye.gatech.edu/wcook/, December 2002.
3. Lenore J. Cowen. Compact routing with minimum stretch. J. Algorithms, 38(1): 170-183, 2001. Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 1999).
4. Lenore J. Cowen. Compact routing with minimum stretch. J. Algorithms, 38(1): 170-183, 2001. Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 1999).
5. Bruce Davie and Yakov Rekhter. MPLS: Technology and Applications. Morgan Kaufmann Publishers, 2000.
6. Anwar Elwalid, Cheng Jin, Steven H. Low, and Indra Widjaja. MATE: MPLS adaptive traffic engineering. In Proceedings IEEE INFOCOM 2001, volume 3, pages 1300-1309, 2001.
7. Greg N. Frederickson and Ravi Janardan. Designing networks with compact routing tables. Algorithmica, 3:171-190, 1988.
8. Greg N. Frederickson and Ravi Janardan. Efficient message routing in planar networks. SIAM J. Comput., 18(4):843-857, 1989.
9. Cyril Gavoille. Routing in distributed networks: Overview and open problems. ACM SIGACT News - Distributed Computing Column, 32(1):36-52, March 2001.
10. Anupam Gupta, Amit Kumar, and Rajeev Rastogi. Routing issues in MPLS (or how to travel with a Pez dispenser). In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 148-157, 2001.
11. MPLS Charter. http://www.ietf.org/html.charters/mpls-charter.html.
12. Jiří Matoušek. On embedding trees into uniformly convex Banach spaces. Israel Journal of Mathematics, 114:221-237, 1999. (Czech version in: Lipschitz distance of metric spaces, C.Sc. degree thesis, Charles University, 1990).
13. Debasis Mitra and K. G. Ramakrishnan. Engineering of multiservice, multipriority networks. Bell Labs Technical Journal, 6(1):139-151, 2001.
14. David Peleg and Eli Upfal. A trade-off between space and efficiency for routing tables. J. Assoc. Comput. Mach., 36(3):510-530, 1989.
15. David Peleg and Eli Upfal. A trade-off between space and efficiency for routing tables. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 43-52, 1998.
16. Neil Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 63(1):65-110, 1995.
17. 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.
18. Eric C. Rosen, Arun Viswanathan, and Ross Callon. MultiProtocol Label Switching architecture (RFC 3031). http://www.ietf.org/rfc/rfc3031.txt, January 2001.
19. Neil Spring, Ratul Mahajan, and David Wetherall. Measuring ISP topologies with rocketfuel. In Proceedings ACM SIGCOMM, 2002.
20. Mikkel Thorup. Compact oracles for reachability and approximate distances in planar digraphs. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 242-251, 2001.