Joint virtual path routing and capacity design for ATM networks

Authors:
Tien-Shun Gary Yang;Victor O. K. Li
Affiliations:
Broadband Support System, Pacific Bell, San Ramon, CA 94583, USA;Department of Electrical Engineering, University of Southern California, Los Angeles, CA 90089, USA
Venue:
Computer Communications
Year:
1996

Citing 7
Cited 0

Introduction to algorithms

Introduction to algorithms
Adaptive bandwidth allocation by hierarchical control of multiple ATM traffic classes

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 1)
Communicating with virtual paths and virtual channels

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
A high-throughput cell scheduling algorithm for delay-sensitive traffic in broadband switching systems

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Multimedia traffic management principles for guaranteed ATM network performance

IEEE Journal on Selected Areas in Communications
Virtual path and link capacity design for ATM networks

IEEE Journal on Selected Areas in Communications
Equivalent capacity and its application to bandwidth allocation in high-speed networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

In addition to simplifying nodal processing and network architecture, a good virtual path layout/capacity design reduces network system costs and improves overall QoS (Quality of Service) manageability and system utilization. A shortest-path based layout scheme and a virtual path capacity allocation scheme are proposed in this paper. For ease of implementation, we adopt a deterministic Virtual Path (VP) capacity assignment scheme. Each VP contains multiple Virtual Channels (VCs). The bandwidth assigned to each VC affects both the VC's QoS and the remaining capacity in the corresponding VP. We have recently proposed a novel bandwidth allocation scheme, in which bandwidth assignments are made based on a bandwidth queue model, to maximize the network utilization and user satisfaction. In this paper, this bandwidth queue model is used to quantify VP costs and a constrained non-linear optimization problem with VP capacities as decision variables is formulated. Since Switched Virtual Connection (SVC) traffic may be routed through different VPs, and hence affect the optimal VP capacity design, SVC routing parameters are also included as decision variables and determined together with the VP capacities.