Directed virtual path layouts in ATM networks

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

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

Publication date: 14 May 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00394-2

zbMATH Keywords

embeddingdiameterATMvirtual path layoutload

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (6)

GMPLS label space minimization through hypergraph layouts ⋮ A decision-theoretic approach to reliable message delivery ⋮ Virtual network embedding in the cycle ⋮ Virtual path layouts optimizing total hop count on ATM tree networks ⋮ Deterministic Models of Communication Faults ⋮ Designing Hypergraph Layouts to GMPLS Routing Strategies

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Directed virtual path layouts in ATM networks