Virtual path and link capacity design for ATM networks

Sato, Y.; Sato, Ken-ichi

doi:10.1109/49.64909

Cited by 74 publications

(16 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, a fundamental parameter is the hop count, which is given by the number of VPs which comprise the path of a VC and determines the efficiency of the setup of the VC (see, e.g., [2,14,15]). Another cost measure widely considered in the literature is the load of a physical edge, which is given by the number of virtual paths that share the edge.…”

mentioning

confidence: 99%

ATM layouts with bounded hop count and congestion

Flammini

Nardelli

Proietti

1997

Distributed Algorithms

View full text Add to dashboard Cite

A b s t r a c t . In this paper we consider two new cost measures related to the communication overhead and the space requirements associated to virtual path layouts in ATM networks, that is the edge congestion and the node congestion. Informally, the edge congestion of a given edge e at an incident node u is defined as the number of VPs terminating or starting from e at u, while the node congestion of a node v is defined as the number of VPs having v as an endpoint. We investigate the problem of constructing virtual path layouts allowing to connect a specified root node to all the others in at most h hops and with maximum edge or node congestion c, for two given integers h and c. We first give tight results concerning the time complexity of the construction of such layouts for both the two congestion measures, that is we exactly determine all the tractable and intractable cases. Then, we provide some combinatorial bounds for arbitrary networks, together with optimal layouts for specific topologies such as chains, rings, grids and tori. Extensions to d-dimensional grids and tori with d :> 2 are also discussed. I n t r o d u c t i o nThe Asynchronous Trans#r Mode (ATM for short) is the most popular networking paradigm for Broadband ISDN [11,10,13]. It transfers data in the form of small fixed-size cells, that are routed independently according to two routing fields at their header: the virtual channel index (VCI) and the virtual path index (VPI). At each intermediate switch, these fields serve as indices to two routing tables, and the routing is done in accordance to the predetermined information in the appropriate entries.

show abstract

mentioning

confidence: 99%

ATM layouts with bounded hop count and congestion

Flammini

Nardelli

Proietti

1997

Distributed Algorithms

View full text Add to dashboard Cite

show abstract

“…Similar to the derivation given in [1], we have (9) and the overall cell loss probability σ is given by (10) where…”

Section: Appendixmentioning

confidence: 99%

“…The concept of virtual path (VP) [5], [6], [9], [11], [12] has been proposed to reduce the processing and complexity of network control and has been adopted by CCITT as part of the ATM standard. A virtual path is basically a logical direct connection between two nodes.…”

Section: Introductionmentioning

confidence: 99%

Bandwidth allocation of multiple QOS classes in ATM environment

Chan

Tsang

Proceedings of INFOCOM '94 Conference on Computer Communications

View full text Add to dashboard Cite

show abstract

“…Given a network and a set of connections to be established, to provide the performance required by B-ISDN applications it is important that routing is performed in a hardware fashion in most of the nodes a cell traverses, at the same time limiting the number of paths sharing a same physical link [1,4,15,25,26].…”

Section: Introductionmentioning

confidence: 99%

Wireless ATM layouts for chain networks

Flammini

Gambosi

Proceedings International Parallel and Distributed Processing Symposium

View full text Add to dashboard Cite

Abstract. In this paper we consider the problem of constructing ATM layouts for wireless networks in which mobile users can move along a chain of base stations. We first show that deciding the existence of a layout with maximum hop count h, load l and channel distance d is NP-complete for every fixed value of d greater or equal to 1. We then provide optimal layout constructions for the case d 2. Finally, optimal layout constructions are obtained also for any d within the class of the so-called canonic layouts, that so far have always been shown to be the optimal ones.

show abstract

Virtual path and link capacity design for ATM networks

Cited by 74 publications

References 19 publications

ATM layouts with bounded hop count and congestion

ATM layouts with bounded hop count and congestion

Bandwidth allocation of multiple QOS classes in ATM environment

Wireless ATM layouts for chain networks

Contact Info

Product

Resources

About