Virtual path control for ATM networks with call level quality of service guarantees

Authors:
Nikos G. Aneroussis;Aurel A. Lazar
Affiliations:
Department of Electrical Engineering and Center for Telecommunications Research, Columbia University, New York, NY;Department of Electrical Engineering and Center for Telecommunications Research, Columbia University, New York, NY
Venue:
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Year:
1996

Citing 5
Cited 5

Taming Xunet III

ACM SIGCOMM Computer Communication Review
Managing virtual paths on Xunet III: architecture, experimental platform and performance

Proceedings of the fourth international symposium on Integrated network management IV
Modeling VC, VP and VN Bandwidth Assignment Strategies in Broadband Networks

NOSSDAV '93 Proceedings of the 4th International Workshop on Network and Operating System Support for Digital Audio and Video
Virtual path bandwidth allocation in multi-user networks

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
An optimal establishment of virtual path connections for ATM networks

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1

Restoration strategies and spare capacity requirements in self-healing ATM networks

IEEE/ACM Transactions on Networking (TON)
A distributed overload control algorithm for delay-bounded call setup

IEEE/ACM Transactions on Networking (TON)
On the problem of capacity allocation and flow assignment in self-healing ATM networks

Computer Communications
A heuristic algorithm for allocating virtual path bandwidth in an ATM network

Computer Communications
A virtual path routing algorithm for ATM networks based on the equivalent bandwidth concept

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide an algorithm for the VP distribution problem that satisfies nodal constraints on the processing load and blocking constraints for each Source-Destination pair. The algorithm maximizes the network revenue under the above set of constraints and is independent of the number of traffic classes in the network, the method of representation of networking resources, the admission control policy used in every link and VP, and the network routing scheme. We apply the algorithm to the Xunet ATM testbed and study several of its performance characteristics.