Abstract
We consider the design and capacity expansion of ATM networks as an optimization problem in which flows representing end-to-end variable bit-rate services of different classes are to be multiplexed and routed over ATM trunks and switches so as to minimize the costs of additional switches and transport pipes while meeting service quality and survivability constraints. After an overview of the underlying fractional Brownian motion model for aggregate flows, a nonlinear multicommodity optimization problem is formulated and LP-based heuristics for its approximate solutions are described. Finally, computational results are produced that demonstrate realistic size problems can be solved with the proposed method to shed light on key economic characteristics of ATM traffic, such as safe levels of statistical multiplexing, as well as robust and efficient design alternatives.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Balakrishnan, T. Magnanti and R. Wong, A dual-ascent procedure for large-scale uncapacitated network design, INFORMS Operations Research 37 (1989) 716-740.
F. Barahona, Network design using cut inequalities, SIAM Journal on Optimization 6 (1996) 823-837.
V. Benes, General Stochastic Processes in the Theory of Queues (Addison-Wesley, Reading, MA, 1963).
D. Bienstock, Experiments with a network design algorithm using e-approximate linear programs (1996) submitted.
D. Bienstock and O. Günlük, Capacitated network design — polyhedral structure and computation, INFORMS Journal on Computing (1996) 243-260.
D. Bienstock, S. Chopra, O. Günlük and C. Tsai, Minimum cost capacity installation for multicommodity network flows, Mathematical Programming (Special issue on Computational Integer Programming) (1995) to appear.
T. Carpenter, D. Heyman and I. Saniee, Studies of random demands on network costs, to appear in Telecommunication Systems (1996).
V. Chvatal, A greedy heuristic for the set-covering problem, Mathematics of Operations Research (1975) 233-235.
A. Erramilli, W. Willinger and O. Narayan, Experimental queueing analysis with long-range dependent packet traffic, IEEE Transactions on Networking (April 1996).
B. Gavish et al., Fiber optic circuit network design under reliability constraints, IEEE Journal on Selected Areas in Communications 7(8) (1989).
W. Leland, M. Taqqu, D. Wilson and W. Willinger, On the self-similar nature of Ethernet traffic, IEEE/ACM Transactions on Networking (1994) 1-15.
T. Magnanti, P. Mirchandani and R. Vachani, The convex hull of two core capacitated network design problems, Mathematical Programming (1993) 233-250.
T. Magnanti, P. Mirchandani and R. Vachani, Modeling and solving the two facility capacitated network loading problem, INFORMS Operations Research 43 (1995) 142-157.
T. Magnanti and Y. Wang, Polyhedral properties of the network restoration problem-with the convex hull of a special case, MIT ORC Working Paper OR 323-97 (November 1997).
D. Medhi, Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable ATM networks, IEEE/ACMTransactions on Networking 3 (1995) 809-818.
D. Mitra, J.A. Morrison and K.G. Ramakrishnan, ATMnetwork design and optimization: A multirate loss network design, IEEE/ACM Transactions on Networking 4 (1996) 531-543.
O. Narayan, Exact asymptotic queue length distribution for fractional Brownian traffic, Advances in Performance Analysis 1(1) (1998) 39-63.
G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988).
I. Norros, A storage model with self-similar input, Queueing Systems 16 (1994) 387-396.
Y. Pochet and L.A. Wolsey, Network design with divisible capacities: Aggregated flow and knapsack subproblems, in: Proc. of IPCO2, Pittsburgh, 1992, pp. 150-164.
I. Saniee, Optimal routing designs in self-healing communications networks, International Transactions in Operational Research 3 (1996) 187-195.
I. Saniee, A. Erramilli and C. Pack, The economics of statistical multiplexing in broadband networks, in: Teletraffic Contributions for the Information Age, Proc. of ITC15,Washington, DC, 1997, pp. 815-824.
M. Stoer and G. Dahl, A polyhedral approach to multicommodity survivable network design, Technical Report, University of Oslo, Department of Informatics (1995).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bienstock, D., Saniee, I. ATM Network Design: Traffic Models and Optimization-Based Heuristics. Telecommunication Systems 16, 399–421 (2001). https://doi.org/10.1023/A:1016671128891
Issue Date:
DOI: https://doi.org/10.1023/A:1016671128891