Regenerator Location Problem in Flexible Optical Networks

Published Online:https://doi.org/10.1287/opre.2016.1587

References

  • Agrawal GP (2011) Optical Fibers (John Wiley & Sons, Hoboken, NJ), 24–78.Google Scholar
  • Barnhart C, Hane C, Vance P (2000) Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. 48(2):318–326.LinkGoogle Scholar
  • Barnhart C, Hane CA, Johnson EL, Sigismondi G (1994) A column generation and partitioning approach for multi-commodity flow problems. Telecommunication Systems 3(3):239–258.CrossrefGoogle Scholar
  • Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MW, Vance P (1998) Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3):316–329.LinkGoogle Scholar
  • Bosco G, Curri V, Carena A, Poggiolini P, Forghieri F (2011) On the performance of Nyquist-WDM terabit superchannels based on PM-BPSK, PM-QPSK, PM-8QAM or PM-16QAM subcarriers. J. Lightwave Tech. 29(1):53–61.CrossrefGoogle Scholar
  • Cabral EA, Erkut E, Laporte G, Patterson RA (2007) The network design problem with relays. Eur. J. Oper. Res. 180(2):834–844.CrossrefGoogle Scholar
  • Cardillo R, Curri V, Mellia M (2006) Considering transmission impairments in configuring wavelength routed optical networks. Optical Fiber Comm. Conf. (Optical Society of America), OFG6.CrossrefGoogle Scholar
  • Castro A, Velasco L, Ruiz M, Klinkowski M, Fernández-Palacios J, Careglio D (2012) Dynamic routing and spectrum (re)allocation in future flexgrid optical networks. Comput. Networks 56(12):2869–2883.CrossrefGoogle Scholar
  • Chen S, Ljubić I, Raghavan S (2009) The regenerator location problem. Networks 55(3):205–220.Google Scholar
  • Chen S, Ljubić I, Raghavan S (2015) The generalized regenerator location problem. INFORMS J. Comput. 27(2):204–220.LinkGoogle Scholar
  • Cohn A, Barnhart C (2003) Improving crew scheduling by incorporating key maintenance routing decisions. Oper. Res. 51(3):387–396.LinkGoogle Scholar
  • de Azevedo J, Silvestre Madeira J, Vieira Martins E, Pires F (1994) A computational improvement for a shortest paths ranking algorithm. Eur. J. Oper. Res. 73(1):188–191.CrossrefGoogle Scholar
  • Degraeve Z, Jans R (2007) A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times. Oper. Res. 55(5):909–920.LinkGoogle Scholar
  • Desaulniers G (2010) Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Oper. Res. 58(1):179–192.LinkGoogle Scholar
  • Duarte A, Martí R, Resende M, Silva R (2014) Improved heuristics for the regenerator location problem. Internat. Trans. Oper. Res. 21(4):541–558.CrossrefGoogle Scholar
  • Essiambre R, Kramer G, Winzer P, Foschini G, Goebel B (2010) Capacity limits of optical fiber networks. J. Lightwave Tech. 28(4):662–701.CrossrefGoogle Scholar
  • Flammini M, Marchetti-Spaccamela A, Monaco G, Moscardelli L, Zaks S (2011) On the complexity of the regenerator placement problem in optical networks. IEEE/ACM Trans. Networking 19(2):498–511.CrossrefGoogle Scholar
  • Garey M, Johnson D (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, New York).Google Scholar
  • Gendron B, Lucena A, Cunha A, Simonetti L (2012) Benders decomposition, branch-and-cut and hybrid algorithms for the minimum connected dominating set problem. Technical report, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (CIRRELT).Google Scholar
  • Global Action Plan (2007) An inefficient truth. Technical report.Google Scholar
  • He J, Brandt-Pearce M, Pointurier Y, Brown CL, Subramaniam S (2007) Adaptive wavelength assignment using wavelength spectrum separation for distributed optical networks. Proc. IEEE Internat. Conf. Communications, ICC ’07 (IEEE, Piscataway, NJ), 2406–2411.CrossrefGoogle Scholar
  • Huang Y, Heritage JP, Mukherjee B (2005) Connection provisioning with transmission impairment consideration in optical WDM networks with high-speed channels. J. Lightwave Tech. 23(3):982–993.CrossrefGoogle Scholar
  • Hulsermann R, Betker A, Jager M, Bodamer S, Barry M, Spath J, Gauger C, Kohn M (2004) A set of typical transport network scenarios for network modeling. Proc. 5th ITG Workshop Photonic Networks, 65–72.Google Scholar
  • Index, Cisco Visual Networking (2012) Global mobile data traffic forecast update, 2011–2016. Cisco white paper.Google Scholar
  • Jinno M, Takagi T, Kiyokawa K (2015) Minimal virtualized-elastic-regenerator placement and least congestion resources assignment for translucent elastic optical networks. Optical Fiber Communication Conference (Optical Society of America, Washington, DC), paper Th3J.2.CrossrefGoogle Scholar
  • Jinno M, Kozicki B, Takara H, Watanabe A, Sone Y, Tanaka T, Hirano A (2010) Distance-adaptive spectrum resource allocation in spectrum-sliced elastic optical path network [topics in optical communications]. IEEE Comm. Magazine 48(8):138–145.CrossrefGoogle Scholar
  • Jinno M, Takara H, Kozicki B, Tsukishima Y, Sone Y, Matsuoka S (2009) Spectrum-efficient and scalable elastic optical path network: Architecture, benefits, and enabling technologies. IEEE Comm. Magazine 47(11):66–73.CrossrefGoogle Scholar
  • Kahya A (2013) Routing spectrum allocation and regenerator placement in flexible-grid optical networks. Ph.D. thesis, Bilkent University, Bilkent, Turkey.Google Scholar
  • Kewcharoenwong P, Üster H (2014) Benders decomposition algorithms for the fixed-charge relay network design in telecommunications. Telecomm. Systems 56(4):441–453.CrossrefGoogle Scholar
  • Kim S, Seo S (2001) Regenerator placement algorithms for connection establishment in all-optical networks. IEEE Proc. Comm. 148(1):25–30.CrossrefGoogle Scholar
  • Klinkowski M (2012) On the effect of regenerator placement on spectrum usage in translucent elastic optical networks. 14th Internat. Conf. Transparent Optical Networks, ICTON (IEEE, Piscataway, NJ).CrossrefGoogle Scholar
  • Kuby M, Lim S (2005) The flow-refueling location problem for alternative-fuel vehicles. Socio-Economic Planning Sci. 39(2):125–145.CrossrefGoogle Scholar
  • Lübbecke M, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53(6):1007–1023.LinkGoogle Scholar
  • Lucena A, Maculan N, Simonetti L (2010) Reformulations and solution algorithms for the maximum leaf spanning tree problem. Comput. Management Sci. 7(3):289–311.CrossrefGoogle Scholar
  • Manousakis K, Christodoulopoulos K, Kamitsas E, Tomkos I, Varvarigos EA (2009) Offline impairment-aware routing and wavelength assignment algorithms in translucent WDM optical networks. J. Lightwave Tech. 27(12):1866–1877.CrossrefGoogle Scholar
  • Pachnicke S, Paschenda T, Krummrich PM (2008) Physical impairment based regenerator placement and routing in translucent optical networks. Optical Fiber Communication Conference (Optical Society of America, Washington, DC), paper OWA2.CrossrefGoogle Scholar
  • Park K, Kang S, Park S (1996) An integer programming approach to the bandwidth packing problem. Management Sci. 42(9):1277–1291.LinkGoogle Scholar
  • Parker M, Ryan J (1993) A column generation algorithm for bandwidth packing. Telecomm. Systems 2(1):185–195.CrossrefGoogle Scholar
  • Pavon-Mariño P, Azodolmolky S, Aparicio-Pardo R, Garcia-Manrubia B, Pointurier Y, Angelou M, Sole-Pareta J, Garcia-Haro J, Tomkos I (2009) Offline impairment aware RWA algorithms for cross-layer planning of optical networks. J. Lightwave Tech. 27(12):1763–1775.CrossrefGoogle Scholar
  • Ramamurthy B, Datta D, Feng H, Heritage JP, Mukherjee B (1999) Impact of transmission impairments on the teletraffic performance of wavelength-routed optical networks. J. Lightwave Tech. 17(10):1713–1723.CrossrefGoogle Scholar
  • Rizzelli G, Morea A, Tornatore M, Rival O (2012) Energy efficient traffic-aware design of on–off multi-layer translucent optical networks. Comput. Networks 56(10):2443–2455.CrossrefGoogle Scholar
  • Santos L, Coutinho-Rodrigues J, Current J (2007) An improved solution algorithm for the constrained shortest path problem. Transportation Res. Part B Methodological 41(7):756–771.CrossrefGoogle Scholar
  • Sen A, Murthy S, Bandyopadhyay S (2008) On sparse placement of regenerator nodes in translucent optical network. 2008 IEEE Global Telecomm. Conf., GLOBECOM ’08 (IEEE, Piscataway, NJ).CrossrefGoogle Scholar
  • Shen G, Tucker R (2009) Energy-minimized design for IP over WDM networks. J. Optical Comm. Networking 1(1):176–186.CrossrefGoogle Scholar
  • Tomkos I, Palkopoulou E, Angelou M (2012) A survey of recent developments on flexible/elastic optical networking. 14th Internat. Conf. Transparent Optical Networks, ICTON (IEEE, Piscataway, NJ).CrossrefGoogle Scholar
  • Üster H, Kewcharoenwong P (2011) Strategic design and analysis of a relay network in truckload transportation. Transportation Sci. 45(4):505–523.LinkGoogle Scholar
  • Vachani R, Shulman A, Kubat P (1996) Multicommodity flows in ring networks. INFORMS J. Comput. 8(3):235–242.LinkGoogle Scholar
  • Wang X, Brandt-Pearce M, Subramaniam S (2015) Impact of wavelength and modulation conversion on translucent elastic optical networks using MILP. J. Optical Comm. Networking 7(7):644–655.CrossrefGoogle Scholar
  • Yang X, Ramamurthy B (2005) Sparse regeneration in translucent wavelength-routed optical networks: Architecture, network design and wavelength routing. Photonic Network Comm. 10(1):39–53.CrossrefGoogle Scholar
  • Yen J (1971) Finding the k shortest loopless paths in a network. Management Sci. 17(11):712–716.LinkGoogle Scholar
  • Yetginer E, Karasan E (2003) Regenerator placement and traffic engineering with restoration in GMPLS networks. Photonic Network Comm. 6(2):139–149.CrossrefGoogle Scholar
  • Yildiz B, Karasan OE (2015) Regenerator location problem and survivable extensions: A hub covering location perspective. Transportation Res. Part B: Methodological 71:32–55.CrossrefGoogle Scholar
  • Yildiz B, Arslan O, Karasan OE (2016) A branch and price approach for routing and refueling station location model. Eur. J. Oper. Res. 248(3):815–826.CrossrefGoogle Scholar
  • Zsigmond S, Németh G, Cinkler T (2007) Mutual impact of physical impairments and grooming in multilayer networks. Tomkos I, Neri F, Pareta JS, Bruin XM, Lopez SS, eds. Optical Network Design and Modeling (Springer, Berlin), 38–47.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.