Traveling with a Pez Dispenser (or, routing issues in MPLS)

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 148-157

  Gupta, A ^a   Kumar, A ^a   Rastogi, R ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INTERNET; NETWORK PROTOCOLS; ROUTERS; TREES (MATHEMATICS);

MULTIPROTOCOL LABEL SWITCHING (MPLS);

SWITCHING THEORY;

EID: 0035167505     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959889     Document Type: Conference Paper

References (23)

1. On sparse spanners of weighted graphs
2. MPLS and traffic engineering in IP networks
3. New sparseness results on graph spanners
4. Compact routing with minimum stretch
5. Designing networks with compact routing tables
6. Efficient message routing in planar networks
7. Routing in distributed networks: Overview and open problems
8. Distance labeling in graphs
9. Trees and Euclidean metrics
10. A separator theorem for planar graphs
11. Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators
12. On embedding trees into uniformly convex Banach spaces
13. Proximity-preserving labeling schemes and thei applications
14. A trade-off between space and efficiency for routing tables
15. A trade-off between space and efficiency for routing tables
16. MPLS label stack encoding
17. MultiProtocol Label Switching architecture
18. Approximate distance oracles
19. Proof of the squashed cube conjecture