Topological Design of Two-Level Telecommunication Networks with Modular Switches

References

• Ahuja R. K., Magnanti T. L., Orlin J. B., Nemhauser G. L., Rinnooy Kan A. H. G., Todd M. J. Network flows. Handbooks in Operations Research and Management Science: Optimization (1989) 1(North-Holland, Amsterdam, The Netherlands) 211–369Google Scholar
• Balakrishnan A., Magnanti T. L., Shulman A., Wong R. T. Models for planning capacity expansion in local access telecommunication networks. Ann. Oper. Res. (1991) 33:239–284Crossref, Google Scholar
• Balas E. The prize collecting Traveling Salesman Problem. ORSA/TIMS Spring Meeting (1986) Google Scholar
• Balas E. The prize collecting Traveling Salesman Problem. Networks (1989) 19:621–636Crossref, Google Scholar
• Balas E. The prize collecting Traveling Salesman Problem: II. polyhedral results. Networks (1995) 25:199–216Crossref, Google Scholar
• Ballert R., Ching Y.-C. SONET: Now it's the standard optical network. IEEE Comm. Magazine (1989) 29:8–15Crossref, Google Scholar
• Chamberland S., Marcotte O., Sansò B. On the joint topological, dimensioning and location problem for broadband networks. Proc. Internat. IFIP-IEEE Conference on Broadband Communications (1996) 525–536Crossref, Google Scholar
• CPLEX Optimization, Inc Using the CPLEX callable library and CPLEX mixed integer library. (1993) Google Scholar
• Doshi Dravida, Harshavardhana. Overview of INDT: A new tool for the next generation network design. Proc. GLOBECOM (1995) 1942–1946Crossref, Google Scholar
• Fischetti M., Toth P., Golden B. L., Assad A. A. An additive approach for the optimal solution of the prize-collecting Travelling Salesman Problem. Vehicle Routing: Methods and Studies (1988) (North-Holland, Amsterdam, The Netherlands) 319–343Google Scholar
• Garey M., Johnson D. Computers and intractability—a guide to the theory of NP-Completeness. (1979) (Freeman, San Francisco, CA) Google Scholar
• Gavish B. Topological design of centralized computer networks—formulations and algorithms. Networks (1982) 12:355–377Crossref, Google Scholar
• Gavish B. Topological design of telecommunication networks—local access design methods. Ann. Oper. Res. (1991) 33:17–71Crossref, Google Scholar
• Gendreau M., Hertz A., Laporte G. New insertion and post-optimization procedures for the Traveling Salesman Problem. Oper. Res. (1992) 40:1086–1094Link, Google Scholar
• Gendreau M., Labbé M., Laporte G. Efficient heuristics for the design of ring networks. Telecommunication Systems (1995) 4:177–188Crossref, Google Scholar
• Glover F. Tabu search—Part I. ORSA J. Comput. (1989) 1:190–206Link, Google Scholar
• Glover F. Tabu search—Part II. ORSA J. Comput. (1990) 2:4–31Link, Google Scholar
• Glover F., Taillard E., de Werra D. A user's guide to tabu search. Ann. Oper. Res. (1993) 41:3–28Crossref, Google Scholar
• Händel R., Huber M. N., Schröder S.ATM Networks: Concepts, Protocols, Applications (1994) (Addison-Wesley, Boston, MA) Google Scholar
• Jonker R., Volgenant T. A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing (1987) 38:325–340Crossref, Google Scholar
• Kennington J., Wang Z. An empirical analysis of the dense assignment problem: Sequential and parallel implementations. ORSA J. Comput. (1991) 4:299–306Link, Google Scholar
• Kershenbaum A.Telecommunication Network Design Algorithms (1993) (McGraw-Hill, New York) Series in Computer ScienceGoogle Scholar
• Kim J.-G., Tcha D.-W. Optimal design of a two-level hierarchical network with tree-star configuration. Comput. Indust. Eng. (1992) 22:273–281Crossref, Google Scholar
• Klincewicz J. G. Hub location in backbone/tributary network design: A review. Location Sci. (1998) 6:307–335Crossref, Google Scholar
• Klincewicz J. G., Luss H., Yan D. C. K. Designing tributary networks with multiple ring families. Comput. Oper. Res. (1998) 25:1145–1157Crossref, Google Scholar
• Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Shmoys D. B.Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985) (Wiley, New York) Google Scholar
• Lee C.-H., Ro H.-B., Tcha D.-W. Topological design of a two-level network with ring-star configuration. Comput. Oper. Res. (1993) 20:625–637Crossref, Google Scholar
• Lee Y., Qiu Y., Ryan J. Branch and cut algorithms for a Steiner tree-star problem. INFORMS J. Comput. (1996) 8:194–201Link, Google Scholar
• Magnanti T. L., Wong R. T. Network design and transportation planning: Models and algorithms. Transp. Sci. (1984) 18:1–55Link, Google Scholar
• Minoux M. Network synthesis and optimum network design problems: Models, solution methods and applications. Networks (1989) 19:313–360Crossref, Google Scholar
• Minzner S. E. Broadband ISDN and asynchronous transfer mode (ATM). IEEE Comm. Magazine (1989) 27:17–24Crossref, Google Scholar
• Narula S. C., Ho C. A. Degree-constrained minimum spanning tree. Comput. Oper. Res. (1980) 7:239–249Crossref, Google Scholar
• Ross F. E. An overview of FDDI: The fiber optic distributed data interface. J. Selected Areas in Comm. (1989) 7:1043–1051Crossref, Google Scholar
• Ross F. E. FDDI—a tutorial. IEEE Comm. Magazine (1986) 24:10–17Crossref, Google Scholar
• Savelsbergh M., Volgenant T. Edge exchanges in the degree-constrained minimum spanning tree problem. Comput. Oper. Res. (1985) 12:341–348Crossref, Google Scholar
• Sharma R. L.Network Topology Optimization (1990) (Van Nostrand Reinhold, New York) Google Scholar
• Stallings W.ISDN and Broadband ISDN with Frame Relay and ATM (1995) (Prentice-Hall, Englewood, Cliffs, NJ) Google Scholar
• Steenstrup M.Routing in Communications Networks (1995) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Volgenant A. A Lagrangean approach to the Degree-Constrained Minimum Spanning Tree Problem. Eur. J. Oper. Res. (1989) 39:325–331Crossref, Google Scholar
• Wu T. H.Fiber Network Service Survivability (1992) (Artech House)Google Scholar
• Yan J., Beshai M. Designing an ATM-based broadband network: An overview. Proc. GLOBECOM (1995) 245–251Crossref, Google Scholar