{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T09:52:11Z","timestamp":1753869131269,"version":"3.41.2"},"reference-count":29,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T00:00:00Z","timestamp":1633824000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Trans Emerging Tel Tech"],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Efficient path selection and content availability in the optical datacenter networks are essential for business continuity. To measure quantitatively the connectivity of content and give protection to diverse type of contents, the idea of<jats:italic>k<\/jats:italic>\u2010node content connectivity is becoming popular. However, the assignment of dedicated spectrum for each end\u2010to\u2010end content path consumes too many resources. In order to enhance the resource efficiency, the spectrum can be shared between end\u2010to\u2010content paths of various requests. The spectrum sharing minimizes the backup spectrum requirement and has been a topic of research. In this study, an innovative model, namely, end\u2010to\u2010end content connectivity based quasi\u2010bipartite graphs (E\u2010QBG) for the possible path prediction and maximum matching by Hungarian path prediction (MM\u2010HPP) are implemented for the spectrum efficiency and the disaster resilient datacenter networks. The objective is to minimize the entire backup spectrum resource and operations path. The quasi\u2010bipartite graph is used for the end\u2010to\u2010end content backup route evaluation including spectrum sharing on various links, while the Hungarian algorithm is utilized for accurate maximum matching prediction between various end\u2010to\u2010end route sets. We introduce the concept of maximum dissortativity path based on the weight factor. The proposed E\u2010QBG and MM\u2010HPP reduces spectrum consumption which guarantees survivability against multi\u2010failure and natural disasters. This method leads to an approach for more effective utilization of the resources for end\u2010to\u2010end content connected elastic optical datacenter networks as compared with the existing techniques.<\/jats:p>","DOI":"10.1002\/ett.4378","type":"journal-article","created":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T05:21:00Z","timestamp":1633929660000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Preservation of shared backup path in<i>k<\/i>\u2010node content based elastic optical datacenter networks"],"prefix":"10.1002","volume":"33","author":[{"given":"Rajat","family":"Gupta","sequence":"first","affiliation":[{"name":"Department of Electrical, Electronics and Communication Engineering North Cap University Gurgaon India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3295-9764","authenticated-orcid":false,"given":"Mona","family":"Aggarwal","sequence":"additional","affiliation":[{"name":"Department of Electrical, Electronics and Communication Engineering North Cap University Gurgaon India"}]},{"given":"Swaran","family":"Ahuja","sequence":"additional","affiliation":[{"name":"Department of Electrical, Electronics and Communication Engineering North Cap University Gurgaon India"}]}],"member":"311","published-online":{"date-parts":[[2021,10,10]]},"reference":[{"key":"e_1_2_8_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2012.2201696"},{"key":"e_1_2_8_3_1","doi-asserted-by":"crossref","unstructured":"XuR ChenB DaiM LinX WangH.Disaster survivability in elastic optical datacenter networks. Proceedings of the IEEE Optoelectronics Global Conference (OGC); 2016:1\u20103; Shenzhen.","DOI":"10.1109\/OGC.2016.7590489"},{"key":"e_1_2_8_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijleo.2017.03.023"},{"key":"e_1_2_8_5_1","unstructured":"WalkowiakK KlinkowskiM.Shared backup path protection in elastic optical networks: modeling and optimization. Proceedings of the 9th International Conference on the Design of Reliable Communication Networks; 2013:187\u2010194; DRCN Budapest."},{"key":"e_1_2_8_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-019-02961-z"},{"key":"e_1_2_8_7_1","doi-asserted-by":"crossref","unstructured":"HmaityA MusumeciF TornatoreM.Survivable virtual network mapping to provide content connectivity against double\u2010link failures. Proceedings of the 12th International Conference on the Design of Reliable Communication Networks (DRCN); 2016:160\u2010166; Paris.","DOI":"10.1109\/DRCN.2016.7470851"},{"key":"e_1_2_8_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/ett.3268"},{"key":"e_1_2_8_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2517646"},{"issue":"5","key":"e_1_2_8_10_1","first-page":"1431","article-title":"Changing correlations in networks: assortativity and dissortativity","volume":"36","author":"Xulvi\u2010Brunet R","year":"2005","journal-title":"Acta Phys Polonica B"},{"issue":"1","key":"e_1_2_8_11_1","doi-asserted-by":"crossref","first-page":"e4097","DOI":"10.1002\/ett.4097","article-title":"A metaheuristic approach for source traffic grooming in elastic optical networks","volume":"32","author":"Suzana M","year":"2021","journal-title":"Trans Emerg Telecommun Technol"},{"key":"e_1_2_8_12_1","doi-asserted-by":"crossref","unstructured":"NaasN MouftahH.On determining the cost\u2010effective optical transport network architecture for next generation data center interconnectivity. Proceedings of the IEEE Canadian Conference on Electrical and Computer Engineering (CCECE); 2016:1\u20106; Vancouver BC.","DOI":"10.1109\/CCECE.2016.7726714"},{"key":"e_1_2_8_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-374879-9.00007-1"},{"key":"e_1_2_8_14_1","doi-asserted-by":"publisher","DOI":"10.1590\/2179-10742017v16i2857"},{"key":"e_1_2_8_15_1","doi-asserted-by":"publisher","DOI":"10.1515\/joc-2019-0090"},{"key":"e_1_2_8_16_1","doi-asserted-by":"publisher","DOI":"10.1364\/JOCN.7.000681"},{"key":"e_1_2_8_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11107-015-0518-y"},{"key":"e_1_2_8_18_1","doi-asserted-by":"crossref","unstructured":"XinL YangW GengZ XiG YongliZ JieZ.K\u2010content connectivity in data center networks. Proceedings of the Opto\u2010Electronics and Communications Conference (OECC); 2015:1\u20103; Shanghai.","DOI":"10.1109\/OECC.2015.7340315"},{"key":"e_1_2_8_19_1","doi-asserted-by":"publisher","DOI":"10.1364\/OE.24.009446"},{"key":"e_1_2_8_20_1","doi-asserted-by":"publisher","DOI":"10.1364\/JOCN.9.000053"},{"key":"e_1_2_8_21_1","doi-asserted-by":"publisher","DOI":"10.1515\/joc-2020-0180"},{"key":"e_1_2_8_22_1","doi-asserted-by":"crossref","unstructured":"HorotaAK.Deferred protection of deadline\u2010driven requests in inter\u2010datacenter elastic optical networks. Proceedings of the 2020 International Conference on Optical Network Design and Modeling (ONDM); 2020:1\u20106.https:\/\/doi.org\/10.23919\/ONDM48393.2020.9133035","DOI":"10.23919\/ONDM48393.2020.9133035"},{"key":"e_1_2_8_23_1","doi-asserted-by":"crossref","unstructured":"KongJ.Availability\u2010guaranteed virtual optical network mapping with selective path protection. Proceedings of the Optical Fiber Communications Conference and Exhibition (OFC); 2016:1\u20103 Anaheim CA.","DOI":"10.1364\/OFC.2016.W1B.4"},{"key":"e_1_2_8_24_1","doi-asserted-by":"crossref","unstructured":"KhandakerFA.Survivable virtual optical network mapping in spectrum and modulation format convertible flexible grid optical networks. Proceedings of the Optical Fiber Communications Conference and Exhibition (OFC); 2015:1\u20103; Los Angeles CA.","DOI":"10.1364\/OFC.2015.Th3J.1"},{"key":"e_1_2_8_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2852814"},{"key":"e_1_2_8_26_1","unstructured":"RajagopalanS VaziraniVV.On the bidirected cut relaxation for the metric Steiner problem Proceedings of the 10th Annual ACM\u2010SIAM Symposium on Discrete Algorithms; 1999:742\u2010751."},{"key":"e_1_2_8_27_1","unstructured":"RobinsG ZelikovskyA.Improved Steiner tree approximation in graphs. Proceedings of the 11th Annual ACM\u2010SIAM Symposium on Discrete Algorithms; 2000:770\u2010779; ACM New York NY."},{"key":"e_1_2_8_28_1","doi-asserted-by":"crossref","unstructured":"FennerS GurjarR ThieraufT.Bipartite perfect matching is in quasi\u2010NC. Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC '16).; 2016:754\u2010763; Association for Computing Machinery New York NY.","DOI":"10.1145\/2897518.2897564"},{"key":"e_1_2_8_29_1","unstructured":"MednykhAD.On the Riemann\u2010Hurwitz formula for graph coverings; 2015. preprint arXiv:1505.00321v1 [math.AT]."},{"key":"e_1_2_8_30_1","doi-asserted-by":"crossref","unstructured":"CaoB WangJ FanJ DongT YinJ.Mapping elements with the Hungarian algorithm: an efficient method for querying business process models. Proceedings of the IEEE International Conference on Web Services; 2015:129\u2010136; New York.","DOI":"10.1109\/ICWS.2015.27"}],"container-title":["Transactions on Emerging Telecommunications Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.4378","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/ett.4378","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.4378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:41:28Z","timestamp":1725907288000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/ett.4378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,10]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["10.1002\/ett.4378"],"URL":"https:\/\/doi.org\/10.1002\/ett.4378","archive":["Portico"],"relation":{},"ISSN":["2161-3915","2161-3915"],"issn-type":[{"type":"print","value":"2161-3915"},{"type":"electronic","value":"2161-3915"}],"subject":[],"published":{"date-parts":[[2021,10,10]]},"assertion":[{"value":"2021-02-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-09-13","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-10-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e4378"}}