ATM network design: Traffic models and optimization-based heuristics

被引:5
作者
Bienstock, D [1 ]
Saniee, I
机构
[1] Columbia Univ, IEOR, New York, NY 10027 USA
[2] Lucent Technol, Bell Labs, Murray Hill, NJ 07974 USA
关键词
ATM; network design; traffic model; multicommodity network flow; integer programming; combinatorial optimization heuristics;
D O I
10.1023/A:1016671128891
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
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.
引用
收藏
页码:399 / 421
页数:23
相关论文
共 23 条
[1]   A DUAL-ASCENT PROCEDURE FOR LARGE-SCALE UNCAPACITATED NETWORK DESIGN [J].
BALAKRISHNAN, A ;
MAGNANTI, TL ;
WONG, RT .
OPERATIONS RESEARCH, 1989, 37 (05) :716-740
[2]   Network design using cut inequalities [J].
Barahona, F .
SIAM JOURNAL ON OPTIMIZATION, 1996, 6 (03) :823-837
[3]  
Benes V., 1963, GEN STOCHASTIC PROCE
[4]  
Bienstock D., 1996, INFORMS Journal on Computing, V8, P243, DOI 10.1287/ijoc.8.3.243
[5]  
BIENSTOCK D, 1995, IN PRESS MATH PROGRA
[6]  
BIENSTOCK D, 1996, UNPUB EXPT NETWORK D
[7]  
CARPENTER T, 1996, IN PRESS TELECOMMUNI
[8]  
CHVATAL V, 1975, MATH OPER RES, P233
[9]  
ERRAMILLI A, 1996, IEEE T NETWORKIN APR
[10]  
GAVISH B, 1989, IEEE J SELECTED AREA, V7