Long-Distance Access Network Design

Management Science

Volumn 50, Issue 3, 2004, Pages 309-325

  Berger, Rosemary T ^a   Raghavan, S ^b  

^a Lehigh University   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Hub location; Integer programming; Network flows; Queueing; Telecommunications

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COSTS; FEES AND CHARGES; INTEGER PROGRAMMING; LONG DISTANCE TELEPHONE SYSTEMS; OPTIMIZATION; QUALITY OF SERVICE; QUEUEING NETWORKS; RANDOM PROCESSES; SOCIETIES AND INSTITUTIONS;

HUB LOCATION; NETWORK FLOWS;

TELECOMMUNICATION NETWORKS;

EID: 1842732690     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.1030.0161     Document Type: Review

References (15)

1. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs, NJ.
2. Balakrishnan, A., T. L. Magnanti, A. Shulman, R. T. Wong. 1991. Models for planning capacity expansion in local access telecommunication networks. Ann. Oper. Res. 33 239-284.
3. Boorstyn, R. B., H. Frank. 1977. Large-scale network topological optimization. IEEE Trans. Comm. 25 29-47.
4. Chen, Z.-L. 2003. Personal e-mail communication.
5. FCC. 1999. Fifth report and order and further notice of proposed rule making. Technical report FCC99-206, Federal Communications Commission, Washington, D.C.
6. FCC. 2001. Statistics of the long distance telecommunications industry. Technical report, Federal Communications Commission, Industry Analysis Division, Common Carrier Bureau, Washington, D.C.
7. Frantzeskakis, L. F., H. Luss. 1999. The network redesign problem for access telecommunications networks. Naval Res. Logist. 46 487-506.
8. Freeman, R. L. 1996. Telecommunication System Engineering. John Wiley and Sons, New York.
9. Gavish, B. 1991. Topological design of telecommunication networks - Local access design methods. Ann. Oper. Res. 33 17-71.
10. Lande, J., K. Lynch. 2002. Telecommunications industry revenues 2000. Technical report, Federal Communications Commission, Industry Analysis Division, Common Carrier Bureau, Washington, D.C.
11. Mcgregor, P., D. Shen. 1977. Network design: An algorithm for the access facility location problem. IEEE Trans. Comm. 25 61-73.
12. Messerli, E. J. 1972. Proof of a convexity property of the Erlang B formula. Bell System Tech. J. 51 951-953.
13. Nemhauser, G. L., L. A. Wolsey. 1999. Integer and Combinatorial Optimization. John Wiley and Sons, New York.
14. Salman, F. S., R. Ravi, J. Hooker. 2001. Solving the local access network design problem. Technical report, Krannert School of Management, Purdue University, West Lafayette, IN.
15. Sherali, H. D., Y. Lee, T. Park. 2000. New modeling approaches for the design of local access transport area networks. Eur. J. Oper. Res. 127 94-108.