Discrete capacity and flow assignment algorithms with performance guarantee

Computer Communications

Volumn 26, Issue 10, 2003, Pages 1056-1069

  Ferreira, Ricardo Poley Martins ^a   Luna, Henrique Pacca Loureiro ^a  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

Author keywords

Capacity and flow assignment; Discrete capacity allocation; Nonconvex multicommodity flow problem; Routing; Separable convexification

Indexed keywords

ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; HEURISTIC METHODS; PACKET NETWORKS; ROUTERS; TELECOMMUNICATION LINKS;

DISCRETE CAPACITY;

COMPUTER NETWORKS;

EID: 0037910410     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(03)00037-9     Document Type: Article

References (27)

1. M. Gerla, The design of store-and-forward (S/F) networks for computer communications, PhD thesis, University of California, Los Angeles, EUA, 1973.
2. Gerla M., Kleinrock L. On the topological design of distributed computer networks. IEEE Transactions on Communications. COM-25:1977;48-60.
3. Luna H.L.P., Mahey P. Bounds for global optimization of capacity expansion and flow assignment problems. Operations Research Letters. 26:2000;211-216.
4. Minoux M. Network synthesis and optimum network design problems: models, solution methods and applications. Network. 19:1989;313-360.
5. Humes C. Jr. A projection-feasible directions method for the continuous capacity and flow assignment. Matemática Aplicada e Computacional. 11:(2):1992.
6. Guisewite G.M. Handbook of Global Optimization. 1995;Kluwer, Dordrecht. Chapter Network Problems, pp. 609-678.
7. S. Ghannadan, Feasibility and global optimality in networks flows, PhD thesis, Linköping University, Linköping, Sweden, 1995.
8. Tuy H. Concave programming under linear constraints. Soviet Mathematics. (5):1964;1437-1440.
9. Gavish B., Neuman I. System for routing and capacity assignment in computer communication networks. IEEE Transactions on Communications. 37:(4):1989;360-366.
10. Gavish B., Altinkemer K. Backbone network design tools with economic tradeoffs. ORSA Journal on Computing. 2:(3):1990;236-252.
11. Amiri A. A system for the design of packet-switched communication networks with economics tradeoffs. Computer Communications. 21:1998;1670-1680.
12. Amiri A., Pirkul H. Routing and capacity assignment in backbone communication networks under time varying traffic conditions. European Journal of Operational Research. 117:1999;15-29.
13. LeBlanc L.J., Simmons R.V. Continuos models for capacity design of large packet-switched telecommunication networks. ORSA Journal on Computing. 1:(4):1989;271-286.
14. Ng T.M.J., Hoang D.B. Joint optimization of capacity and flow assignment in a packet switched communications network. IEEE Transactions on Communications. 35:(2):1987;202-209.
15. Kang C.G., Tan H.H. Combined channel allocation and routing algorithms in packet switched networks. Computer Communications. 20:1997;1175-1190.
16. H.W. Chan, T.Y. Yan, Combined channel allocation, routing and flow control algorithm for packet-switched networks, Technical report, Jet Propulsion Laboratory, 1987.
17. Kleinrock L. On the modeling and analysis of computer networks. Proceedings of the IEEE. 81:(8):1993;1179-1191.
18. Falk J.E. Lagrange multipliers and nonconvex programs. SIAM Journal of Control. 7:1969;534-545.
19. Falk J.E., Soland R.M. An algorithm for separable nonconvex programming problems. Management Science. 15:1969;550-569.
20. Ouorou A., Mahey P., Vial J.P. A survey of algorithms for convex multicommodity flow problems. Management Science. 46:(1):2000;126-147.
21. Horst R., Pardalos P.M., Thoai N.V. Introduction to Global Optimization. 1995;Kluwer, Dordrecht.
22. Rosen J.B., Ornea J.C. Solution of nonlinear programming problems by partitioning. Management Science. (10):1963;160-173.
23. Fratta M., Gerla M., Kleinrock L. The flow deviation method: an approach to store-and-forward communication network design. Networks. 3:1973;97-133.
24. LeBlanc L.J. Design and operation of packet-switched networks with uncertain message requirements. IEEE Transactions on Communications. 38:(8):1990;1223-1227.
25. Zegura E., Calvert K., Bhattacharjee S. How to model an internetwork. Proceedings of the IEEE INFOCOM 96. 1996.
26. Kleinrock L. Computer Applications. Computer Applications. vol. II:1975;Wiley, New York.
27. Beaubrun R., Pierre S. Routing and delay analysis for high-speed networks. Computers and Electrical Engineering. (27):2001;37-53.