{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:33:29Z","timestamp":1753274009195,"version":"3.30.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T00:00:00Z","timestamp":1728518400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T00:00:00Z","timestamp":1728518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Korea governmen","award":["ITP-2024-RS-2023-0025596"],"award-info":[{"award-number":["ITP-2024-RS-2023-0025596"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s11235-024-01217-3","type":"journal-article","created":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T20:22:12Z","timestamp":1728591732000},"page":"991-1013","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Linear programming based heuristic algorithms for tunnel assignment and reconfiguration in MPLS networks"],"prefix":"10.1007","volume":"87","author":[{"given":"Seulgi","family":"Joung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaehyeon","family":"Ryu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sun-Hyeon","family":"Kwon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jongyoon","family":"Shin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sungsoo","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,10]]},"reference":[{"issue":"1","key":"1217_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10479-006-0150-4","volume":"150","author":"Y Ak\u00e7ay","year":"2007","unstructured":"Ak\u00e7ay, Y., Li, H., & Xu, S. H. (2007). Greedy algorithm for the general multidimensional knapsack problem. Annals of Operations Research, 150(1), 17\u201329.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"1217_CR2","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.icte.2021.12.010","volume":"8","author":"A Alidadi","year":"2022","unstructured":"Alidadi, A., Arab, S., & Askari, T. (2022). A novel optimized routing algorithm for QoS traffic engineering in SDN-based mobile networks. ICT Express, 8(1), 130\u2013134.","journal-title":"ICT Express"},{"issue":"18","key":"1217_CR3","doi-asserted-by":"publisher","first-page":"2129","DOI":"10.1016\/j.artint.2011.07.003","volume":"175","author":"H Aljazzar","year":"2011","unstructured":"Aljazzar, H., & Leue, S. (2011). K$$\\ast $$: A heuristic search algorithm for finding the k shortest paths. Artificial Intelligence, 175(18), 2129\u20132154.","journal-title":"Artificial Intelligence"},{"issue":"5","key":"1217_CR4","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1023\/B:HEUR.0000004811.65073.d3","volume":"9","author":"D Allen","year":"2003","unstructured":"Allen, D., Ismail, I., Kennington, J., et al. (2003). An incremental procedure for improving path assignment in a telecommunications network. Journal of Heuristics, 9(5), 375\u2013399.","journal-title":"Journal of Heuristics"},{"key":"1217_CR5","doi-asserted-by":"crossref","unstructured":"Awduche, D., Malcolm, J., Agogbua, J., et\u00a0al. (1999). Requirements for traffic engineering over MPLS. RFC2702.","DOI":"10.17487\/rfc2702"},{"issue":"2","key":"1217_CR6","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1287\/opre.48.2.318.12378","volume":"48","author":"C Barnhart","year":"2000","unstructured":"Barnhart, C., Hane, C. A., & Vance, P. H. (2000). Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research, 48(2), 318\u2013326.","journal-title":"Operations Research"},{"key":"1217_CR7","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. (2009). Robust optimization (Vol. 28). Princeton: Princeton University Press."},{"key":"1217_CR8","volume-title":"Data networks","author":"DP Bertsekas","year":"1992","unstructured":"Bertsekas, D. P., Gallager, R. G., & Humblet, P. (1992). Data networks (Vol. 2). Hoboken: Prentice-Hall International."},{"issue":"3","key":"1217_CR9","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D. B., & Caramanis, C. (2011). Theory and applications of robust optimization. SIAM Review, 53(3), 464\u2013501.","journal-title":"SIAM Review"},{"issue":"5","key":"1217_CR10","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1109\/JSAC.2007.070608","volume":"25","author":"W Bigos","year":"2007","unstructured":"Bigos, W., Cousin, B., Gosselin, S., et al. (2007). Survivable MPLS over optical transport networks: Cost and resource usage analysis. IEEE Journal on Selected Areas in Communications, 25(5), 949\u2013962.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"1217_CR11","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2024.3411104","author":"S Bikas","year":"2024","unstructured":"Bikas, S., & Say\u0131t, M. (2024). Improving QoE with genetic algorithm-based path selection for MPTCP. IEEE Transactions on Network and Service Management. https:\/\/doi.org\/10.1109\/TNSM.2024.3411104","journal-title":"IEEE Transactions on Network and Service Management"},{"key":"1217_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to stochastic programming","author":"JR Birge","year":"2011","unstructured":"Birge, J. R., & Louveaux, F. (2011). Introduction to stochastic programming. Berlin: Springer."},{"issue":"2\u20133","key":"1217_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0166-5316(02)00177-3","volume":"52","author":"JE Burns","year":"2003","unstructured":"Burns, J. E., Ott, T. J., Krzesinski, A. E., et al. (2003). Path selection and bandwidth allocation in MPLS networks. Performance Evaluation, 52(2\u20133), 133\u2013152.","journal-title":"Performance Evaluation"},{"key":"1217_CR14","doi-asserted-by":"publisher","first-page":"117337","DOI":"10.1016\/j.eswa.2022.117337","volume":"203","author":"RBC Butkeraites","year":"2022","unstructured":"Butkeraites, R. B. C., de Salles Neto, L. L., & Gendreau, M. (2022). A sampling-based multi-objective iterative robust optimization method for bandwidth packing problem. Expert Systems with Applications, 203, 117337.","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"1217_CR15","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1109\/TNET.2009.2031064","volume":"18","author":"R Cohen","year":"2010","unstructured":"Cohen, R., & Nakibly, G. (2010). Maximizing restorable throughput in MPLS networks. IEEE\/ACM Transactions on Networking, 18(2), 568\u2013581.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"1217_CR16","doi-asserted-by":"crossref","unstructured":"Duong, H., Jaumard, B., & Coudert, D. (2021). Minimum disturbance rerouting to optimize bandwidth usage. In 2021 international conference on optical network design and modeling (ONDM) (pp. 1\u20136), IEEE.","DOI":"10.23919\/ONDM51796.2021.9492388"},{"issue":"2","key":"1217_CR17","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein, D. (1998). Finding the k shortest paths. SIAM Journal on Computing, 28(2), 652\u2013673.","journal-title":"SIAM Journal on Computing"},{"key":"1217_CR18","doi-asserted-by":"crossref","unstructured":"Erbas, S.C., & Erbas, C. (2003). A multiobjective off-line routing model for MPLS networks. In Teletraffic science and engineering (pp. 471\u2013480), vol\u00a05. Elsevier","DOI":"10.1016\/S1388-3437(03)80192-0"},{"issue":"6","key":"1217_CR19","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1109\/TC.2018.2874483","volume":"68","author":"ZM Fadlullah","year":"2018","unstructured":"Fadlullah, Z. M., Mao, B., Tang, F., et al. (2018). Value iteration architecture based deep learning for intelligent routing exploiting heterogeneous computing platforms. IEEE Transactions on Computers, 68(6), 939\u2013950.","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"1217_CR20","doi-asserted-by":"publisher","first-page":"2409","DOI":"10.1007\/s12652-020-02365-5","volume":"12","author":"MI Goulamghoss","year":"2021","unstructured":"Goulamghoss, M. I., & Bassoo, V. (2021). Analysis of traffic engineering and fast reroute on multiprotocol label switching. Journal of Ambient Intelligence and Humanized Computing, 12(2), 2409\u20132420.","journal-title":"Journal of Ambient Intelligence and Humanized Computing"},{"issue":"3","key":"1217_CR21","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1287\/ijoc.1120.0523","volume":"25","author":"J Han","year":"2013","unstructured":"Han, J., Lee, K., Lee, C., et al. (2013). Exact algorithms for a bandwidth packing problem with queueing delay guarantees. INFORMS Journal on Computing, 25(3), 585\u2013596.","journal-title":"INFORMS Journal on Computing"},{"issue":"12","key":"1217_CR22","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1057\/palgrave.jors.2601796","volume":"55","author":"M Hifi","year":"2004","unstructured":"Hifi, M., Michrafy, M., & Sbihi, A. (2004). Heuristic algorithms for the multiple-choice multidimensional knapsack problem. Journal of the Operational Research Society, 55(12), 1323\u20131332.","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"1217_CR23","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1364\/JOCN.11.000052","volume":"11","author":"B Jaumard","year":"2019","unstructured":"Jaumard, B., Duong, H. Q., Armolavicius, R., et al. (2019). Efficient real-time scalable make-before-break network re-routing. Journal of Optical Communications and Networking, 11(3), 52\u201366.","journal-title":"Journal of Optical Communications and Networking"},{"issue":"1","key":"1217_CR24","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s11590-016-1005-9","volume":"11","author":"S Jayaswal","year":"2017","unstructured":"Jayaswal, S., Vidyarthi, N., & Das, S. (2017). A cutting plane approach to combinatorial bandwidth packing problem with queuing delays. Optimization Letters, 11(1), 225\u2013239.","journal-title":"Optimization Letters"},{"issue":"5","key":"1217_CR25","doi-asserted-by":"publisher","first-page":"2015","DOI":"10.1109\/TNET.2019.2935382","volume":"27","author":"X Jia","year":"2019","unstructured":"Jia, X., Li, D., Zhu, J., et al. (2019). Metro: An efficient traffic fast rerouting scheme with low overhead. IEEE\/ACM Transactions on Networking, 27(5), 2015\u20132027.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"1217_CR26","doi-asserted-by":"publisher","first-page":"106374","DOI":"10.1016\/j.cor.2023.106374","volume":"160","author":"S Joung","year":"2023","unstructured":"Joung, S. (2023). Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees. Computers & Operations Research, 160, 106374.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"1217_CR27","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1080\/01605682.2018.1542959","volume":"71","author":"S Joung","year":"2020","unstructured":"Joung, S., Lim, J., Lee, C., et al. (2020). A linear programming based heuristic algorithm for bandwidth packing problem with scheduling. Journal of the Operational Research Society, 71(2), 250\u2013263.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"1217_CR28","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S1389-1286(03)00189-0","volume":"42","author":"BG J\u00f3zsa","year":"2003","unstructured":"J\u00f3zsa, B. G., & Makai, M. (2003). On the solution of reroute sequence planning problem in MPLS networks. Computer Networks, 42(2), 199\u2013210.","journal-title":"Computer Networks"},{"key":"1217_CR29","doi-asserted-by":"publisher","first-page":"2577","DOI":"10.1007\/s12652-018-0734-2","volume":"10","author":"F Kamoun","year":"2019","unstructured":"Kamoun, F., & Outay, F. (2019). IP\/MPLS networks with hardened pipes: Service concepts, traffic engineering and design considerations. Journal of Ambient Intelligence and Humanized Computing, 10, 2577\u20132584.","journal-title":"Journal of Ambient Intelligence and Humanized Computing"},{"issue":"3","key":"1217_CR30","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/S0377-2217(03)00372-2","volume":"158","author":"J Kang","year":"2004","unstructured":"Kang, J., Park, K., & Park, S. (2004). ATM VP-based network design. European Journal of Operational Research, 158(3), 555\u2013569.","journal-title":"European Journal of Operational Research"},{"key":"1217_CR31","doi-asserted-by":"crossref","unstructured":"Karmarkar, N. (1984). A new polynomial-time algorithm for linear programming. In Proceedings of the Sixteenth Annual ACM Symposium on Theory of computing (pp. 302\u2013311).","DOI":"10.1145\/800057.808695"},{"key":"1217_CR32","doi-asserted-by":"crossref","unstructured":"Kebie, B.T., Bitew, M.A., & Taye, Y.G. (2023). Performance analysis of SDN with a hybrid data plane of MPLS and SDN. In: 2023 International Conference on Information and Communication Technology for Development for Africa (ICT4DA) (pp. 108\u2013113), IEEE.","DOI":"10.1109\/ICT4DA59526.2023.10302237"},{"key":"1217_CR33","unstructured":"Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack Problems, 1st edn. Springer Book Archive, Springer Berlin, Heidelberg, published 15 December 2003 (Hardcover), 07 December 2010 (Softcover), 19 March 2013 (eBook)."},{"issue":"1","key":"1217_CR34","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10479-021-04292-w","volume":"307","author":"S Kim","year":"2021","unstructured":"Kim, S., & Lee, C. (2021). A branch and price approach for the robust bandwidth packing problem with queuing delays. Annals of Operations Research, 307(1), 251\u2013275.","journal-title":"Annals of Operations Research"},{"key":"1217_CR35","volume-title":"Queueing systems, volume 2: Computer applications","author":"L Kleinrock","year":"1976","unstructured":"Kleinrock, L. (1976). Queueing systems, volume 2: Computer applications (Vol. 66). New York: Wiley."},{"issue":"1","key":"1217_CR36","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.ejor.2007.04.016","volume":"188","author":"O Klopfenstein","year":"2008","unstructured":"Klopfenstein, O. (2008). Rerouting tunnels for MPLS network resource optimization. European Journal of Operational Research, 188(1), 293\u2013312.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1217_CR37","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.20488","volume":"59","author":"O Klopfenstein","year":"2012","unstructured":"Klopfenstein, O., & Nace, D. (2012). Cover inequalities for robust knapsack sets-application to the robust bandwidth packing problem. Networks, 59(1), 59\u201372.","journal-title":"Networks"},{"issue":"8","key":"1217_CR38","doi-asserted-by":"publisher","first-page":"2672","DOI":"10.1016\/j.cor.2006.12.029","volume":"35","author":"M Kong","year":"2008","unstructured":"Kong, M., Tian, P., & Kao, Y. (2008). A new ant colony optimization algorithm for the multidimensional knapsack problem. Computers & Operations Research, 35(8), 2672\u20132683.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"1217_CR39","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1287\/mnsc.39.4.492","volume":"39","author":"M Laguna","year":"1993","unstructured":"Laguna, M., & Glover, F. (1993). Bandwidth packing: a tabu search approach. Management Science, 39(4), 492\u2013500.","journal-title":"Management Science"},{"key":"1217_CR40","unstructured":"Lahoud, S., Texier, G., & Toutain, L. (2005). Off-line flow allocation for traffic engineering in MPLS networks. LANMAN Greece."},{"issue":"3","key":"1217_CR41","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1287\/opre.1120.1049","volume":"60","author":"C Lee","year":"2012","unstructured":"Lee, C., Lee, K., Park, K., et al. (2012). Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations. Operations Research, 60(3), 604\u2013610.","journal-title":"Operations Research"},{"key":"1217_CR42","doi-asserted-by":"crossref","unstructured":"Lemeshko, O., Yeremenko, O., & Yevdokymenko, M. (2019). MPLS traffic engineering solution of multipath fast reroute with local and bandwidth protection. International Conference on Computer Science, Engineering and Education Applications (pp. 113\u2013125). Springer.","DOI":"10.1007\/978-3-030-16621-2_11"},{"issue":"3","key":"1217_CR43","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/ijoc.1110.0460","volume":"24","author":"R Mansini","year":"2012","unstructured":"Mansini, R., & Speranza, M. G. (2012). Coral: An exact algorithm for the multidimensional knapsack problem. INFORMS Journal on Computing, 24(3), 399\u2013415.","journal-title":"INFORMS Journal on Computing"},{"issue":"9","key":"1217_CR44","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1287\/mnsc.42.9.1277","volume":"42","author":"K Park","year":"1996","unstructured":"Park, K., Kang, S., & Park, S. (1996). An integer programming approach to the bandwidth packing problem. Management Science, 42(9), 1277\u20131291.","journal-title":"Management Science"},{"issue":"1","key":"1217_CR45","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF02109857","volume":"2","author":"M Parker","year":"1993","unstructured":"Parker, M., & Ryan, J. (1993). A column generation algorithm for bandwidth packing. Telecommunication Systems, 2(1), 185\u2013195.","journal-title":"Telecommunication Systems"},{"issue":"2","key":"1217_CR46","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/ijoc.1090.0344","volume":"22","author":"J Puchinger","year":"2010","unstructured":"Puchinger, J., Raidl, G. R., & Pferschy, U. (2010). The multidimensional knapsack problem: Structure and algorithms. INFORMS Journal on Computing, 22(2), 250\u2013265.","journal-title":"INFORMS Journal on Computing"},{"issue":"8","key":"1217_CR47","doi-asserted-by":"publisher","first-page":"1755","DOI":"10.1109\/JSAC.2019.2927098","volume":"37","author":"K Qiu","year":"2019","unstructured":"Qiu, K., Zhao, J., Wang, X., et al. (2019). Efficient recovery path computation for fast reroute in large-scale software-defined networks. IEEE Journal on Selected Areas in Communications, 37(8), 1755\u20131768.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"2","key":"1217_CR48","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1049\/iet-com.2018.6129","volume":"14","author":"MA Ridwan","year":"2020","unstructured":"Ridwan, M. A., Radzi, N. A. M., Wan Ahmad, W. S. H. M., et al. (2020). Recent trends in MPLS networks: Technologies, applications and challenges. IET Communications, 14(2), 177\u2013185.","journal-title":"IET Communications"},{"key":"1217_CR49","doi-asserted-by":"crossref","unstructured":"Ridwan, M. A., Radzi, N. A. M., Azmi, K. H. M., et al. (2023). A new machine learning-based hybrid intrusion detection system and intelligent routing algorithm for MPLS network. International Journal of Advanced Computer Science and Applications, 14(4).","DOI":"10.14569\/IJACSA.2023.0140412"},{"key":"1217_CR50","doi-asserted-by":"crossref","unstructured":"Risso, C., Mayr, C., & Gramp\u00edn, E. (2019). A combined bgp and ip\/mpls resilient transit backbone design. In 2019 11th international workshop on resilient networks design and modeling (RNDM) (pp. 1\u20138), IEEE.","DOI":"10.1109\/RNDM48015.2019.8949099"},{"key":"1217_CR51","doi-asserted-by":"crossref","unstructured":"Rosen, E., Viswanathan, A., & Callon, R. (2000). Multiprotocol label switching architecture. RFC3031.","DOI":"10.17487\/rfc3031"},{"key":"1217_CR52","doi-asserted-by":"crossref","unstructured":"Sharma, V., & Hellstrand, F. (2003). Framework for multi-protocol label switching (MPLS)-based recovery. RFC3469.","DOI":"10.17487\/rfc3469"},{"issue":"4","key":"1217_CR53","doi-asserted-by":"publisher","first-page":"2157","DOI":"10.1109\/COMST.2015.2460222","volume":"17","author":"SK Singh","year":"2015","unstructured":"Singh, S. K., Das, T., & Jukan, A. (2015). A survey on internet multipath routing and provisioning. IEEE Communications Surveys & Tutorials, 17(4), 2157\u20132175.","journal-title":"IEEE Communications Surveys & Tutorials"},{"key":"1217_CR54","doi-asserted-by":"crossref","unstructured":"Srivastava, S., & Singh, J.P. (2021). Efficiency of multi-protocol label switching over traditional switching. In 2021 5th international conference on information systems and computer networks (ISCON) (pp. 1\u20134), IEEE.","DOI":"10.1109\/ISCON52037.2021.9702352"},{"key":"1217_CR55","doi-asserted-by":"crossref","unstructured":"Van\u00a0Do, T., Papp, D., Chakka, R., et\u00a0al. (2022). A Performance model of MPLS multipath routing with failures and repairs of the LSPs. In Performance modelling and analysis of heterogeneous networks (pp. 27\u201343). River Publishers.","DOI":"10.1201\/9781003339052-3"},{"key":"1217_CR56","doi-asserted-by":"crossref","unstructured":"Vashishth, V., Chhabra, A., & Sharma, D. K. (2019). Gmmr: A gaussian mixture model based unsupervised machine learning approach for optimal routing in opportunistic iot networks. Computer Communications, 134, 138\u2013148.","DOI":"10.1016\/j.comcom.2018.12.001"},{"issue":"4","key":"1217_CR57","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/s10898-015-0399-8","volume":"65","author":"N Vidyarthi","year":"2016","unstructured":"Vidyarthi, N., Jayaswal, S., & Chetty, V. B. T. (2016). Bandwidth packing problem with queueing delays: Modelling and exact solution approach. Journal of Global Optimization, 65(4), 745\u2013776.","journal-title":"Journal of Global Optimization"},{"key":"1217_CR58","doi-asserted-by":"crossref","unstructured":"Walkowiak, K. (2006). A new function for optimization of working paths in survivable MPLS networks. In International symposium on computer and information sciences (pp 424\u2013433), Springer.","DOI":"10.1007\/11902140_46"},{"issue":"2","key":"1217_CR59","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/B:COAP.0000008650.91314.59","volume":"27","author":"KM Walkowiak","year":"2004","unstructured":"Walkowiak, K. M. (2004). A branch and bound algorithm for primary routes assignment in survivable connection oriented networks. Computational Optimization and Applications, 27(2), 149\u2013171.","journal-title":"Computational Optimization and Applications"},{"issue":"11","key":"1217_CR60","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1109\/MCOM.2002.1046998","volume":"40","author":"J Wang","year":"2002","unstructured":"Wang, J., Sahasrabuddhe, L., & Mukherjee, B. (2002). Path vs. subpath vs. link restoration for fault management in IP-over-WDM networks: Performance comparisons using GMPLS control signaling. IEEE Communications Magazine, 40(11), 80\u201387.","journal-title":"IEEE Communications Magazine"},{"issue":"8","key":"1217_CR61","doi-asserted-by":"publisher","first-page":"7987","DOI":"10.1109\/TVT.2019.2921792","volume":"68","author":"H Yao","year":"2019","unstructured":"Yao, H., Yuan, X., Zhang, P., et al. (2019). Machine learning aided load balance routing scheme considering queue utilization. IEEE Transactions on Vehicular Technology, 68(8), 7987\u20137999.","journal-title":"IEEE Transactions on Vehicular Technology"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-024-01217-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11235-024-01217-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-024-01217-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T05:09:24Z","timestamp":1733548164000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11235-024-01217-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,10]]},"references-count":61,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1217"],"URL":"https:\/\/doi.org\/10.1007\/s11235-024-01217-3","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[2024,10,10]]},"assertion":[{"value":"3 September 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}