Virtual Path Design in Service-Specific ATM Networks

Authors:
Iraj Saniee;Joel S. Sokol
Affiliations:
Network Design and Traffic Research Grp., Bell Communications Research, 445 South Street, Morristown, NJ 07962, USA. iis@bellcore.com;Operations Research Center, Massachusetts Institute of Technology, 1 Amherst Street, Room E40-130, Cambridge, MA 02139, USA. jsokol@mit.edu
Venue:
Journal of Heuristics
Year:
2000

Citing 7
Cited 0

Statistical multiplexing in ATM networks

Performance Evaluation
Separable routing: a scheme for state-dependent routing of circuit switched telephone traffic

Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
Effective bandwidth of general Markovian traffic sources and admission control of high speed networks

IEEE/ACM Transactions on Networking (TON)
Optimizing the system of virtual paths

IEEE/ACM Transactions on Networking (TON)
Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks

IEEE/ACM Transactions on Networking (TON)
Competitive routing of virtual circuits with unknown duration

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Teletraffic Technologies in ATM Networks

Teletraffic Technologies in ATM Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of virtual path managementin ATM networks, which is the problem of jointly selecting efficientvirtual trunk routes and sizing them to meet end-to-end grade-of-servicerequirements. The problem is posed over capacitated networks andis formulated as a two-levelmulti-commodity network flow problem with linear side-constraints(physical layer capacity) and non-linear side constraints(end-to-end/link blocking). Through avariety of examples we show the method (i) generates solutions that agree withengineering judgement, (ii) can solve VP layout management for realistic sizenetworks (of up to 200 nodes) in reasonable time and (iii) providesupper bounds on how far the solution strays from the mathematicallyoptimal design.