{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:30:39Z","timestamp":1725521439127},"publisher-location":"Boston, MA","reference-count":50,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387306629"},{"type":"electronic","value":"9780387301655"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-30165-5_11","type":"book-chapter","created":{"date-parts":[[2008,12,9]],"date-time":"2008-12-09T12:26:59Z","timestamp":1228825619000},"page":"269-290","source":"Crossref","is-referenced-by-count":3,"title":["Telecommunications Network Design"],"prefix":"10.1007","author":[{"given":"Anders","family":"Forsgren","sequence":"first","affiliation":[]},{"given":"Mikael","family":"Prytz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Network Flows. Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows. Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, New Jersey, 1993."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1287\/mnsc.40.5.567","volume":"40","author":"A. Balakrishnan","year":"1994","unstructured":"A. Balakrishnan, T.L. Magnanti, and P. Mirchandani. A dual-based algorithm for multi-level network design. Management Science, 40:567\u2013581, 1994a.","journal-title":"Management Science"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1287\/mnsc.40.7.846","volume":"40","author":"A. Balakrishnan","year":"1994","unstructured":"A. Balakrishnan, T.L. Magnanti, and P. Mirchandani. Modeling and heuristic worst-case performance analysis of the two-level network design problem. Management Science, 40:846\u2013867, 1994b.","journal-title":"Management Science"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF02071976","volume":"33","author":"A. Balakrishnan","year":"1991","unstructured":"A. Balakrishnan, T.L. Magnanti, A. Shulman, and R.T. Wong. Models for planning capacity expansion in local access telecommunication networks. Annals of Operations Research, 33:239\u2013284, 1991.","journal-title":"Annals of Operations Research"},{"key":"11_CR5","unstructured":"M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser, editors. Network Models, volume 7 of Handbooks in Operations Research and Management Science. Elsevier, 1995a."},{"key":"11_CR6","unstructured":"M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser, editors. Network Routing, volume 8 of Handbooks in Operations Research and Management Science. Elsevier, 1995b."},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1137\/S1052623494279134","volume":"6","author":"F. Barahona","year":"1996","unstructured":"F. Barahona. Network design using cut inequalities. SIAM J. Optimization, 6(3): 823\u2013837, August 1996.","journal-title":"SIAM J. Optimization"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/90.879350","volume":"8","author":"A.W. Berger","year":"2000","unstructured":"A.W. Berger and Y. Kogan. Dimensioning bandwidth for elastic traffic in high-speed data networks. IEEE-ACM Transactions on Networking, 8:643\u2013654, 2000.","journal-title":"IEEE-ACM Transactions on Networking"},{"key":"11_CR9","unstructured":"D. Bertsekas and R. Gallager. Data Networks. Prentice Hall, 1992."},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01581104","volume":"81","author":"D. Bienstock","year":"1998","unstructured":"D. Bienstock, S. Chopra, O. G\u00fcnl\u00fck, and C.-Y. Tsai. Minimum cost capacity installation for multicommodity network flows. Math. Program., 81(2): 177\u2013200, 1998.","journal-title":"Math. Program."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"S. Chen and K. Nahrstedt. An overview of quality of service routing for next-generation high-speed networks: Problems and solutions. IEEE Network, pages 64\u201379, November\/December 1998.","DOI":"10.1109\/65.752646"},{"key":"11_CR12","unstructured":"Cisco Systems Inc., San Jose, CA, USA. OSPF design guide, 2001."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02109865","volume":"2","author":"G. Dahl","year":"1994","unstructured":"G. Dahl. The design of survivable directed networks. Telecommunication Systems, 2: 349\u2013377, 1994.","journal-title":"Telecommunication Systems"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.10.1.1","volume":"10","author":"G. Dahl","year":"1998","unstructured":"G. Dahl and M. Stoer. A cutting plane algorithm for multicommodity survivable network design problems. INFORMS Journal on Computing, 10:1\u201311, 1998.","journal-title":"INFORMS Journal on Computing"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"S. E. Deering. Host extensions for IP multicasting. Request for Comments 1112, Internet Engineering Task Force, August 1989.","DOI":"10.17487\/rfc1112"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"E.W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269\u2013271, 1959.","journal-title":"Numerische Mathematik"},{"volume-title":"Understanding telecoummunications","year":"1997","key":"11_CR17","unstructured":"Ericsson and Telia, editors. Understanding telecoummunications, vol. 1. Studentlitteratur, Lund, Sweden, 1997."},{"volume-title":"Understanding telecoummunications","year":"1998","key":"11_CR18","unstructured":"Ericsson and Telia, editors. Understanding telecoummunications, vol. 2. Studentlitteratur, Lund, Sweden, 1998."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In Proceedings of IEEE INFOCOM\u20192000, pages 519\u2013528. IEEE, 2000.","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"11_CR20","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.S. Garey","year":"1979","unstructured":"M.S. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York, 1979."},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1002\/net.3230120402","volume":"12","author":"B. Gavish","year":"1982","unstructured":"B. Gavish. Topological design of centralized computer networks-formulations and algorithms. Networks, 12:355\u2013377, 1982.","journal-title":"Networks"},{"key":"11_CR22","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover. Tabu search, part I. ORSA Journal on Computing, 1:190\u2013206, 1989.","journal-title":"ORSA Journal on Computing"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02078647","volume":"41","author":"F. Glover","year":"1993","unstructured":"F. Glover, E. Taillard, and D. de Werra. A user\u2019s guide to tabu search. Annals of Operations Research, 41:3\u201328, 1993.","journal-title":"Annals of Operations Research"},{"key":"11_CR24","unstructured":"M.X. Goemans and D.P. Williamson. A primal-dual method for approximation algorithms and its application to network design problems. In D.S. Hochbaum, editor, Approximation Algorithms for NP-hard Problems. PWS Publishing Company, 1997."},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"E. Gourdin, M. Labb\u00e9, and H. Yaman. Telecommunication and location. Technical report, Service de Mathematiques de la Gestion, Universit\u00e9 Libre de Bruxelles, 2001.","DOI":"10.1007\/978-3-642-56082-8_9"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s101070050077","volume":"86","author":"O. G\u00fcnl\u00fck","year":"1999","unstructured":"O. G\u00fcnl\u00fck. A branch-and-cut algorithm for capacitated network design problems. Math. Program., 86:17\u201339, 1999.","journal-title":"Math. Program."},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"J.-B. Hiriart-Urruty and C. Lemar\u00e9chal. Convex Analysis and Minimization Algorithms II, Advanced Theory and Bundle Methods. Springer-Verlag, 1993.","DOI":"10.1007\/978-3-662-06409-2"},{"key":"11_CR28","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/net.3230190304","volume":"19","author":"D.S. Hochbaum","year":"1989","unstructured":"D.S. Hochbaum and A. Segev. Analysis of a flow problem with fixed charges. Networks, 19:291\u2013312, 1989.","journal-title":"Networks"},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1111\/j.1475-3995.1998.tb00135.x","volume":"5","author":"K. Holmberg","year":"1998","unstructured":"K. Holmberg and D. Yuan. A Lagrangean approach to network design problems. International Transactions in Operational Research, 5:529\u2013539, 1998.","journal-title":"International Transactions in Operational Research"},{"key":"11_CR30","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","volume":"48","author":"K. Holmberg","year":"2000","unstructured":"K. Holmberg and D. Yuan. A Lagrangean heuristic based branch-and-bound approach for the capacitated network design problem. Operations Research, 48:461\u2013481, 2000.","journal-title":"Operations Research"},{"key":"11_CR31","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/net.3230080402","volume":"8","author":"D.S. Johnson","year":"1978","unstructured":"D.S. Johnson, J.K. Lenstra, and A.H.G. Rinnooy Kan. The complexity of the network design problem. Networks, 8:279\u2013285, 1978.","journal-title":"Networks"},{"key":"11_CR32","volume-title":"JUNOS Internet Software Configuration Guide: Routing and Routing Protocols, Release 4.3","author":"M. Jones","year":"2001","unstructured":"M. Jones and D. Mitchell. JUNOS Internet Software Configuration Guide: Routing and Routing Protocols, Release 4.3. Juniper Networks Inc., Sunnyvale, CA, USA, 2001."},{"key":"11_CR33","first-page":"141","volume-title":"Stochastic Networks","author":"F.P. Kelly","year":"1996","unstructured":"F.P. Kelly. Notes on effective bandwidths. In Stochastic Networks, pages 141\u2013168. Clarendon Press, Oxford, 1996."},{"key":"11_CR34","unstructured":"A. Kershenbaum. Telecommunications network design algorithms. McGraw Hill, 1993."},{"key":"11_CR35","unstructured":"K. Kilkki. Differentiated services for the Internet. Macmillan technical publishing, 1999."},{"key":"11_CR36","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi. Optimization by simulated annealing. Science, 220:671\u2013680, 1983.","journal-title":"Science"},{"key":"11_CR37","unstructured":"C. Long. IP Network Design. Osborne\/McGraw-Hill, 2001."},{"key":"11_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T.L. Magnanti","year":"1984","unstructured":"T.L. Magnanti and R.T. Wong. Network design and transportation planning: models and algorithms. Transportation Science, 18:1\u201355, 1984.","journal-title":"Transportation Science"},{"key":"11_CR39","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M. Minoux","year":"1989","unstructured":"M. Minoux. Network synthesis and optimum network design problems: models, solution methods and applications. Networks, 19:313\u2013360, 1989.","journal-title":"Networks"},{"key":"11_CR40","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1016\/S0377-2217(99)00083-1","volume":"122","author":"P. Mirchandani","year":"2000","unstructured":"P. Mirchandani. Projections of the capacitated network loading problem. European J. Open Res, 122:534\u2013560, 2000.","journal-title":"European J. Open Res"},{"key":"11_CR41","unstructured":"J. Moy. OSPF: Anatomy of an Internet routing protocol. Addison Wesley, 1998a."},{"key":"11_CR42","doi-asserted-by":"crossref","unstructured":"J. Moy. OSPF version 2. Request for Comments 2328, Internet Engineering Task Force, April 1998b.","DOI":"10.17487\/rfc2328"},{"key":"11_CR43","doi-asserted-by":"crossref","unstructured":"G.L. Nemhauser and L.A. Wolsey. Integer and Combinatorial Optimization. Wiley, 1988.","DOI":"10.1002\/9781118627372"},{"key":"11_CR44","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1109\/90.392383","volume":"3","author":"V. Paxson","year":"1995","unstructured":"V. Paxson and S. Floyd. Wide-area traffic: The failure of poisson modeling. IEEE\/ACM Transactions on Networking, 3:226\u2013244, 1995.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"11_CR45","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.10026","volume":"39","author":"M. Prytz","year":"2002","unstructured":"M. Prytz and A. Forsgren. Dimensioning multicast-enabled communications networks. Networks, 39:216\u2013231, 2002.","journal-title":"Networks"},{"key":"11_CR46","doi-asserted-by":"crossref","unstructured":"B. Quinn and K. Almeroth. IP multicast applications: Challenges and solutions. Request for Comments 3170, Internet Engineering Task Force, September 2001.","DOI":"10.17487\/rfc3170"},{"key":"11_CR47","unstructured":"C.R. Reeves. Modern Heuristic Techniques for Combinatorial Problems. Wiley, 1993."},{"key":"11_CR48","unstructured":"W. Stallings. High-Speed Networks, TCP\/IP and ATM Design Principles. Prentice Hall, 1998."},{"key":"11_CR49","unstructured":"B. Williamson. Developing IP Multicast Networks: The Definitive Guide to Designing and Deploying CISCO IP Multicast Networks. Cisco Press, 2000."},{"key":"11_CR50","volume-title":"Optimization models and methods for communication network design and routing","author":"D. Yuan","year":"2001","unstructured":"D. Yuan. Optimization models and methods for communication network design and routing. PhD thesis, Division of Optimization, Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden, 2001."}],"container-title":["Handbook of Optimization in Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30165-5_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T02:11:44Z","timestamp":1619575904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-30165-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387306629","9780387301655"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30165-5_11","relation":{},"subject":[]}}