Embedding outerplanar graphs in small books
SIAM Journal on Algebraic and Discrete Methods
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Edge separators for graphs of bounded genus with applications
Theoretical Computer Science
Edge separators of planar and outerplanar graphs with applications
Journal of Algorithms
Asynchronous transfer mode (2nd ed.): solution for broadband ISDN
Asynchronous transfer mode (2nd ed.): solution for broadband ISDN
ATM user-network interface specification (version 3.0)
ATM user-network interface specification (version 3.0)
ATM: theory and application
The virtual path layout problem in fast networks (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Discrete Applied Mathematics
Two remarks on “expanding and forwarding” by P. Sole´
Discrete Applied Mathematics
The layout of virtual paths in ATM networks
IEEE/ACM Transactions on Networking (TON)
Bisecting de Bruijn and Kautz graphs
Discrete Applied Mathematics
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Virtual Path Layouts in ATM Networks
SIAM Journal on Computing
Minimizing Congestion of Layouts for ATM Networks with Faulty Links
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
A Scalable Approach to Routing in ATM Networks
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract)
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
SOFSEM '97 Proceedings of the 24th Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Optimal Layouts on a Chain ATM Network (Extended Abstract)
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Directed virtual path layouts in ATM networks
Theoretical Computer Science - Special issue: Distributed computing
Virtual network embedding in the cycle
Discrete Applied Mathematics
Layouts for mobility management in wireless ATM networks
Discrete Applied Mathematics
| Hi-index | 5.23 |
In this paper we deal with the problem of designing virtual path layouts in ATM networks when the hop-count is given and the load has to be minimized. We first prove a lower bound for networks with arbitrary topology and arbitrary set of connection requests. This result is then applied to derive lower bounds for the following settings: (i) one-to-all (one node has to be connected to all other nodes of the network) in arbitrary networks; (ii) all-to-all (each node has to be connected to all other nodes in the network) in several classes of networks, including planar and k-separable networks and networks of bounded genus. We finally study the all-to-all setting on two-dimensional meshes and we design a virtual path layout for this problem. When the hop-count and the network degree are bounded by constants, our results show that the upper bounds proposed in this paper for the one-to-all problem in arbitrary networks and for the all-to-all problem in two-dimensional mesh networks are asymptotically optimal. Moreover, the general lower bound shows that the algorithm proposed in Gerstel (Ph.D. Thesis, Technion-Haifa, Israel, 1995) for the all-to-all problem in k-separable networks is also asymptotically optimal. The upper bound for mesh networks also shows that the lower bound presented in this paper for the all-to-all problem in planar networks is asymptotically tight.