On the design of efficient ATM routing schemes
From MaRDI portal
Publication:5958312
DOI10.1016/S0304-3975(00)00396-0zbMath0992.68001OpenAlexW2125069761MaRDI QIDQ5958312
Carlo Gaibisso, Giorgio Gambosi, Paola Bertolazzi, Luca Becchetti
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00396-0
Related Items (5)
ATM layouts with bounded hop count and congestion ⋮ Virtual network embedding in the cycle ⋮ Virtual path layouts optimizing total hop count on ATM tree networks ⋮ Layouts for mobility management in wireless ATM networks ⋮ Directed virtual path layouts in ATM networks
Cites Work
- 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)
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the design of efficient ATM routing schemes