{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T18:25:24Z","timestamp":1783103124147,"version":"3.54.6"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"9-10","license":[{"start":{"date-parts":[[2021,12,24]],"date-time":"2021-12-24T00:00:00Z","timestamp":1640304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,12,24]],"date-time":"2021-12-24T00:00:00Z","timestamp":1640304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012550","name":"Nemzeti Kutat\u00e1si, Fejleszt\u00e9si \u00e9s Innovaci\u00f3s Alap","doi-asserted-by":"publisher","award":["FK20"],"award-info":[{"award-number":["FK20"]}],"id":[{"id":"10.13039\/501100012550","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009567","name":"Budapest University of Technology and Economics","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100009567","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann. Telecommun."],"published-print":{"date-parts":[[2022,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Data center networks (DCNs) act as critical infrastructures for emerging technologies. In general, a DCN involves a multi-rooted tree with various shortest paths of equal length from end to end. The DCN fabric must be maintained and monitored to guarantee high availability and better QoS. Traditional traffic engineering (TE) methods frequently reroute large flows based on the shortest and least-congested paths to maintain high service availability. This procedure results in a weak link utilization with frequent packet reordering. Moreover, DCN link failures are typical problems. State-of-the-art approaches address such challenges by modifying the network components (switches or hosts) to discover and avoid broken connections. This study proposes Oddlab (Odds labels), a novel deployable TE method to guarantee the QoS of multi-rooted data center (DC) traffic in symmetric and asymmetric modes. Oddlab creatively builds a heuristic model for efficient flow scheduling and faulty link detection by exclusively using the gathered statistics from the DCN data plane, such as residual bandwidth and the number of installed elephant flows. Besides, the proposed method is implemented in an SDN-based DCN without altering the network components. Our findings indicate that Oddlab can minimize the flow completion time, maximize bisection bandwidth, improve network utilization, and recognize faulty links with sufficient accuracy to improve DC productivity.<\/jats:p>","DOI":"10.1007\/s12243-021-00898-0","type":"journal-article","created":{"date-parts":[[2021,12,24]],"date-time":"2021-12-24T02:02:33Z","timestamp":1640311353000},"page":"641-662","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Oddlab: fault-tolerant aware load-balancing framework for data center networks"],"prefix":"10.1007","volume":"77","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7581-1682","authenticated-orcid":false,"given":"Aymen Hasan","family":"Alawadi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S\u00e1ndor","family":"Moln\u00e1r","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,12,24]]},"reference":[{"key":"898_CR1","doi-asserted-by":"publisher","unstructured":"Hopps C (2000) Analysis of an equal-cost multipath algorithm (No. RFC 2992). https:\/\/doi.org\/10.17487\/RFC2992","DOI":"10.17487\/RFC2992"},{"key":"898_CR2","doi-asserted-by":"publisher","unstructured":"Al-Fares M, Radhakrishnan S, Raghavan B, Huang N, Vahdat A (2010) Hedera: Dynamic Flow scheduling for datacenter networks. In: Nsdi (vol 10, No 2010. https:\/\/doi.org\/10.5555\/1855711.1855730","DOI":"10.5555\/1855711.1855730"},{"key":"898_CR3","doi-asserted-by":"publisher","unstructured":"Gill P, Jain N, Nagappan N (2011) Understanding network failures in data centers: Measurement, analysis, and implications. In: Proceedings of the ACM SIGCOMM 2011 Conference, pp 350\u2013361. https:\/\/doi.org\/10.1145\/2018436.2018477","DOI":"10.1145\/2018436.2018477"},{"issue":"2","key":"898_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/1355734.1355746","volume":"38","author":"N McKeown","year":"2008","unstructured":"McKeown N, Anderson T, Balakrishnan H, Parulkar G, Peterson L, Rexford J, Shenker S, Turner J (2008) OpenFlow: Enabling innovation in campus networks. ACM SIGCOMM Computer Communication Review 38(2):69\u201374. https:\/\/doi.org\/10.1145\/1355734.1355746","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"898_CR5","doi-asserted-by":"publisher","unstructured":"Curtis AR, Kim W, Yalagandula P (2011) Mahout: Low-overhead datacenter traffic management using end-host-based elephant detection. In: Infocom, vol 11, pp 1629\u20131637, DOI https:\/\/doi.org\/10.1109\/INFCOM.2011.5934956","DOI":"10.1109\/INFCOM.2011.5934956"},{"key":"898_CR6","doi-asserted-by":"publisher","first-page":"4537","DOI":"10.1109\/ACCESS.2017.2684188","volume":"5","author":"CA Wang","year":"2017","unstructured":"Wang CA, Hu B, Chen S, Li D, Liu B (2017) A switch migration-based decision-making scheme for balancing load in SDN. IEEE Access 5:4537\u20134544. https:\/\/doi.org\/10.1109\/ACCESS.2017.2684188","journal-title":"IEEE Access"},{"key":"898_CR7","doi-asserted-by":"publisher","unstructured":"Erickson D (2013) The Beacon OpenFlow controller. In: Proceedings of the second ACM SIGCOMM workshop on hot topics in software defined networking, pp 13\u201318. https:\/\/doi.org\/10.1145\/2491185.2491189","DOI":"10.1145\/2491185.2491189"},{"issue":"3","key":"898_CR8","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1109\/TPDS.2020.3030630","volume":"32","author":"G Zhao","year":"2020","unstructured":"Zhao G, Xu H, Fan J, Huang L, Qiao C (2020) Achieving fine-grained flow management through hybrid rule placement in SDNs. IEEE Transactions on Parallel and Distributed Systems 32(3):728\u2013742. https:\/\/doi.org\/10.1109\/TPDS.2020.3030630","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"898_CR9","doi-asserted-by":"publisher","unstructured":"Benson T, Akella A, Maltz DA (2010) Network traffic characteristics of data centers in the wild. In: Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement, pp 267\u2013280. https:\/\/doi.org\/10.1145\/1879141.1879175","DOI":"10.1145\/1879141.1879175"},{"key":"898_CR10","doi-asserted-by":"publisher","unstructured":"Tang F., Zhang H., Yang LT, Chen L (2019) Elephant flow detection and differentiated scheduling with efficient sampling and classification. IEEE Transactions on Cloud Computing. https:\/\/doi.org\/10.1109\/TCC.2019.2901669","DOI":"10.1109\/TCC.2019.2901669"},{"key":"898_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comcom.2018.05.010","volume":"127","author":"SM Irteza","year":"2018","unstructured":"Irteza SM, Bashir HM, Anwar T, Qazi IA, Dogar FR (2018) Efficient load balancing over asymmetric datacenter topologies. Comput Commun 127:1\u201312. https:\/\/doi.org\/10.1016\/j.comcom.2018.05.010","journal-title":"Comput Commun"},{"key":"898_CR12","doi-asserted-by":"publisher","unstructured":"Roy A, Zeng H, Bagga J, Porter G, Snoeren AC (2015) Inside the social network (datacenter) network. In: Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication. pp 123\u2013137. https:\/\/doi.org\/10.1145\/2785956","DOI":"10.1145\/2785956"},{"key":"898_CR13","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.comcom.2021.02.013","volume":"171","author":"M Zaher","year":"2021","unstructured":"Zaher M, Alawadi AH, Moln\u00e1r S (2021) Sieve: Flow scheduling framework in SDN-based data center networks. Comput Commun 171:99\u2013111. https:\/\/doi.org\/10.1016\/j.comcom.2021.02.013","journal-title":"Comput Commun"},{"key":"898_CR14","doi-asserted-by":"publisher","unstructured":"Zaher M, Alawadi AH, Moln\u00e1r S (2020) Class-based flow-scheduling framework in SDN-based data center networks. In: 2020 International Conference on Computing, Electronics & Communications Engineering (iCCECE), IEEE, pp 51\u201356. https:\/\/doi.org\/10.1109\/iCCECE49321.2020.9231052","DOI":"10.1109\/iCCECE49321.2020.9231052"},{"key":"898_CR15","unstructured":"Machi H (2017) Research on data center network traffic scheduling strategy based on SDN, Chongqing university of posts and telecommunications, Chongqing, China. https:\/\/wap.cnki.net\/touch\/web\/Dissertation\/Article\/10617-1018972647.nh.html"},{"key":"898_CR16","doi-asserted-by":"crossref","unstructured":"Al-Fares M, Loukissas A, Vahdat A (2008) A scalable, commodity data center network architecture, vol 38","DOI":"10.1145\/1402946.1402967"},{"key":"898_CR17","doi-asserted-by":"publisher","unstructured":"Onogi F, Kasuga H, Shinomiya N (2020) On approximate approaches the unsplittable flow edge load factor balancing problem. In: 2020 35th International Technical Conference on Circuits\/Systems, Computers and Communications (ITC-CSCC), IEEE, pp 73\u201377. https:\/\/doi.org\/10.5555\/795663.796365","DOI":"10.5555\/795663.796365"},{"key":"898_CR18","doi-asserted-by":"publisher","unstructured":"Curtis AR, Mogul JC, Tourrilhes J, Yalagandula P, Sharma P, Banerjee S (2011) DevoFlow: Scaling flow management for high-performance networks. In: ACM SIGCOMM Computer Communication Review, Vol 41, No 4, ACM, pp 254\u2013265. https:\/\/doi.org\/10.1145\/2018436.2018466","DOI":"10.1145\/2018436.2018466"},{"key":"898_CR19","doi-asserted-by":"publisher","unstructured":"Liu L, Jiang Y, Shen G, Li Q, Lin D, Li L, Wang Y (2019) SDN-based hybrid strategy for load balancing in data center networks. In: 2019 IEEE Symposium on Computers and Communications (ISCC), IEEE, pp 1\u20136. https:\/\/doi.org\/10.1109\/ISCC47284.2019.8969673","DOI":"10.1109\/ISCC47284.2019.8969673"},{"key":"898_CR20","doi-asserted-by":"publisher","unstructured":"Alizadeh M, Edsall T, Dharmapurikar S, Vaidyanathan R, Chu K, Fingerhut A, Varghese G (2014) CONGA: Distributed congestion-aware load balancing for datacenters. In: Proceedings of the 2014 ACM Conference on SIGCOMM, pp 503\u2013514. https:\/\/doi.org\/10.1145\/2740070.2626316","DOI":"10.1145\/2740070.2626316"},{"issue":"4","key":"898_CR21","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s11235-020-00720-7","volume":"76","author":"C Levi","year":"2021","unstructured":"Levi C, Segal M (2021) Avoiding bottlenecks in networks by short paths. In Telecommun Syst 76(4):491\u2013503. 10.1007\/s11235-020-00720-7","journal-title":"In Telecommun Syst"},{"key":"898_CR22","doi-asserted-by":"publisher","unstructured":"Zhang H, Zhang J, Bai W, Chen K, Chowdhury M (2017) Resilient datacenter load balancing in the wild. In: Proceedings of the Conference of the ACM Special Interest Group on Data Communication, pp 253\u2013266. https:\/\/doi.org\/10.1145\/3098822.3098841","DOI":"10.1145\/3098822.3098841"},{"issue":"6","key":"898_CR23","doi-asserted-by":"publisher","first-page":"2338","DOI":"10.1109\/TNET.2019.2945863","volume":"27","author":"J Hu","year":"2019","unstructured":"Hu J, Huang J, Lv W, Zhou Y, Wang J, He T (2019) CAPS: Coding-based adaptive packet spraying to reduce flow completion time in data center. IEEE\/ACM Trans Netw 27(6):2338\u20132353. https:\/\/doi.org\/10.1109\/TNET.2019.2945863","journal-title":"IEEE\/ACM Trans Netw"},{"key":"898_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comcom.2018.05.010","volume":"127","author":"SM Irteza","year":"2018","unstructured":"Irteza SM, Bashir HM, Anwar T, Qazi IA, Dogar FR (2018) Efficient load balancing over asymmetric datacenter topologies. Comput Commun 127:1\u201312. https:\/\/doi.org\/10.1016\/j.comcom.2018.05.010","journal-title":"Comput Commun"},{"key":"898_CR25","doi-asserted-by":"crossref","unstructured":"Ghorbani S, Yang Z, Godfrey P, Ganjali Y, Firoozshahian A (2017) DRILL: Micro load balancing for low-latency data center networks. In: Proceedings of the Conference of the ACM Special Interest Group on Data Communication, ACM, pp 225\u2013238","DOI":"10.1145\/3098822.3098839"},{"key":"898_CR26","doi-asserted-by":"publisher","first-page":"107235","DOI":"10.1016\/j.comnet.2020.107235","volume":"175","author":"K Sharma","year":"2020","unstructured":"Sharma K, Yadav RN (2020) An adaptive, fault tolerant, flow-level routing scheme for data center networks. Computer Networks 175:107235. https:\/\/doi.org\/10.1016\/j.comnet.2020.107235","journal-title":"Computer Networks"},{"issue":"10","key":"898_CR27","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1109\/71.963420","volume":"12","author":"M Mitzenmacher","year":"2001","unstructured":"Mitzenmacher M (2001) The power of two choices in randomized load balancing. IEEE Transactions on Parallel and Distributed Systems 12(10):1094\u20131104. https:\/\/doi.org\/10.1109\/71.963420","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"2","key":"898_CR28","doi-asserted-by":"publisher","first-page":"54","DOI":"10.3390\/fi13020054","volume":"13","author":"Y Liu","year":"2021","unstructured":"Liu Y, Zhang J, Li W, Wu Q, Li P (2021) Load balancing-oriented predictive routing algorithm for data center networks. Future Internet 13(2):54. https:\/\/doi.org\/10.3390\/fi13020054","journal-title":"Future Internet"},{"key":"898_CR29","doi-asserted-by":"publisher","unstructured":"Al Awadi AHR (2017) Dual-layer SDN model for deploying and securing network forensic in distributed data center. Current Journal of Applied Science and Technology, pp 1\u201311. https:\/\/doi.org\/10.9734\/CJAST\/2017\/34752","DOI":"10.9734\/CJAST\/2017\/34752"},{"key":"898_CR30","unstructured":"Ryu: Ryu SDN Framework. https:\/\/ryu-sdn.org (Accessed 22 Mar. 2021)"},{"key":"898_CR31","unstructured":"Mininet: A realistic virtual network. http:\/\/mininet.org (Accessed 22 Mar. 2021)"},{"issue":"4","key":"898_CR32","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1402946.1402967","volume":"38","author":"M Al-Fares","year":"2008","unstructured":"Al-Fares M, Loukissas A, Vahdat A (2008) A scalable, commodity data center network architecture. ACM SIGCOMM Comput Commun Rev 38(4):63\u201374. https:\/\/doi.org\/10.1145\/1402946.1402967","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"898_CR33","unstructured":"iPerf - The ultimate speed test tool for TCP, UDP, and SCTP. https:\/\/iperf.fr (Accessed 4 Apr. 2021)"},{"key":"898_CR34","unstructured":"BWM-ng - Bandwidth Monitor NG (Next Generation). https:\/\/www.gnutoolbox.com\/bwmng (Accessed 4 Apr. 2021)"},{"key":"898_CR35","doi-asserted-by":"publisher","unstructured":"Alizadeh M, Greenberg A, Maltz DA, Padhye J, Patel P, Prabhakar B, Sengupta S, Sridharan M (2010) Data center tcp (dctcp). In: Proceedings of the ACM SIGCOMM 2010 Conference, pp 63\u201374. https:\/\/doi.org\/10.1145\/1851275.1851192","DOI":"10.1145\/1851275.1851192"},{"key":"898_CR36","doi-asserted-by":"publisher","unstructured":"Niranjan Mysore R, Pamboris A, Farrington N, Huang N, Miri P, Radhakrishnan S, Subramanya V, Vahdat A (2009) Portland: a scalable fault-tolerant layer 2 data center network fabric. In: Proceedings of the ACM SIGCOMM 2009 conference on Data communication, pp 39\u201350. https:\/\/doi.org\/10.1145\/1594977.1592575","DOI":"10.1145\/1594977.1592575"}],"container-title":["Annals of Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-021-00898-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12243-021-00898-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-021-00898-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T07:45:43Z","timestamp":1664005543000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12243-021-00898-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,24]]},"references-count":36,"journal-issue":{"issue":"9-10","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["898"],"URL":"https:\/\/doi.org\/10.1007\/s12243-021-00898-0","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"value":"0003-4347","type":"print"},{"value":"1958-9395","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,24]]},"assertion":[{"value":"5 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}