Directed virtual path layouts in ATM networks

Authors:
Jean-Claude Bermond;Nausica Marlin;David Peleg;Stéphane Perennes
Affiliations:
I3S Université de Nice, MASCOTTE joint project CNRS-UNSA-INRIA, 2004 route des Lucioles, BP93, F-06902 Sophia-Antipolis, France;I3S Université de Nice, MASCOTTE joint project CNRS-UNSA-INRIA, 2004 route des Lucioles, BP93, F-06902 Sophia-Antipolis, France;Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot 76100, Israel;I3S Université de Nice, MASCOTTE joint project CNRS-UNSA-INRIA, 2004 route des Lucioles, BP93, F-06902 Sophia-Antipolis, France
Venue:
Theoretical Computer Science - Special issue: Distributed computing
Year:
2003

Citing 15
Cited 6

On forwarding indices of networks

Discrete Applied Mathematics
The virtual path layout problem in fast networks (extended abstract)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Expanding and forwarding

Discrete Applied Mathematics
Asynchronous transfer mode (3rd ed.): solution for broadband ISDN

Asynchronous transfer mode (3rd ed.): solution for broadband ISDN
The forwarding index of directed networks

Discrete Applied Mathematics
The layout of virtual paths in ATM networks

IEEE/ACM Transactions on Networking (TON)
Cost Trade-offs in Graph Embeddings, with Applications

Journal of the ACM (JACM)
On the design of efficient ATM routing schemes

Theoretical Computer Science
Efficient Collective Communication in Optical Networks

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract)

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Circuit-Switched Gossiping in 3-Dimensional Torus Networks

Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
On Optimal Graphs Embedded into Path and Rings, with Analysis Using l1-Spheres

WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
Issues in the Study of Graph Embeddings

WG '80 Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science
Optimal Layouts on a Chain ATM Network (Extended Abstract)

ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Virtual Path Layout in ATM Path with Given Hop Count

ICN '01 Proceedings of the First International Conference on Networking-Part 2

Virtual network embedding in the cycle

Discrete Applied Mathematics
Deterministic Models of Communication Faults

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Path layout on tree networks: bounds in different label switching models

Nordic Journal of Computing
Performance improvement of dynamic buffered ATM switch

Computers and Electrical Engineering
Designing hypergraph layouts to GMPLS routing strategies

SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
GMPLS label space minimization through hypergraph layouts

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

Motivated by asynchronous transfer mode in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical topology, which consists in finding a set of directed virtual paths (VPs) satisfying some constraints in terms of load (the number of VPs sharing a physical link) and hop count (the number of VPs used to establish a connection). For both general and particular networks, such as paths, cycles, meshes, tori and trees, we derive tight bounds on the virtual diameter (the maximum hop count for a connection) as a function of the network capacity (the maximum load of a physical link).