IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v63y2016icp23-40.html
   My bibliography  Save this article

Fiber optical network design problems: A case for Turkey

Author

Listed:
  • Yazar, Başak
  • Arslan, Okan
  • Karaşan, Oya Ekin
  • Kara, Bahar Y.

Abstract

In this paper, we consider problems originating from one of the largest Internet service providers operating in Turkey. The company mainly faces two different design problems: the green field design (area with no Internet access) and the copper field re-design (area with limited access over copper networks). In the green field design problem, the aim is to design a least cost fiber optical network that will provide high bandwidth Internet access from a given central station to a set of aggregated demand nodes. Such an access can be provided either directly by installing fibers or indirectly by utilizing passive splitters. Insertion loss, bandwidth level and distance limitations should simultaneously be considered in order to provide a least cost design to enable the required service level. In the re-design of the copper field application, the aim is to improve the current service level by augmenting the network with fiber optical wires, specifically by adding cabinets to copper rings in the existing infrastructure and by constructing direct fiber links from cabinets to distant demand nodes. Mathematical models are constructed for both problem specifications. Extensive computational results based on realistic data from Kartal (45 nodes) and Bakırköy (74 nodes) districts in Istanbul show that the proposed models are viable exact solution methodologies for moderate dimensions.

Suggested Citation

  • Yazar, Başak & Arslan, Okan & Karaşan, Oya Ekin & Kara, Bahar Y., 2016. "Fiber optical network design problems: A case for Turkey," Omega, Elsevier, vol. 63(C), pages 23-40.
    • Handle: RePEc:eee:jomega:v:63:y:2016:i:c:p:23-40
    DOI: 10.1016/j.omega.2015.10.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048315002030
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2015.10.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. C.D. Randazzo & H.P.L. Luna, 2001. "A Comparison of Optimal Methods for Local Access Uncapacitated Network Design," Annals of Operations Research, Springer, vol. 106(1), pages 263-286, September.
    2. Kılcı, Fırat & Kara, Bahar Yetiş & Bozkaya, Burçin, 2015. "Locating temporary shelter areas after an earthquake: A case for Turkey," European Journal of Operational Research, Elsevier, vol. 243(1), pages 323-332.
    3. Margaret L. Brandeau & Samuel S. Chiu, 1989. "An Overview of Representative Problems in Location Research," Management Science, INFORMS, vol. 35(6), pages 645-674, June.
    4. Ljubić, Ivana & Putz, Peter & Salazar-González, Juan-José, 2014. "A MIP-based approach to solve the prize-collecting local access network design problem," European Journal of Operational Research, Elsevier, vol. 235(3), pages 727-739.
    5. Kim, Youngjin & Lee, Youngho & Han, Junghee, 2011. "A splitter location-allocation problem in designing fiber optic access networks," European Journal of Operational Research, Elsevier, vol. 210(2), pages 425-435, April.
    6. T. L. Magnanti & R. T. Wong, 1984. "Network Design and Transportation Planning: Models and Algorithms," Transportation Science, INFORMS, vol. 18(1), pages 1-55, February.
    7. Costa, Alysson M. & França, Paulo M. & Lyra Filho, Christiano, 2011. "Two-level network design with intermediate facilities: An application to electrical distribution systems," Omega, Elsevier, vol. 39(1), pages 3-13, January.
    8. Chardy, M. & Costa, M.-C. & Faye, A. & Trampont, M., 2012. "Optimizing splitter and fiber location in a multilevel optical FTTH network," European Journal of Operational Research, Elsevier, vol. 222(3), pages 430-440.
    9. Lee, Deok-Joo & Ahn, Jae-Kyoung, 2007. "Factors affecting companies' telecommunication service selection strategy," Omega, Elsevier, vol. 35(5), pages 486-493, October.
    10. Doubleday, CF & Probert, DE & Walsham, G, 1983. "A strategic model of communications demand," Omega, Elsevier, vol. 11(4), pages 343-354.
    11. Park, Chanwoo & Lee, Youngho & Kim, Youngjin & Park, Gigyoung, 2014. "An access network design problem with end-to-end QoS constraints," Omega, Elsevier, vol. 48(C), pages 36-48.
    12. Fischer, MJ & Garbin, DA & Harris, TC & Knepley, JE, 1978. "Large scale communication networks--Design and analysis," Omega, Elsevier, vol. 6(4), pages 331-340.
    13. de Sá, Elisangela Martins & de Camargo, Ricardo Saraiva & de Miranda, Gilberto, 2013. "An improved Benders decomposition algorithm for the tree of hubs location problem," European Journal of Operational Research, Elsevier, vol. 226(2), pages 185-202.
    14. Anantaram Balakrishnan & Thomas L. Magnanti & Richard T. Wong, 1995. "A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning," Operations Research, INFORMS, vol. 43(1), pages 58-76, February.
    15. Domschke, Wolfgang & Krispin, Gabriela, 1997. "Location and layout planning: a survey," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 8164, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    16. Contreras, Ivan & Fernández, Elena & Marín, Alfredo, 2010. "The Tree of Hubs Location Problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 390-400, April.
    17. Premkumar, G & King, WR, 1990. "Strategic telecommunications planning--A descriptive model," Omega, Elsevier, vol. 18(5), pages 447-462.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Belieres, Simon & Hewitt, Mike, 2024. "Hedging against uncertainty in transportation network design through flexible scheduling," Omega, Elsevier, vol. 126(C).
    2. Wu, Xinyun & Lü, Zhipeng & Glover, Fred, 2020. "A matheuristic for a telecommunication network design problem with traffic grooming," Omega, Elsevier, vol. 90(C).
    3. Guazzelli, Cauê Sauter & Cunha, Claudio B., 2018. "Exploring K-best solutions to enrich network design decision-making," Omega, Elsevier, vol. 78(C), pages 139-164.
    4. Arslan, Okan & Archetti, Claudia & Jabali, Ola & Laporte, Gilbert & Grazia Speranza, Maria, 2020. "Minimum cost network design in strategic alliances," Omega, Elsevier, vol. 96(C).
    5. Murray, Alan T., 2021. "Contemporary optimization application through geographic information systems," Omega, Elsevier, vol. 99(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chardy, M. & Costa, M.-C. & Faye, A. & Trampont, M., 2012. "Optimizing splitter and fiber location in a multilevel optical FTTH network," European Journal of Operational Research, Elsevier, vol. 222(3), pages 430-440.
    2. Alumur, Sibel A. & Campbell, James F. & Contreras, Ivan & Kara, Bahar Y. & Marianov, Vladimir & O’Kelly, Morton E., 2021. "Perspectives on modeling hub location problems," European Journal of Operational Research, Elsevier, vol. 291(1), pages 1-17.
    3. Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
    4. Ivan Contreras & Moayad Tanash & Navneet Vidyarthi, 2017. "Exact and heuristic approaches for the cycle hub location problem," Annals of Operations Research, Springer, vol. 258(2), pages 655-677, November.
    5. Alumur, Sibel A. & Kara, Bahar Y. & Karasan, Oya E., 2012. "Multimodal hub location and hub network design," Omega, Elsevier, vol. 40(6), pages 927-939.
    6. Blanco, Víctor & Puerto, Justo & Ramos, Ana B., 2011. "Expanding the Spanish high-speed railway network," Omega, Elsevier, vol. 39(2), pages 138-150, April.
    7. Gouveia, Luís & Lopes, Maria João & de Sousa, Amaro, 2015. "Single PON network design with unconstrained splitting stages," European Journal of Operational Research, Elsevier, vol. 240(2), pages 361-371.
    8. van de Leensel, R.L.J.M. & Flippo, O.E. & Koster, Arie M.C.A. & Kolen, A.W.J., 1996. "A dynamic programming algorithm for the local access network expansion problem," Research Memorandum 027, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    9. Fragkos, Ioannis & Cordeau, Jean-François & Jans, Raf, 2021. "Decomposition methods for large-scale network expansion problems," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 60-80.
    10. S Mudchanatongsuk & F Ordóñez & J Liu, 2008. "Robust solutions for network design under transportation cost and demand uncertainty," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 652-662, May.
    11. Corte-Real, Margarida & Gouveia, Luís, 2010. "A node rooted flow-based model for the local access network expansion problem," European Journal of Operational Research, Elsevier, vol. 204(1), pages 20-34, July.
    12. Scheibe, Kevin P. & Ragsdale, Cliff T., 2009. "A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 773-784, September.
    13. Li, Gang & Balakrishnan, Anantaram, 2016. "Models and algorithms for network reduction," European Journal of Operational Research, Elsevier, vol. 248(3), pages 930-942.
    14. Linos F. Frantzeskakis & Hanan Luss, 1999. "The network redesign problem for access telecommunications networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 487-506, August.
    15. Taherkhani, Gita & Alumur, Sibel A., 2019. "Profit maximizing hub location problems," Omega, Elsevier, vol. 86(C), pages 1-15.
    16. Crainic, Teodor Gabriel & Gendron, Bernard & Akhavan Kazemzadeh, Mohammad Rahim, 2022. "A taxonomy of multilayer network design and a survey of transportation and telecommunication applications," European Journal of Operational Research, Elsevier, vol. 303(1), pages 1-13.
    17. Martins de Sá, Elisangela & Contreras, Ivan & Cordeau, Jean-François, 2015. "Exact and heuristic algorithms for the design of hub networks with multiple lines," European Journal of Operational Research, Elsevier, vol. 246(1), pages 186-198.
    18. Bütün, Cihan & Petrovic, Sanja & Muyldermans, Luc, 2021. "The capacitated directed cycle hub location and routing problem under congestion," European Journal of Operational Research, Elsevier, vol. 292(2), pages 714-734.
    19. Zetina, Carlos Armando & Contreras, Ivan & Fernández, Elena & Luna-Mota, Carlos, 2019. "Solving the optimum communication spanning tree problem," European Journal of Operational Research, Elsevier, vol. 273(1), pages 108-117.
    20. Morton O’Kelly & Henrique Luna & Ricardo Camargo & Gilberto Miranda, 2015. "Hub Location Problems with Price Sensitive Demands," Networks and Spatial Economics, Springer, vol. 15(4), pages 917-945, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:63:y:2016:i:c:p:23-40. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.