Directed virtual path layouts in ATM networks

Jean Claude Bermond, Nausica Marlin, David Peleg, Stéphane Perennes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations


This article investigates the problem of designing virtual di-paths (VPs) in a directed ATM model, in which the flow of information in the two directions of a link are not identical. On top of a given physical network we construct directed VPs. Routing in the physical network is done using these VPs. Given the capacity of each physical link (the maximum number of VPs that can pass through the link) the problem consists in defining a set of VPs to minimize the diameter of the virtual network formed by these VPs (the maximum number of VPs traversed by any single message). For the most popular types of simple networks, namely the path, the cycle, the grid, the tori, the complete k-ary tree, and the general tree, we present optimal or near optimal lower and upper bounds on the virtual diameter as a function of the capacity.

Original languageEnglish
Title of host publicationDistributed Computing - 12th International Symposium, DISC 1998, Proceedings
EditorsShay Kutten, Shay Kutten
PublisherSpringer Verlag
Number of pages14
ISBN (Print)3540650660, 9783540650669
StatePublished - 1998
Externally publishedYes
Event12th International Symposium on Distributed Computing, DISC 1998 - Andros, Greece
Duration: 24 Sep 199826 Sep 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference12th International Symposium on Distributed Computing, DISC 1998

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.


  • ATM
  • Diameter
  • Embedding
  • Virtual path layout


Dive into the research topics of 'Directed virtual path layouts in ATM networks'. Together they form a unique fingerprint.

Cite this