Mathematical programming approaches for dual multicast routing problem with multilayer risk cost

This paper addresses a dual multicast routing problem with shared risk link group (SRLG) diverse costs (DMR-SRLGD) that arises from large-scale distribution of realtime multicast data (e.g., internet protocol TV, videocasting, online games, stock price update). The goal of this problem is to find tw...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Annals of operations research Ročník 203; číslo 1; s. 101 - 118
Hlavní autoři:	Liang, Zhe, Lee, Chungmok, Chaovalitwongse, W. Art
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.03.2013 Springer Springer Nature B.V
Témata:	Analysis Business and Management Combinatorics Decomposition Earthquakes Failure Internet Protocol IP (Internet Protocol) Links Mathematical models Mathematical optimization Mathematical programming Multicast Operations research Operations Research/Decision Theory Quality of service Risk Risk management Routing Streaming media Streaming services Studies Telecommunications systems Theory of Computation Trees United States China Multicast Telecommunication Multi-objective Mixed integer program Shared risk link groups
ISSN:	0254-5330, 1572-9338
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	This paper addresses a dual multicast routing problem with shared risk link group (SRLG) diverse costs (DMR-SRLGD) that arises from large-scale distribution of realtime multicast data (e.g., internet protocol TV, videocasting, online games, stock price update). The goal of this problem is to find two redundant multicast trees, each from one of the two sources to every destination at a minimum cost. The cost of the problem contains two parts: the multicast routing cost and the shard common risk cost. Such common risk could cause the failures of multiple links simultaneously. Therefore, the DMR-SRLGD ensures the availability and reliability of multicast service. We formulate an edge-based model for the DMR-SRLGD. In addition, we also propose a path-based model that rises from the Dantzig-Wolfe decomposition of the edge-based model, and develop a column-generation framework to solve the linear relaxation of the path-based formulation. We then employ a branch-and-price solution method to find integer solutions to DMR-SRLGD. We also extend both edge-based and path-based models to handle the complex quality of service requirements. The computational results show the edge-based model is superior than the path-based model for the easy and small test instances, whereas the path-based model provides better solutions in a timely fashion for hard or large test instances.
AbstractList	This paper addresses a dual multicast routing problem with shared risk link group (SRLG) diverse costs (DMR-SRLGD) that arises from large-scale distribution of realtime multicast data (e.g., internet protocol TV, videocasting, online games, stock price update). The goal of this problem is to find two redundant multicast trees, each from one of the two sources to every destination at a minimum cost. The cost of the problem contains two parts: the multicast routing cost and the shard common risk cost. Such common risk could cause the failures of multiple links simultaneously. Therefore, the DMR-SRLGD ensures the availability and reliability of multicast service. We formulate an edge-based model for the DMR-SRLGD. In addition, we also propose a path-based model that rises from the Dantzig-Wolfe decomposition of the edge-based model, and develop a column-generation framework to solve the linear relaxation of the path-based formulation. We then employ a branch-and-price solution method to find integer solutions to DMR-SRLGD. We also extend both edge-based and path-based models to handle the complex quality of service requirements. The computational results show the edge-based model is superior than the path-based model for the easy and small test instances, whereas the path-based model provides better solutions in a timely fashion for hard or large test instances. This paper addresses a dual multicast routing problem with shared risk link group (SRLG) diverse costs (DMR-SRLGD) that arises from large-scale distribution of realtime multicast data (e.g., internet protocol TV, videocasting, online games, stock price update). The goal of this problem is to find two redundant multicast trees, each from one of the two sources to every destination at a minimum cost. The cost of the problem contains two parts: the multicast routing cost and the shard common risk cost. Such common risk could cause the failures of multiple links simultaneously. Therefore, the DMR-SRLGD ensures the availability and reliability of multicast service. We formulate an edge-based model for the DMR-SRLGD. In addition, we also propose a path-based model that rises from the Dantzig-Wolfe decomposition of the edge-based model, and develop a column-generation framework to solve the linear relaxation of the path-based formulation. We then employ a branch-and-price solution method to find integer solutions to DMR-SRLGD. We also extend both edge-based and path-based models to handle the complex quality of service requirements. The computational results show the edge-based model is superior than the path-based model for the easy and small test instances, whereas the path-based model provides better solutions in a timely fashion for hard or large test instances.[PUBLICATION ABSTRACT] This paper addresses a dual multicast routing problem with shared risk link group (SRLG) diverse costs (DMR-SRLGD) that arises from large-scale distribution of realtime multicast data (e.g., internet protocol TV, videocasting, online games, stock price update). The goal of this problem is to find two redundant multicast trees, each from one of the two sources to every destination at a minimum cost. The cost of the problem contains two parts: the multicast routing cost and the shard common risk cost. Such common risk could cause the failures of multiple links simultaneously. Therefore, the DMR-SRLGD ensures the availability and reliability of multicast service. We formulate an edge-based model for the DMR-SRLGD. In addition, we also propose a path-based model that rises from the Dantzig-Wolfe decomposition of the edge-based model, and develop a column-generation framework to solve the linear relaxation of the path-based formulation. We then employ a branch-and-price solution method to find integer solutions to DMR-SRLGD. We also extend both edge-based and path-based models to handle the complex quality of service requirements. The computational results show the edge-based model is superior than the path-based model for the easy and small test instances, whereas the path-based model provides better solutions in a timely fashion for hard or large test instances. Keywords Mixed integer program * Telecommunication * Multicast * Shared risk link groups * Multi-objective
Audience	Academic
Author	Lee, Chungmok Liang, Zhe Chaovalitwongse, W. Art
Author_xml	– sequence: 1 givenname: Zhe surname: Liang fullname: Liang, Zhe organization: Department of Industrial Engineering & Management, Peking University – sequence: 2 givenname: Chungmok surname: Lee fullname: Lee, Chungmok organization: IT Convergence Technology Research Laboratory, ETRI – sequence: 3 givenname: W. Art surname: Chaovalitwongse fullname: Chaovalitwongse, W. Art email: artchao@uw.edu organization: Departments of Industrial & Systems Engineering and Radiology, University of Washington
BookMark	eNp1kctq3TAQhkVJISdpHiA7Qzdd1KlGlyN7GUJvkNJNu1ZkWfJRalunGpmQt6-MC01Ky4DEzHz_MMN_Rk7mODtCLoFeAaXqHQIVqq0p8Bo4qFq8IDuQitUt580J2VEmRS05p6fkDPGeUgrQyB25-2LywU0mB2vG6pjikMw0hXmozLFkxh4cVj6mql9Kf1rGFcRcpbjklSpMN7qpegj5sLVH8-hSlQL-qGzE_Iq89GZEd_H7PyffP7z_dvOpvv368fPN9W1tBZW59tZIaS14LxoLvfLKm9bu-1Zy13Yt73rWcG_AU8aspZxzpZza7_uOtQ2A5efkzTa3bPRzcZj1FNC6cTSziwtq4KyE4Pu2oK__Qu_jkuayXaEoSNo0jP6hBjM6HWYfczJ2HaqvORdUMOCqUFf_oEr0bgq2eORDqT8TvH0i6BYMs8PyYBgOGQezID7HYcNtiojJeX1MYTLpUQPVq_N6c14X5_XqvBZFwzYNFnYeXHpy339FvwCSW7H6
Cites_doi	10.1016/j.comnet.2004.10.013 10.1007/s10559-006-0026-2 10.1007/978-0-387-30165-5_25 10.1023/A:1020359504151 10.1145/633025.633045 10.1002/net.20141 10.1007/978-0-387-30165-5 10.1007/s10898-009-9497-9 10.1109/49.974659 10.1504/IJOR.2005.007439 10.1002/net.3230140406 10.1007/978-1-4613-0255-1_9 10.1016/j.cor.2009.12.009 10.1109/BROADNETS.2004.34 10.1016/j.optcom.2004.11.041 10.1109/TCOMM.2003.809779 10.1109/90.803380 10.1109/TNET.2005.852879 10.1007/BF00248006 10.1109/TNET.2003.810313 10.1002/net.20070 10.1109/JLT.2002.806338 10.1145/383059.383064 10.17487/rfc3031 10.1016/j.comnet.2009.07.005 10.1016/j.cor.2003.12.007 10.1287/opre.1050.0234 10.1007/0-387-25486-2_12
ContentType	Journal Article
Copyright	Springer Science+Business Media New York 2013 COPYRIGHT 2013 Springer
Copyright_xml	– notice: Springer Science+Business Media New York 2013 – notice: COPYRIGHT 2013 Springer
DBID	AAYXX CITATION N95 3V. 7TA 7TB 7WY 7WZ 7XB 87Z 88I 8AL 8AO 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FR3 FRNLG F~G GNUQQ HCIFZ JG9 JQ2 K60 K6~ K7- KR7 L.- L6V M0C M0N M2P M7S P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U
DOI	10.1007/s10479-013-1317-4
DatabaseName	CrossRef Gale Business: Insights ProQuest Central (Corporate) Materials Business File Mechanical & Transportation Engineering Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) ProQuest SciTech Premium Collection Technology Collection Materials Science & Engineering Database ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest SciTech Premium Collection Technology Collection Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Central Business Premium Collection ProQuest Technology Collection ProQuest One Community College ProQuest Central Korea Engineering Research Database Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection Materials Research Database ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database Civil Engineering Abstracts ABI/INFORM Professional Advanced ProQuest Engineering Collection ABI/INFORM Global Computing Database Science Database (ProQuest) Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic
DatabaseTitle	CrossRef Materials Research Database ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest Central China ABI/INFORM Complete Materials Business File ProQuest One Applied & Life Sciences ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition Engineering Research Database ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea ABI/INFORM Complete (Alumni Edition) Civil Engineering Abstracts ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni)
DatabaseTitleList	Materials Research Database Materials Research Database
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Business
EISSN	1572-9338
EndPage	118
ExternalDocumentID	2899707961 A334042137 10_1007_s10479_013_1317_4
Genre	Feature
GeographicLocations	United States China
GeographicLocations_xml	– name: China – name: United States
GroupedDBID	-4X -57 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 2.D 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 7WY 88I 8AO 8FE 8FG 8FL 8TC 8VB 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHQJS AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYQZM AZFZN AZQEC B-. BA0 BAPOH BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DWQXO EBLON EBO EBS EBU EDO EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GROUPED_ABI_INFORM_RESEARCH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IAO IEA IHE IJ- IKXTQ ITC ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV KOW L6V LAK LLZTM M0C M0N M2P M4Y M7S MA- N2Q N95 N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P62 P9M PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS QWB R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZD RZK S16 S1Z S26 S27 S28 S3B SAP SBE SCF SCLPG SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TH9 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z5O Z7R Z7S Z7U Z7V Z7W Z7X Z7Y Z7Z Z81 Z83 Z88 Z8N Z8U Z92 ZL0 ZMTXR ZYFGU ~8M ~A9 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG ADKFA AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION ICD PHGZM PHGZT PQGLB 7TA 7TB 7XB 8AL 8FD 8FK FR3 JG9 JQ2 KR7 L.- PKEHL PQEST PQUKI PRINS Q9U PUEGO
ID	FETCH-LOGICAL-c405t-fca55cc1ff48c1d7f7fa9c6d953e9b93bd283fa1f022cc033377e766db29811c3
IEDL.DBID	RSV
ISICitedReferencesCount	0
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000315353300006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0254-5330
IngestDate	Thu Sep 04 17:36:59 EDT 2025 Wed Nov 05 14:44:25 EST 2025 Sat Nov 29 13:35:01 EST 2025 Sun Nov 23 09:09:02 EST 2025 Sat Nov 29 08:51:14 EST 2025 Sat Nov 29 02:36:29 EST 2025 Fri Feb 21 02:37:03 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Multicast Telecommunication Multi-objective Mixed integer program Shared risk link groups
Language	English
License	http://www.springer.com/tdm
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c405t-fca55cc1ff48c1d7f7fa9c6d953e9b93bd283fa1f022cc033377e766db29811c3
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23
PQID	1301508820
PQPubID	25585
PageCount	18
ParticipantIDs	proquest_miscellaneous_1323234369 proquest_journals_1301508820 gale_infotracmisc_A334042137 gale_infotracacademiconefile_A334042137 gale_businessinsightsgauss_A334042137 crossref_primary_10_1007_s10479_013_1317_4 springer_journals_10_1007_s10479_013_1317_4
PublicationCentury	2000
PublicationDate	20130300 2013-3-00 20130301
PublicationDateYYYYMMDD	2013-03-01
PublicationDate_xml	– month: 3 year: 2013 text: 20130300
PublicationDecade	2010
PublicationPlace	Boston
PublicationPlace_xml	– name: Boston – name: New York
PublicationTitle	Annals of operations research
PublicationTitleAbbrev	Ann Oper Res
PublicationYear	2013
Publisher	Springer US Springer Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer – name: Springer Nature B.V
References	BuriolL. S.ResendeM. G. C.RibeiroC. C.ThorupM.A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routingNetworks2005461365610.1002/net.20070 OliveiraC. A. S.PardalosP. M.ResendeM. G. C.ResendeM. G. C.PardalosP. M.Optimization problems in multicast tree constructionHandbook of optimization in telecommunications2006BerlinSpringer70173110.1007/978-0-387-30165-5_25 Beasley, J. E. (1990). Or-library: distributing test problems by electronic mail. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/steininfo.html. ShenL.YangX.RamanurthyB.Shared risk link group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networksIEEE/ACM Transactions on Networking200513491893110.1109/TNET.2005.852879 LewisJ. M.On the complexity of the maximum subgraph problemProc. 10th annu. ACM symp. theory of computing1978265274 PardalosP.KhouryB.A heuristic for the steiner problem on graphsComputational Optimization and Applications1996651410.1007/BF00248006 BuriolL. S.ResendeM. G. C.ThorupM.Survivable IP network design with OSPF routingNetworks2007491516410.1002/net.20141 LubbeckeM. E.MesrosiersJ.Selected topics in column generationOperations Research20055361007102310.1287/opre.1050.0234 RamamurthyS.SahasrabuddheL.MukherjeeB.Survivable WDM mesh networksJournal of Lightwave Technology200321487088310.1109/JLT.2002.806338 HuJ. Q.Diverse routing in mesh optical networksIEEE Transactions on Communications200351348949410.1109/TCOMM.2003.809779 BanerjeeS.BhattacharjeeB.KommareddyC.Scalable application layer multicastSIGCOMM’02: proc. of the 2002 conference on applications, technologies, architectures, and protocols for computer communications200220521710.1145/633025.633045 GautamN.Buffered and unbuffered leaky bucket policing: guaranteeing QoS, design and admission controlTelecommunications Systems2002211356310.1023/A:1020359504151 SahasrabuddheL.RamamurthyS.MukherjeeB.Fault management in IP-over-WDM networks: WDM protection versus IP restorationIEEE Journal on Selected Areas in Communications2002201213310.1109/49.974659 Sheridan-SmithN.LeaneyJ.O’NeillT.HunterM.A policy-driven autonomous system for evolutive and adaptive management of complex services and networksProceedings of the 12th IEEE international conference and workshops on the engineering of computer-based systems2005389397 MedardM.FinnS. G.BarryR. A.Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphsIEEE/ACM Transactions on Networking19997564165210.1109/90.803380 OliveiraC. A. S.PardalosP. M.QueridoT. M.A combinatorial algorithm for message scheduling on controller area networksInternational Journal of Operations Research20051216017110.1504/IJOR.2005.007439 PaulP.RaghavanS. V.Survey of multicast routing algorithms and protocolsProc. of the fifteenth international conference on computer communication (ICCC 2002)2002902926 ZangH.OuC.MukherjeeB.Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraintsIEEE/ACM Transactions on Networking200311224825810.1109/TNET.2003.810313 GroverW. D.Mesh-based survivable networks2003New YorkPrentice Hall IravaV. S.HauserC.Survivable low-cost low-delay multicast treesProc. of global telecommunications conference, GLOBECOM’052005109115 LiangZ.ChaovalitwongseW. A.ChaM.MoonS.Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithmsComputers & Operations Research201037101731173910.1016/j.cor.2009.12.009 VanderbeckF.DesaulniersG.DesrosiersJ.SolomonM. M.Implementing mixed integer column generationColumn generation2005BerlinSpringer33135810.1007/0-387-25486-2_12 YuanS.JueJ. P.Dynamic lightpath protection in WDM mesh networks under wavelength-continuity and risk-disjoint constraintsComputer Networks2005489111210.1016/j.comnet.2004.10.013 ChaM.ChaovalitwongseW. A.YatesJ.ShaikhA.MoonS.Efficient and scalable provisioning of always-on multicast streaming servicesComputer Networks200953162825283910.1016/j.comnet.2009.07.005 GuoL.YuH.LiL.A new shared-path protection algorithm under shared risk link group constraints for survivable WDM mesh networksOptics Communications200524628529510.1016/j.optcom.2004.11.041 AhujaR. K.MagnatiT. L.OrlinJ. B.Network flows: theory, algorithms and applications1993New YorkPrentice Hall YannakakisM.Node- and edge-deletion NP-complete problemsProc. 10th annu. ACM symp. theory of computing1978253264 Rosen, E., Viswanathan, A., & Callon, R. (2001). Multiprotocol label switching architecture. IETF, RFC 3031 [Online]. Available: http://tools.ietf.org/html/rfc3031.html. DesrocsiersJ.SoumisF.DesrochersM.Routing with time windows by column generationNetworks19841454556510.1002/net.3230140406 BhandariR.Survivable networks: algorithms for diverse routing1999NorwellKluwer Academic RamaswamiR.SivarajanK.Optical networks: a practical perspective1998San MateoMorgan Kaufmann LiG.DoverspikeR.KalmanekC.Fiber span failure protection in mesh optical networksSociety of photo-optical instrumentation engineers (SPIE) conference series2001130141 GareyM. R.JohnsonD. S.Computers and intractability: a guide to the theory of NP-completeness1979New YorkFreeman XinY.RouskasG. N.Multicast routing under optical layer constraintsINFOCOM 2004. Twenty-third annual joint conference of the IEEE computer and communications societies200427312742 DattaP.SomaniA. K.Diverse routing for shared risk resource groups (SRRG) failures in WDM optical networksProc. of the first international conference on broadband networks (BROADNETS)200412012910.1109/BROADNETS.2004.34 KochT.MartinA.VossS.ChengX.ZhuD.-Z.SteinLib: an updated library on Steiner tree problems in graphsSteiner trees in industries2001BerlinSpringer28532610.1007/978-1-4613-0255-1_9 OliveiraC. A. S.PardalosP. M.Construction algorithms and approximation bounds for the streaming cache placement problems in multicast networksCybernetics and Systems Analysis200541689890810.1007/s10559-006-0026-2 RyanD.FosterB.WrenA.An integer programming approach to schedulingComputer schedule of public transport urban passenger vehicle and crew scheduling1981AmsterdamElsevier269280 ChuY.RaoS. G.SeshanS.ZhangH.Enabling conferencing applications on the Internet using an overlay multicast architectureSIGCOMM’01: proc. of the 2001 conference on applications, technologies, architectures, and protocols for computer communications2001556710.1145/383059.383064 EllinasG.BouilletE.RamamurthyR.LabourdetteJ.ChaudhuriS.BalaK.Routing and restoration architectures in mesh optical networksOptical Networks Magazine20034191105 OliveiraC. A. S.PardalosP. M.A survey of combinatorial optimization problems in multicast routingComputers & Operations Research20053281953198110.1016/j.cor.2003.12.007 RossetiI.de AragaoM. P.RibeiroC. C.UchoaE.WerneckR. F.New benchmark instances for the Steiner problem in graphsProc. 4th metaheuristics international conference2001557591 ResendeM. G. C.PardalosP. M.Handbook of optimization in telecommunications2006BerlinSpringer10.1007/978-0-387-30165-5 ChaM.ChaovalitwongseW. A.MoonS.ShaikhA.YatesJ.Path protection routing with SRLG constraints to support IPTV in WDM mesh networksProceedings of IEEE Global Internet Symposium2006 WolseyL.Integer programming1998New YorkWiley LiangZ.ChaovalitwongseW. A.Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree modelsJournal of Global Optimization201038233534510.1007/s10898-009-9497-9 L. S. Buriol (1317_CR5) 2005; 46 M. Cha (1317_CR7) 2006 C. A. S. Oliveira (1317_CR26) 2005; 32 M. Yannakakis (1317_CR44) 1978 S. Yuan (1317_CR45) 2005; 48 I. Rosseti (1317_CR36) 2001 L. S. Buriol (1317_CR6) 2007; 49 L. Guo (1317_CR16) 2005; 246 R. K. Ahuja (1317_CR1) 1993 T. Koch (1317_CR19) 2001 Z. Liang (1317_CR22) 2010; 38 M. Cha (1317_CR8) 2009; 53 M. G. C. Resende (1317_CR34) 2006 M. Medard (1317_CR25) 1999; 7 L. Sahasrabuddhe (1317_CR38) 2002; 20 V. S. Irava (1317_CR18) 2005 D. Ryan (1317_CR37) 1981 C. A. S. Oliveira (1317_CR29) 2006 P. Paul (1317_CR31) 2002 1317_CR35 L. Wolsey (1317_CR42) 1998 S. Ramamurthy (1317_CR32) 2003; 21 N. Sheridan-Smith (1317_CR40) 2005 G. Ellinas (1317_CR12) 2003; 4 P. Pardalos (1317_CR30) 1996; 6 R. Bhandari (1317_CR4) 1999 J. Q. Hu (1317_CR17) 2003; 51 R. Ramaswami (1317_CR33) 1998 1317_CR3 S. Banerjee (1317_CR2) 2002 N. Gautam (1317_CR14) 2002; 21 W. D. Grover (1317_CR15) 2003 M. R. Garey (1317_CR13) 1979 Z. Liang (1317_CR23) 2010; 37 J. Desrocsiers (1317_CR11) 1984; 14 Y. Chu (1317_CR9) 2001 J. M. Lewis (1317_CR20) 1978 M. E. Lubbecke (1317_CR24) 2005; 53 H. Zang (1317_CR46) 2003; 11 G. Li (1317_CR21) 2001 L. Shen (1317_CR39) 2005; 13 C. A. S. Oliveira (1317_CR27) 2005; 41 F. Vanderbeck (1317_CR41) 2005 P. Datta (1317_CR10) 2004 Y. Xin (1317_CR43) 2004 C. A. S. Oliveira (1317_CR28) 2005; 1
References_xml	– reference: Sheridan-SmithN.LeaneyJ.O’NeillT.HunterM.A policy-driven autonomous system for evolutive and adaptive management of complex services and networksProceedings of the 12th IEEE international conference and workshops on the engineering of computer-based systems2005389397 – reference: GareyM. R.JohnsonD. S.Computers and intractability: a guide to the theory of NP-completeness1979New YorkFreeman – reference: ChuY.RaoS. G.SeshanS.ZhangH.Enabling conferencing applications on the Internet using an overlay multicast architectureSIGCOMM’01: proc. of the 2001 conference on applications, technologies, architectures, and protocols for computer communications2001556710.1145/383059.383064 – reference: BhandariR.Survivable networks: algorithms for diverse routing1999NorwellKluwer Academic – reference: GroverW. D.Mesh-based survivable networks2003New YorkPrentice Hall – reference: ResendeM. G. C.PardalosP. M.Handbook of optimization in telecommunications2006BerlinSpringer10.1007/978-0-387-30165-5 – reference: DattaP.SomaniA. K.Diverse routing for shared risk resource groups (SRRG) failures in WDM optical networksProc. of the first international conference on broadband networks (BROADNETS)200412012910.1109/BROADNETS.2004.34 – reference: EllinasG.BouilletE.RamamurthyR.LabourdetteJ.ChaudhuriS.BalaK.Routing and restoration architectures in mesh optical networksOptical Networks Magazine20034191105 – reference: HuJ. Q.Diverse routing in mesh optical networksIEEE Transactions on Communications200351348949410.1109/TCOMM.2003.809779 – reference: LubbeckeM. E.MesrosiersJ.Selected topics in column generationOperations Research20055361007102310.1287/opre.1050.0234 – reference: PaulP.RaghavanS. V.Survey of multicast routing algorithms and protocolsProc. of the fifteenth international conference on computer communication (ICCC 2002)2002902926 – reference: RyanD.FosterB.WrenA.An integer programming approach to schedulingComputer schedule of public transport urban passenger vehicle and crew scheduling1981AmsterdamElsevier269280 – reference: BuriolL. S.ResendeM. G. C.RibeiroC. C.ThorupM.A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routingNetworks2005461365610.1002/net.20070 – reference: YuanS.JueJ. P.Dynamic lightpath protection in WDM mesh networks under wavelength-continuity and risk-disjoint constraintsComputer Networks2005489111210.1016/j.comnet.2004.10.013 – reference: SahasrabuddheL.RamamurthyS.MukherjeeB.Fault management in IP-over-WDM networks: WDM protection versus IP restorationIEEE Journal on Selected Areas in Communications2002201213310.1109/49.974659 – reference: RamaswamiR.SivarajanK.Optical networks: a practical perspective1998San MateoMorgan Kaufmann – reference: BanerjeeS.BhattacharjeeB.KommareddyC.Scalable application layer multicastSIGCOMM’02: proc. of the 2002 conference on applications, technologies, architectures, and protocols for computer communications200220521710.1145/633025.633045 – reference: Beasley, J. E. (1990). Or-library: distributing test problems by electronic mail. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/steininfo.html. – reference: IravaV. S.HauserC.Survivable low-cost low-delay multicast treesProc. of global telecommunications conference, GLOBECOM’052005109115 – reference: RamamurthyS.SahasrabuddheL.MukherjeeB.Survivable WDM mesh networksJournal of Lightwave Technology200321487088310.1109/JLT.2002.806338 – reference: BuriolL. S.ResendeM. G. C.ThorupM.Survivable IP network design with OSPF routingNetworks2007491516410.1002/net.20141 – reference: ChaM.ChaovalitwongseW. A.MoonS.ShaikhA.YatesJ.Path protection routing with SRLG constraints to support IPTV in WDM mesh networksProceedings of IEEE Global Internet Symposium2006 – reference: Rosen, E., Viswanathan, A., & Callon, R. (2001). Multiprotocol label switching architecture. IETF, RFC 3031 [Online]. Available: http://tools.ietf.org/html/rfc3031.html. – reference: LiG.DoverspikeR.KalmanekC.Fiber span failure protection in mesh optical networksSociety of photo-optical instrumentation engineers (SPIE) conference series2001130141 – reference: MedardM.FinnS. G.BarryR. A.Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphsIEEE/ACM Transactions on Networking19997564165210.1109/90.803380 – reference: ShenL.YangX.RamanurthyB.Shared risk link group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networksIEEE/ACM Transactions on Networking200513491893110.1109/TNET.2005.852879 – reference: GuoL.YuH.LiL.A new shared-path protection algorithm under shared risk link group constraints for survivable WDM mesh networksOptics Communications200524628529510.1016/j.optcom.2004.11.041 – reference: AhujaR. K.MagnatiT. L.OrlinJ. B.Network flows: theory, algorithms and applications1993New YorkPrentice Hall – reference: GautamN.Buffered and unbuffered leaky bucket policing: guaranteeing QoS, design and admission controlTelecommunications Systems2002211356310.1023/A:1020359504151 – reference: LiangZ.ChaovalitwongseW. A.ChaM.MoonS.Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithmsComputers & Operations Research201037101731173910.1016/j.cor.2009.12.009 – reference: RossetiI.de AragaoM. P.RibeiroC. C.UchoaE.WerneckR. F.New benchmark instances for the Steiner problem in graphsProc. 4th metaheuristics international conference2001557591 – reference: OliveiraC. A. S.PardalosP. M.A survey of combinatorial optimization problems in multicast routingComputers & Operations Research20053281953198110.1016/j.cor.2003.12.007 – reference: KochT.MartinA.VossS.ChengX.ZhuD.-Z.SteinLib: an updated library on Steiner tree problems in graphsSteiner trees in industries2001BerlinSpringer28532610.1007/978-1-4613-0255-1_9 – reference: ChaM.ChaovalitwongseW. A.YatesJ.ShaikhA.MoonS.Efficient and scalable provisioning of always-on multicast streaming servicesComputer Networks200953162825283910.1016/j.comnet.2009.07.005 – reference: OliveiraC. A. S.PardalosP. M.Construction algorithms and approximation bounds for the streaming cache placement problems in multicast networksCybernetics and Systems Analysis200541689890810.1007/s10559-006-0026-2 – reference: LewisJ. M.On the complexity of the maximum subgraph problemProc. 10th annu. ACM symp. theory of computing1978265274 – reference: PardalosP.KhouryB.A heuristic for the steiner problem on graphsComputational Optimization and Applications1996651410.1007/BF00248006 – reference: XinY.RouskasG. N.Multicast routing under optical layer constraintsINFOCOM 2004. Twenty-third annual joint conference of the IEEE computer and communications societies200427312742 – reference: WolseyL.Integer programming1998New YorkWiley – reference: OliveiraC. A. S.PardalosP. M.ResendeM. G. C.ResendeM. G. C.PardalosP. M.Optimization problems in multicast tree constructionHandbook of optimization in telecommunications2006BerlinSpringer70173110.1007/978-0-387-30165-5_25 – reference: VanderbeckF.DesaulniersG.DesrosiersJ.SolomonM. M.Implementing mixed integer column generationColumn generation2005BerlinSpringer33135810.1007/0-387-25486-2_12 – reference: LiangZ.ChaovalitwongseW. A.Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree modelsJournal of Global Optimization201038233534510.1007/s10898-009-9497-9 – reference: OliveiraC. A. S.PardalosP. M.QueridoT. M.A combinatorial algorithm for message scheduling on controller area networksInternational Journal of Operations Research20051216017110.1504/IJOR.2005.007439 – reference: ZangH.OuC.MukherjeeB.Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraintsIEEE/ACM Transactions on Networking200311224825810.1109/TNET.2003.810313 – reference: DesrocsiersJ.SoumisF.DesrochersM.Routing with time windows by column generationNetworks19841454556510.1002/net.3230140406 – reference: YannakakisM.Node- and edge-deletion NP-complete problemsProc. 10th annu. ACM symp. theory of computing1978253264 – volume: 48 start-page: 91 year: 2005 ident: 1317_CR45 publication-title: Computer Networks doi: 10.1016/j.comnet.2004.10.013 – volume: 41 start-page: 898 issue: 6 year: 2005 ident: 1317_CR27 publication-title: Cybernetics and Systems Analysis doi: 10.1007/s10559-006-0026-2 – start-page: 701 volume-title: Handbook of optimization in telecommunications year: 2006 ident: 1317_CR29 doi: 10.1007/978-0-387-30165-5_25 – start-page: 389 volume-title: Proceedings of the 12th IEEE international conference and workshops on the engineering of computer-based systems year: 2005 ident: 1317_CR40 – volume: 21 start-page: 35 issue: 1 year: 2002 ident: 1317_CR14 publication-title: Telecommunications Systems doi: 10.1023/A:1020359504151 – volume-title: Network flows: theory, algorithms and applications year: 1993 ident: 1317_CR1 – start-page: 205 volume-title: SIGCOMM’02: proc. of the 2002 conference on applications, technologies, architectures, and protocols for computer communications year: 2002 ident: 1317_CR2 doi: 10.1145/633025.633045 – volume: 49 start-page: 51 issue: 1 year: 2007 ident: 1317_CR6 publication-title: Networks doi: 10.1002/net.20141 – volume-title: Handbook of optimization in telecommunications year: 2006 ident: 1317_CR34 doi: 10.1007/978-0-387-30165-5 – volume-title: Proceedings of IEEE Global Internet Symposium year: 2006 ident: 1317_CR7 – volume: 38 start-page: 335 issue: 2 year: 2010 ident: 1317_CR22 publication-title: Journal of Global Optimization doi: 10.1007/s10898-009-9497-9 – volume: 20 start-page: 21 issue: 1 year: 2002 ident: 1317_CR38 publication-title: IEEE Journal on Selected Areas in Communications doi: 10.1109/49.974659 – volume: 1 start-page: 160 issue: 2 year: 2005 ident: 1317_CR28 publication-title: International Journal of Operations Research doi: 10.1504/IJOR.2005.007439 – start-page: 269 volume-title: Computer schedule of public transport urban passenger vehicle and crew scheduling year: 1981 ident: 1317_CR37 – volume: 14 start-page: 545 year: 1984 ident: 1317_CR11 publication-title: Networks doi: 10.1002/net.3230140406 – start-page: 557 volume-title: Proc. 4th metaheuristics international conference year: 2001 ident: 1317_CR36 – volume-title: Computers and intractability: a guide to the theory of NP-completeness year: 1979 ident: 1317_CR13 – start-page: 285 volume-title: Steiner trees in industries year: 2001 ident: 1317_CR19 doi: 10.1007/978-1-4613-0255-1_9 – volume: 37 start-page: 1731 issue: 10 year: 2010 ident: 1317_CR23 publication-title: Computers & Operations Research doi: 10.1016/j.cor.2009.12.009 – start-page: 120 volume-title: Proc. of the first international conference on broadband networks (BROADNETS) year: 2004 ident: 1317_CR10 doi: 10.1109/BROADNETS.2004.34 – volume: 246 start-page: 285 year: 2005 ident: 1317_CR16 publication-title: Optics Communications doi: 10.1016/j.optcom.2004.11.041 – volume: 51 start-page: 489 issue: 3 year: 2003 ident: 1317_CR17 publication-title: IEEE Transactions on Communications doi: 10.1109/TCOMM.2003.809779 – start-page: 130 volume-title: Society of photo-optical instrumentation engineers (SPIE) conference series year: 2001 ident: 1317_CR21 – volume: 7 start-page: 641 issue: 5 year: 1999 ident: 1317_CR25 publication-title: IEEE/ACM Transactions on Networking doi: 10.1109/90.803380 – volume: 13 start-page: 918 issue: 4 year: 2005 ident: 1317_CR39 publication-title: IEEE/ACM Transactions on Networking doi: 10.1109/TNET.2005.852879 – volume: 6 start-page: 5 year: 1996 ident: 1317_CR30 publication-title: Computational Optimization and Applications doi: 10.1007/BF00248006 – start-page: 253 volume-title: Proc. 10th annu. ACM symp. theory of computing year: 1978 ident: 1317_CR44 – volume-title: Integer programming year: 1998 ident: 1317_CR42 – ident: 1317_CR3 – volume: 11 start-page: 248 issue: 2 year: 2003 ident: 1317_CR46 publication-title: IEEE/ACM Transactions on Networking doi: 10.1109/TNET.2003.810313 – volume: 46 start-page: 36 issue: 1 year: 2005 ident: 1317_CR5 publication-title: Networks doi: 10.1002/net.20070 – start-page: 109 volume-title: Proc. of global telecommunications conference, GLOBECOM’05 year: 2005 ident: 1317_CR18 – volume: 21 start-page: 870 issue: 4 year: 2003 ident: 1317_CR32 publication-title: Journal of Lightwave Technology doi: 10.1109/JLT.2002.806338 – start-page: 55 volume-title: SIGCOMM’01: proc. of the 2001 conference on applications, technologies, architectures, and protocols for computer communications year: 2001 ident: 1317_CR9 doi: 10.1145/383059.383064 – ident: 1317_CR35 doi: 10.17487/rfc3031 – volume: 53 start-page: 2825 issue: 16 year: 2009 ident: 1317_CR8 publication-title: Computer Networks doi: 10.1016/j.comnet.2009.07.005 – volume-title: Mesh-based survivable networks year: 2003 ident: 1317_CR15 – volume: 32 start-page: 1953 issue: 8 year: 2005 ident: 1317_CR26 publication-title: Computers & Operations Research doi: 10.1016/j.cor.2003.12.007 – volume-title: Survivable networks: algorithms for diverse routing year: 1999 ident: 1317_CR4 – start-page: 902 volume-title: Proc. of the fifteenth international conference on computer communication (ICCC 2002) year: 2002 ident: 1317_CR31 – volume-title: Optical networks: a practical perspective year: 1998 ident: 1317_CR33 – volume: 53 start-page: 1007 issue: 6 year: 2005 ident: 1317_CR24 publication-title: Operations Research doi: 10.1287/opre.1050.0234 – start-page: 331 volume-title: Column generation year: 2005 ident: 1317_CR41 doi: 10.1007/0-387-25486-2_12 – start-page: 2731 volume-title: INFOCOM 2004. Twenty-third annual joint conference of the IEEE computer and communications societies year: 2004 ident: 1317_CR43 – volume: 4 start-page: 91 issue: 1 year: 2003 ident: 1317_CR12 publication-title: Optical Networks Magazine – start-page: 265 volume-title: Proc. 10th annu. ACM symp. theory of computing year: 1978 ident: 1317_CR20
SSID	ssj0001185
Score	1.9970485
Snippet	This paper addresses a dual multicast routing problem with shared risk link group (SRLG) diverse costs (DMR-SRLGD) that arises from large-scale distribution of...
SourceID	proquest gale crossref springer
SourceType	Aggregation Database Index Database Publisher
StartPage	101
SubjectTerms	Analysis Business and Management Combinatorics Decomposition Earthquakes Failure Internet Protocol IP (Internet Protocol) Links Mathematical models Mathematical optimization Mathematical programming Multicast Operations research Operations Research/Decision Theory Quality of service Risk Risk management Routing Streaming media Streaming services Studies Telecommunications systems Theory of Computation Trees
SummonAdditionalLinks	– databaseName: Science Database (ProQuest) dbid: M2P link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3BbtQwEB1BqRAcKCwgAm3lSiAkkMVm7U3iU1WhVr206oFKvbnOxEZI7aass3w_M1ln2wWVC5dcPHEcTTzzYj_PA3g_dgXqBnlXd1pIyvhjWWuspMZQB1M36KrQi02Up6fVxYU5SwtuMdEqh5jYB-qmRV4j_0KxlkuXU8Lav_kpWTWKd1eThMZDeETIJmdK18nkbBWJCTz3FEb6CZLMohx2NZdH53TJTCElc0qhUq_lpT-j81_bpH32Odr633E_h2cJd4qD5YfyAh742QgeD7T3EWwN8g4izfYRPL1Tq_AlXJ6sCrxSP4nWdU1NYihL7qMgBCz4cJfoeYroYifm7YKZ1SIp1whe-F02XzmC-4K57QLb2L2C86PDb1-PZZJnkEgor5MB3XSKmIegK8ybMpTBGSwaM1Xe1EbVDUGX4PJAMAFxrJQqS18WLGBlqjxH9Ro2Zu3MvwGBxnuyV7VTta4niiJwRXeaKowb3UxcBp8G59ibZRUOe1tvmT1pyZOWPWl1Bh_YfTapeNIl8jpH_O4WMdoDpTQFqlyVGXzs7Xgmd3OHLh1IoCFxTaw1y-01S5qBuN48uN6mCBDtrd8z2Fs1853Mapv5dsE2hGeVVoXJ4PPwgd3p4r43fPvvB76DJ5NetIOZctuw0c0Xfgc28Vf3I853-ynyG4i0GJk priority: 102 providerName: ProQuest
Title	Mathematical programming approaches for dual multicast routing problem with multilayer risk cost
URI	https://link.springer.com/article/10.1007/s10479-013-1317-4 https://www.proquest.com/docview/1301508820 https://www.proquest.com/docview/1323234369
Volume	203
WOSCitedRecordID	wos000315353300006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: 7WY dateStart: 19990101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: M0C dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: P5Z dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: K7- dateStart: 19990101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: M7S dateStart: 19990101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: BENPR dateStart: 19990101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 1572-9338 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: M2P dateStart: 19990101 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1572-9338 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001185 issn: 0254-5330 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3db9MwED-xDSH2wKAMERiVkUBIIEtJ7cTx4zZtQkKrqo2PwUtwLjFCghbV6f5-7tKka_l4gJeTKl-s1PHd_ZL7-Q7gWewy1BVyVjfNJEX8WJYac6nRl96WFbrct80mzHicX17aSXeOO_Rs9z4l2XrqtcNu2jC3R8mEgp7UW7BD0S7nfg3nF-9X7pcQc8tbpDcfydTJPpX5pyk2gtGvLvm33Ggbck73_utm78KdDmGKw-WWuAc36ukAbvUE9wHs9Y0cRGfXA9hdq0p4Hz6frUq50jwdges7DYm-AHkdBGFdwce4RMtIRBcaMZ8tmEMtuh41gj_xLoe_OQL2glnsAmeh2Yd3pydvj1_LrhGDRMJzjfTo0hQx8V7nmFTGG-8sZpVNVW1Lq8qKQIp3iSdAgBgrpYypTcatqmyeJKgewPZ0Nq0fgkBb16SvSqdKXY4U-dqcrrS5jytdjVwEL_snUvxY1tsorisr86IWtKgFL2qhI3jOz6zo-nWSCPxFI3xxixCKQ6U0uaREmQhetHpss83coeuOHtAtcfWrDc2DDU2yNdwc7ndH0dl64IQgF9UnKBXB09UwX8n8tWk9W7AOIVelVWYjeNXvmLUp_vYPH_2T9mO4PWq7dTBF7gC2m_mifgI38ar5GuZD2DIfPg5h5-hkPDmnX2-MJHkWH7McTViaC5KT9NOwNamfBjcVYg
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VgngcKCxFBAoYiQoJZHUTe_M4IFQBVau2qx6K1JvrTGyEBLtlnQXxp_iNzOSx7YLg1gOXXDxxXl9mxvbn-QCeD22KukJe1R2lkiL-UJYac6nRl74oK7S5b8QmsvE4PzkpjlbgZ78XhmmVvU9sHHU1RZ4j3yJfy6XLKWC9OfsqWTWKV1d7CY0WFvvux3casoXXe-_o-24myc7747e7slMVkEjJSS092tEIMfZe5xhXmc-8LTCtipFyRVmosqKI623sKbohDpVSWeaylHWXijyOUVG_V-Cq5spiTBVMjhaen5L1hjJJgy7JrM1-FbXdqqczZiYpGVPIlnopDv4eDf5Ylm2i3c7a__ae7sDtLq8W2-2PcBdW3GQA13ta_wDWevkK0XmzAdy6UIvxHpweLgrYUj8dbe0LNYm-7LoLgjJ8wZvXRMPDRBtqMZvOmTkuOmUewRPbbfNnS8MZwdx9gdNQr8OHS3kB92F1Mp24ByCwcI7sVWlVqctEUYTJ6cwi98NKV4mN4GUPBnPWVhkx5_WkGTmGkGMYOUZHsMlwMZ1KKR0Cz-OEj3YegtlWSpMjjlUWwYvGjj1VPbNouw0XdEtc82vJcmPJkjwMLjf3UDOdhwvmHGcRPFs085nM2pu46ZxtKF9XWqVFBK96QF_o4m9P-PDfF3wKN3aPDw_Mwd54_xHcTBqBEmYFbsBqPZu7x3ANv9WfwuxJ83sKOL1snP8CpL12_g
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Nb9QwEB2Vgio4UFhABAoYiQqJyuomdr4OCFWUFVVhtQeQKi6uM4lRpbIpmyyIv8avYyYbb7sguPXAJRdPnK-XeWP7eQbg2dAmqEvkVd04kcT4Q1lozKRGV7i8KNFmris2kY7H2dFRPlmDn34vDMsqvU_sHHVZI8-R75Kv5dTlRFi7rpdFTPZHr86-Sq4gxSutvpzGAiKH1Y_vNHxrXh7s07fejqLRmw-v38q-woBEClRa6dDGMWLonM4wLFOXOptjUuaxqvIiV0VJ7Ots6IjpEIdKqTSt0oRrMOVZGKKifq_A1ZTGmCwnnMSflixAgXsnn6QBmGQFp19RXWzb0ymrlJQMib6lXuHE35nhjyXajvlGm__zO7sFN_t4W-wtfpDbsFZNB7Dh5f4D2PRlLUTv5QZw40KOxjtw_H6Z2Jb66eVsX6hJ-HTsVSMo8he8qU10-ky0TStm9ZwV5aKv2CN4wnvRfGppmCNY0y-wbtq78PFSXsA9WJ_W0-o-CMyriuxVYVWhi0gR82R0Zp65YanLyAbwwgPDnC2yj5jzPNOMIkMoMowiowPYZuiYvnopHRqe32k-23nTmD2lNDnoUKUBPO_s2IO1M4u234hBt8S5wFYst1YsyfPgarOHnek9X2POMRfA02Uzn8lqvmlVz9mG4nilVZIHsOPBfaGLvz3hg39f8AlsELzNu4Px4UO4HnV1S1gsuAXr7WxePYJr-K09aWaPuz9VwPFlw_wX1M1_6g
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Mathematical+programming+approaches+for+dual+multicast+routing+problem+with+multilayer+risk+cost&rft.jtitle=Annals+of+operations+research&rft.au=Liang%2C+Zhe&rft.au=Lee%2C+Chungmok&rft.au=Chaovalitwongse%2C+W.+Art&rft.date=2013-03-01&rft.pub=Springer&rft.issn=0254-5330&rft.volume=203&rft.issue=1&rft.spage=101&rft_id=info:doi/10.1007%2Fs10479-013-1317-4&rft.externalDBID=N95&rft.externalDocID=A334042137
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0254-5330&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0254-5330&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0254-5330&client=summon