Directed virtual path layouts in ATM networks

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

doi:10.1007/bfb0056475

Directed virtual path layouts in ATM networks

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

Abstract

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 language	English
Title of host publication	Distributed Computing - 12th International Symposium, DISC 1998, Proceedings
Editors	Shay Kutten, Shay Kutten
Publisher	Springer Verlag
Pages	75-88
Number of pages	14
ISBN (Print)	3540650660, 9783540650669
DOIs	https://doi.org/10.1007/bfb0056475
State	Published - 1998
Externally published	Yes
Event	12th International Symposium on Distributed Computing, DISC 1998 - Andros, Greece Duration: 24 Sep 1998 → 26 Sep 1998

Publication series

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

Conference

Conference	12th International Symposium on Distributed Computing, DISC 1998
Country/Territory	Greece
City	Andros
Period	24/09/98 → 26/09/98

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.

Keywords

ATM
Diameter
Embedding
Virtual path layout

Access to Document

10.1007/bfb0056475

Cite this

Bermond, J. C., Marlin, N., Peleg, D., & Perennes, S. (1998). Directed virtual path layouts in ATM networks. In S. Kutten, & S. Kutten (Eds.), Distributed Computing - 12th International Symposium, DISC 1998, Proceedings (pp. 75-88). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1499). Springer Verlag. https://doi.org/10.1007/bfb0056475

Bermond, Jean Claude ; Marlin, Nausica ; Peleg, David et al. / Directed virtual path layouts in ATM networks. Distributed Computing - 12th International Symposium, DISC 1998, Proceedings. editor / Shay Kutten ; Shay Kutten. Springer Verlag, 1998. pp. 75-88 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{eca6bc95cad24a0d8e535b05e8682984,

title = "Directed virtual path layouts in ATM networks",

abstract = "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.",

keywords = "ATM, Diameter, Embedding, Virtual path layout",

author = "Bermond, {Jean Claude} and Nausica Marlin and David Peleg and St{\'e}phane Perennes",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1998.; 12th International Symposium on Distributed Computing, DISC 1998 ; Conference date: 24-09-1998 Through 26-09-1998",

year = "1998",

doi = "10.1007/bfb0056475",

language = "אנגלית",

isbn = "3540650660",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "75--88",

editor = "Shay Kutten and Shay Kutten",

booktitle = "Distributed Computing - 12th International Symposium, DISC 1998, Proceedings",

address = "גרמניה",

}

Bermond, JC, Marlin, N, Peleg, D & Perennes, S 1998, Directed virtual path layouts in ATM networks. in S Kutten & S Kutten (eds), Distributed Computing - 12th International Symposium, DISC 1998, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1499, Springer Verlag, pp. 75-88, 12th International Symposium on Distributed Computing, DISC 1998, Andros, Greece, 24/09/98. https://doi.org/10.1007/bfb0056475

Directed virtual path layouts in ATM networks. / Bermond, Jean Claude; Marlin, Nausica; Peleg, David et al.
Distributed Computing - 12th International Symposium, DISC 1998, Proceedings. ed. / Shay Kutten; Shay Kutten. Springer Verlag, 1998. p. 75-88 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1499).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Directed virtual path layouts in ATM networks

AU - Bermond, Jean Claude

AU - Marlin, Nausica

AU - Peleg, David

AU - Perennes, Stéphane

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1998.

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

KW - ATM

KW - Diameter

KW - Embedding

KW - Virtual path layout

UR - http://www.scopus.com/inward/record.url?scp=84947920413&partnerID=8YFLogxK

U2 - 10.1007/bfb0056475

DO - 10.1007/bfb0056475

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84947920413

SN - 3540650660

SN - 9783540650669

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 75

EP - 88

BT - Distributed Computing - 12th International Symposium, DISC 1998, Proceedings

A2 - Kutten, Shay

PB - Springer Verlag

T2 - 12th International Symposium on Distributed Computing, DISC 1998

Y2 - 24 September 1998 through 26 September 1998

ER -

Bermond JC, Marlin N, Peleg D, Perennes S. Directed virtual path layouts in ATM networks. In Kutten S, Kutten S, editors, Distributed Computing - 12th International Symposium, DISC 1998, Proceedings. Springer Verlag. 1998. p. 75-88. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/bfb0056475

Directed virtual path layouts in ATM networks

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this