Skip to Main content Skip to Navigation

Directed Virtual Path Layouts in ATM Networks

Jean-Claude Bermond 1 Nausica Marlin David Peleg Stéphane Pérennes
1 SLOOP - Simulation, Object Oriented Languages and Parallelism
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : Motivated by Asynchronous Transfer Mode (ATM) 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).
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 11:34:31 AM
Last modification on : Tuesday, November 17, 2020 - 11:18:04 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:31:11 PM


  • HAL Id : inria-00073007, version 1



Jean-Claude Bermond, Nausica Marlin, David Peleg, Stéphane Pérennes. Directed Virtual Path Layouts in ATM Networks. RR-3665, INRIA. 1999. ⟨inria-00073007⟩



Record views


Files downloads