On the design of efficient ATM routing schemes

DOI10.1016/S0304-3975(00)00396-0zbMath0992.68001MaRDI QIDQ5958312

Carlo Gaibisso, Giorgio Gambosi, Paola Bertolazzi, Luca Becchetti

Publication date: 3 March 2002

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

zbMATH Keywords

ATM networks; parallel and distributed computation; virtual path layout

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

Related Items

ATM layouts with bounded hop count and congestion, Layouts for mobility management in wireless ATM networks, Virtual network embedding in the cycle, Virtual path layouts optimizing total hop count on ATM tree networks, Directed virtual path layouts in ATM networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge separators for graphs of bounded genus with applications
• A partial k-arboretum of graphs with bounded treewidth
• Optimal layouts on a chain ATM network
• Bisecting de Bruijn and Kautz graphs
• Expanding and forwarding
• Two remarks on ``Expanding and forwarding by P. Solé
• Embedding Outerplanar Graphs in Small Books
• Edge Separators of Planar and Outerplanar Graphs With Applications
• 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
• Virtual Path Layouts in ATM Networks
• A better upper bound on the bisection width of de Bruijn networks
• The virtual path layout problem in fast networks (extended abstract)