{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,18]],"date-time":"2023-11-18T14:20:33Z","timestamp":1700317233681},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T00:00:00Z","timestamp":1612742400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T00:00:00Z","timestamp":1612742400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"the Joint Project of the National Nature Science Foundation of China","award":["Grant No. U1636109"],"award-info":[{"award-number":["Grant No. U1636109"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cloud Comp"],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Today\u2019s datacenter networks (DCNs) scale is rapidly increasing because of the wide deployment of cloud services and the rapid rise of edge computing. The bandwidth consumption and cost of a DCN are growing sharply with the extensions of network size. Thus, how to keep the traffic balanced is a key and challenging issue. However, the traditional load balancing algorithms such as Equal-Cost Multi-Path routing (ECMP) are not suitable for high dynamic traffic in cloud DCNs. In this paper, we propose a port-based forwarding load balancing scheduling (PFLBS) approach for Fat-tree based DCNs with some new features which can overcome the disadvantages of the existing load balancing methods in the following aspects. Firstly, we define a port-based source-routing addressing scheme, which decreases the switch complexity and makes the table-lookup operation unnecessary. Secondly, based on this addressing scheme, we proposed an effective routing mechanism which can obtain multiple available paths for flow scheduling based in Fat-tree. All the path information is saved in servers and each server only needs to maintain its own path information. Thirdly, we propose an efficient algorithm to implement large flows scheduling dynamically in terms of current link utilization ratio. This method is suitable for cloud DCNs and edge computing, which can reduce the complexity of the switches and the power consumption of the whole network. The experiment results indicate that the PFLBS approach has better performance compared with the ECMP, Hedera and MPTCP approaches, which decreases the flow completion time and improves the average throughput significantly. PFLBS is simple and can be implemented with a few signaling overheads.<\/jats:p>","DOI":"10.1186\/s13677-021-00226-w","type":"journal-article","created":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T22:48:23Z","timestamp":1612824503000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A port-based forwarding load-balancing scheduling approach for cloud datacenter networks"],"prefix":"10.1186","volume":"10","author":[{"given":"Zhiyu","family":"Liu","sequence":"first","affiliation":[]},{"given":"Aqun","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Mangui","family":"Liang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,8]]},"reference":[{"key":"226_CR1","doi-asserted-by":"publisher","unstructured":"Cao Z, Kodialam M, Lakshman TV (2016) Joint Static and Dynamic Traffic Scheduling in Data Center Networks In: IEEE\/ACM Transactions on Networking, vol. 24, no. 3, 1908\u20131918. https:\/\/doi.org\/10.1109\/TNET.2015.2434879.","DOI":"10.1109\/TNET.2015.2434879"},{"issue":"1","key":"226_CR2","doi-asserted-by":"publisher","first-page":"36","DOI":"10.3991\/ijim.v12i1.7573","volume":"12","author":"AN Quttoum","year":"2018","unstructured":"Quttoum AN (2018) Interconnection Structures, Management and Routing Challenges in Cloud-Service Data Center Networks: A Survey. Int J Interact Mob Technol 12(1):36\u201360.","journal-title":"Int J Interact Mob Technol"},{"key":"226_CR3","doi-asserted-by":"crossref","unstructured":"Imran M, Haleem S (2018) Optical Interconnects for Cloud Computing Data Centers: Recent Advances and Future Challenges In: International Symposium on Grids and Clouds (hold at Academia Sinica in Taipei, Taiwan from 16-23 March 2018).","DOI":"10.22323\/1.327.0017"},{"key":"226_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.jss.2018.11.007","volume":"148","author":"TZ Emara","year":"2019","unstructured":"Emara TZ, Huang J (2019) A distributed data management system to support large-scale data analysis. J Syst Softw 148:105\u2013115.","journal-title":"J Syst Softw"},{"key":"226_CR5","unstructured":"Bonawitz K, Eichner H, Grieskamp W, Huba D, Ingerman A, vanov V, Kiddon C, Konecny J, Mazzocchi S, McMahan H, Van Overveldt T (2019) Towards Federated Learning at Scale: System Design. arXiv preprint arXiv:01046."},{"key":"226_CR6","doi-asserted-by":"publisher","first-page":"2019","DOI":"10.1186\/s13638-019-1557-3","volume":"249","author":"X Ma","year":"2019","unstructured":"Ma X, Gao H, Xu H, Bian M (2019) An IoT-based task scheduling optimization scheme considering the deadline and cost-aware scientific workflow for cloud computing. EURASIP J Wirel Commun Netw 249:2019. https:\/\/doi.org\/10.1186\/s13638-019-1557-3.","journal-title":"EURASIP J Wirel Commun Netw"},{"key":"226_CR7","doi-asserted-by":"publisher","first-page":"2019","DOI":"10.1186\/s13638-019-1605-z","volume":"247","author":"Y Zhu","year":"2019","unstructured":"Zhu Y, Zhang W, Chen Y, Gao H (2019) A novel approach to workload prediction using attention-based LSTM encoder-decoder network in cloud environment. EURASIP J Wirel Commun Netw 247:2019. https:\/\/doi.org\/10.1186\/s13638-019-1605-z.","journal-title":"EURASIP J Wirel Commun Netw"},{"issue":"2","key":"226_CR8","first-page":"1","volume":"14","author":"H Gao","year":"2018","unstructured":"Gao H, Zhang K, Yang J, Wu F, Liu H (2018) Applying improved particle swarm optimization for dynamic service composition focusing on quality of service evaluations under hybrid networks. Int J Distrib Sens Netw(IJDSN) 14(2):1\u201314.","journal-title":"Int J Distrib Sens Netw(IJDSN)"},{"key":"226_CR9","doi-asserted-by":"publisher","unstructured":"Deng S, Xiang Z, Zhao P, Taheri J, Gao H, Yin J, Zomaya A (2020) Dynamical resource allocation in edge for trustable iot systems: a reinforcement learning method. IEEE Trans Ind Inform:974875. https:\/\/doi.org\/10.1109\/TII.2020.2X00000.","DOI":"10.1109\/TII.2020.2X00000"},{"key":"226_CR10","doi-asserted-by":"publisher","unstructured":"Kuang L, Gong T, OuYang S, Gao H, Deng S (2020) Offloading Decision Methods for Multiple Users with Structured Tasks in Edge Computing for Smart Cities. Futur Gener Comput Syst (FGCS). https:\/\/doi.org\/10.1016\/j.future.2019.12.039.","DOI":"10.1016\/j.future.2019.12.039"},{"key":"226_CR11","doi-asserted-by":"crossref","unstructured":"Sen S, Shue D, Ihm S, Freedman MJ (2013) Scalable, Optimal Flow Routing in Datacenters via Local Link Balancing In: Proc ACM CoNEXT, 151\u2013162.","DOI":"10.1145\/2535372.2535397"},{"key":"226_CR12","doi-asserted-by":"crossref","unstructured":"Hopps C (2000) Analysis of an Equal-Cost Multi-Path Algorithm. RFC2992, Internet Engineering Task Force.","DOI":"10.17487\/rfc2992"},{"key":"226_CR13","unstructured":"Al-Fares M, Radhakrishnan S, Raghavan B, Huang N, Vahdat A (2010) Hedera: Dynamic How scheduling for data center networks. Symposium on Networked Systems Design and Implementation (hold at San Jose, U.S.A). USENIX."},{"key":"226_CR14","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: 2011 Proceedings IEEE INFOCOM, 1629\u20131637, Shanghai. https:\/\/doi.org\/10.1109\/INFCOM.2011.5934956.","DOI":"10.1109\/INFCOM.2011.5934956"},{"key":"226_CR15","doi-asserted-by":"publisher","unstructured":"Perry J, Ousterhout A, Balakrishnan H, Shah D, Fugal H (2014) Fastpass: A Centralized Zero-queue Datacenter Network, SIGCOMM \u201914 held in Chicago, Illinois In: Proceedings of the 2014 ACM conference on SIGCOMM, 307\u2013318. https:\/\/doi.org\/10.1145\/2619239.2626309.","DOI":"10.1145\/2619239.2626309"},{"key":"226_CR16","doi-asserted-by":"crossref","unstructured":"Kandula S, Katabi D, Sinha S, Berger A (2007) Dynamic load balancing without packet reordering. SIGCOMM Comp Comm Rev:37.","DOI":"10.1145\/1232919.1232925"},{"key":"226_CR17","doi-asserted-by":"publisher","unstructured":"He K, Rozner E, Agarwal K, Felter W, Carter J, Akella A (2015) Presto: Edge-based Load Balancing for Fast Datacenter Networks In: ACM SIGCOMM Computer Communication Review, 465\u2013478. https:\/\/doi.org\/10.1145\/2829988.2787507.","DOI":"10.1145\/2829988.2787507"},{"key":"226_CR18","doi-asserted-by":"publisher","unstructured":"Ghorbani S, Godfrey B, Ganjali Y, Firoozshahian A (2015) Micro Load Balancing in Data Centers with DRILL, HotNets-XIV (hold in Philadelphia, PA) In: Proceedings of the 14th ACM Workshop on Hot Topics in Networks, Article No.: 17, 1\u20137. https:\/\/doi.org\/10.1145\/2834050.2834107.","DOI":"10.1145\/2834050.2834107"},{"key":"226_CR19","unstructured":"Wischik D, Raiciu C, Greenhalgh A, Handley M (2011) Design, implementation and evaluation of congestion control for multipath TCP. Symposium on Networked Systems Design and Implementation (hold at Boston, MA, USA). USENIX."},{"key":"226_CR20","doi-asserted-by":"publisher","unstructured":"Kabbani A, Vamanan B, Hasan J, Duchene F (2014) Flowbender: Flow-level Adaptive Routing for Improved Latency and Throughput in Datacenter Networks. CoNEXT \u201914 (hold in University of Technology Sydney in Sydney, Australia) In: Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies, 149\u2013160. https:\/\/doi.org\/10.1145\/2674005.2674985.","DOI":"10.1145\/2674005.2674985"},{"issue":"4","key":"226_CR21","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/1594977.1592576","volume":"39","author":"A Greenberg","year":"2009","unstructured":"Greenberg A, Hamilton JR, Jain N, Kandula S, Kim C, Lahiri P, Maltz DA, Patel P, Sengupta S (2009) VL2: a scalable and flexible data center network. ACM SIGCOMM CCR 39(4):51\u201362.","journal-title":"ACM SIGCOMM CCR"},{"issue":"4","key":"226_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/1594977.1592575","volume":"39","author":"R Niranjan Mysore","year":"2009","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. ACM SIGCOMM CCR 39(4):39\u201350.","journal-title":"ACM SIGCOMM CCR"},{"issue":"4","key":"226_CR23","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1594977.1592577","volume":"39","author":"C Guo","year":"2009","unstructured":"Guo C, Lu G, Li D, Wu H, Zhang X, Shi Y, Tian C, Zhang Y, Lu S (2009) BCube: a high performance, server-centric network architecture for modular data centers. ACM SIGCOMM CCR 39(4):63\u201374.","journal-title":"ACM SIGCOMM CCR"},{"issue":"4","key":"226_CR24","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/1402946.1402968","volume":"38","author":"C Guo","year":"2008","unstructured":"Guo C, Wu H, Tan K, Shi L, Zhang Y, Lu S (2008) DCell: a scalable and fault-tolerant network structure for data centers. ACM SIGCOMM CCR 38(4):75\u201386.","journal-title":"ACM SIGCOMM CCR"},{"key":"226_CR25","unstructured":"Liang M (2006) A method for vector address coding. Chinese patent."},{"issue":"2","key":"226_CR26","first-page":"30","volume":"17","author":"N McKeown","year":"2009","unstructured":"McKeown N (2009) Software-defined Networking. IEEE INFOCOM Keynote Talk 17(2):30\u201332.","journal-title":"IEEE INFOCOM Keynote Talk"},{"key":"226_CR27","doi-asserted-by":"publisher","unstructured":"Bianco A, Krishnamoorthi V, Li N, Giraudo L (2014) OpenFlow driven ethernet traffic analysis In: 2014 IEEE International Conference on Communications (ICC), 3001\u20133006, Sydney. https:\/\/doi.org\/10.1109\/ICC.2014.6883781.","DOI":"10.1109\/ICC.2014.6883781"},{"key":"226_CR28","volume-title":"IMC","author":"T Benson","year":"2010","unstructured":"Benson T, Akella A, Maltz DA (2010) Network traffic characteristics of data centers in the wild In: IMC.. Association for Computing Machinery New York NY United States (ACM), Melbourne."},{"key":"226_CR29","volume-title":"IMC","author":"S Kandula","year":"2009","unstructured":"Kandula S, Sengupta S, Greenberg AG, Patel P, Chaiken R (2009) The nature of data center traffic: Measurements analysis In: IMC.. Association for Computing Machinery, New York, NY, United States (ACM), Chicago."},{"key":"226_CR30","volume-title":"SIGCOMM","author":"AR Curtis","year":"2011","unstructured":"Curtis AR, Mogul JC, Tourrilhes J, Yalagandula P, Sharma P, Banerjee S (2011) Devoflow: Scaling flow management for high-performance networks In: SIGCOMM.. Association for Computing Machinery, New York, NY, United States (ACM), Toronto."},{"key":"226_CR31","volume-title":"CoNEXT","author":"N Katta","year":"2017","unstructured":"Katta N, Ghag A, Hira M, Keslassy I, Bergman A, Kim C, Rexford J (2017) Clove: Congestion-Aware Load Balancing at the Virtual Edge In: CoNEXT.. Association for Computing Machinery, New York, NY, United States (ACM), Incheon."},{"key":"226_CR32","volume-title":"SIGCOMM","author":"S Kandula","year":"2005","unstructured":"Kandula S, Katabi D, Davie BS, Charny A (2005) Walking the Tightrope: Responsive yet stable traffic engineering In: SIGCOMM.. Association for Computing Machinery, New York, NY, United States (ACM), Philadelphia."},{"key":"226_CR33","volume-title":"ICDCS","author":"X Wu","year":"2012","unstructured":"Wu X, Yang X (2012) DARD: Distributed adaptive routing for datacenter networks In: ICDCS.. IEEE, Macau."},{"key":"226_CR34","doi-asserted-by":"publisher","unstructured":"Lin X-Y, Chung Y-C, Huang T-Y (2004) 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., Santa Fe. https:\/\/doi.org\/10.1109\/IPDPS.2004.1302913.","DOI":"10.1109\/IPDPS.2004.1302913"},{"key":"226_CR35","volume-title":"SIGCOMM","author":"C Raiciu","year":"2011","unstructured":"Raiciu C, et al (2011) Improving datacenter performance and robustness with multipath tcp In: SIGCOMM.. Association for Computing Machinery, New York, NY, United States (ACM), Toronto."},{"key":"226_CR36","volume-title":"Proceedings of ACM SIGCOMM","author":"M AL-FARES","year":"2008","unstructured":"AL-FARES M, LOUKISSAS A, VAHDAT A (2008) A Scalable,Commodity Data Center Network Architecture In: Proceedings of ACM SIGCOMM.. Association for Computing Machinery, New York, NY, United States (ACM), Seattle."},{"issue":"4","key":"226_CR37","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1851275.1851192","volume":"40","author":"M Alizadeh","year":"2010","unstructured":"Alizadeh M, Greenberg A, Maltz DA, Padhye J, Patel P, Prabhakar B, Sengupta S, Sridharan M (2010) Data center tcp (dctcp). ACM SIGCOMM Comput Commun Rev 40(4):63\u201374.","journal-title":"ACM SIGCOMM Comput Commun Rev"}],"container-title":["Journal of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-021-00226-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13677-021-00226-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-021-00226-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T23:06:30Z","timestamp":1612825590000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofcloudcomputing.springeropen.com\/articles\/10.1186\/s13677-021-00226-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,8]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["226"],"URL":"https:\/\/doi.org\/10.1186\/s13677-021-00226-w","relation":{},"ISSN":["2192-113X"],"issn-type":[{"value":"2192-113X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,8]]},"assertion":[{"value":"21 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"13"}}