Directed virtual path layouts in ATM networks

DOI10.1016/S0304-3975(01)00394-2zbMath1026.68002MaRDI QIDQ1870524

Nausica Marlin, Stéphane Pérennes, Jean-Claude Bermond, David Peleg

Publication date: 14 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

embedding; diameter; ATM; virtual path layout; load

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

Related Items

GMPLS label space minimization through hypergraph layouts, Virtual network embedding in the cycle, Virtual path layouts optimizing total hop count on ATM tree networks, Designing Hypergraph Layouts to GMPLS Routing Strategies, Deterministic Models of Communication Faults

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expanding and forwarding
• On forwarding indices of networks
• The forwarding index of directed networks
• Cost Trade-offs in Graph Embeddings, with Applications
• A new characterization of tree medians with applications to distributed sorting
• Hop-Congestion Trade-Offs for High-Speed Networks
• A complete characterization of the path layout construction problem for ATM networks with given hop count and load
• The virtual path layout problem in fast networks (extended abstract)
• On the design of efficient ATM routing schemes
• Optimal layouts on a chain ATM network