Virtual network embedding in the cycle

Authors:
Sébastien Choplin;Aubin Jarry;Stéphane Pérennes
Affiliations:
LaRIA, Université de Picardie Jules Verne, Pôle Science, 33 Rue Saint Leu, 180039 Amiens Cedex 1, France;Projet MASCOTTE I3S/INRIA/UNSA, 2004 Route des Lucioles, B.P 93 06902 Sophia Antipolis, France;Projet MASCOTTE I3S/INRIA/UNSA, 2004 Route des Lucioles, B.P 93 06902 Sophia Antipolis, France
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 10
Cited 0

The forwarding index of communication networks

IEEE Transactions on Information Theory
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
Optimal wavelength-routed multicasting

Discrete Applied Mathematics
On the design of efficient ATM routing schemes

Theoretical Computer Science
A Scalable Approach to Routing in ATM Networks

WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Path Layout in ATM Networks

SOFSEM '97 Proceedings of the 24th Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
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
Virtual Path Layout in ATM Path with Given Hop Count

ICN '01 Proceedings of the First International Conference on Networking-Part 2
Directed virtual path layouts in ATM networks

Theoretical Computer Science - Special issue: Distributed computing

Quantified Score

Hi-index	0.04

Visualization

Abstract

We consider a problem motivated by the design of Asynchronous transfer mode (ATM) networks. Given a physical network and an all-to-all traffic, the problem consists in designing a virtual network with a given diameter, which can be embedded in the physical one with a minimum congestion (the congestion is the maximum load of a physical link). Here we solve the problem when the physical network is a ring. We give an almost optimal solution for diameter 2 and bounds for large diameters.