TY - JOUR
T1 - Directed virtual path layouts in ATM networks
AU - Bermond, Jean Claude
AU - Marlin, Nausica
AU - Peleg, David
AU - Perennes, Stéphane
PY - 2003/1/4
Y1 - 2003/1/4
N2 - 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).
AB - 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).
KW - ATM
KW - Diameter
KW - Embedding
KW - Load
KW - Virtual path layout
UR - http://www.scopus.com/inward/record.url?scp=0037417714&partnerID=8YFLogxK
U2 - 10.1016/S0304-3975(01)00394-2
DO - 10.1016/S0304-3975(01)00394-2
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:0037417714
SN - 0304-3975
VL - 291
SP - 3
EP - 28
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 1
ER -