{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T03:21:05Z","timestamp":1768965665675,"version":"3.49.0"},"reference-count":31,"publisher":"Oxford University Press (OUP)","issue":"10","license":[{"start":{"date-parts":[[2019,12,7]],"date-time":"2019-12-07T00:00:00Z","timestamp":1575676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Modern data centers provide multiple parallel paths for end-to-end communications. Recent studies have been done on how to allocate rational paths for data flows to increase the throughput of data center networks. A centralized load balancing algorithm can improve the rationality of the path selection by using path bandwidth information. However, to ensure the accuracy of the information, current centralized load balancing algorithms monitor all the link bandwidth information in the path to determine the path bandwidth. Due to the excessive link bandwidth information monitored by the controller, however, much time is consumed, which is unacceptable for modern data centers. This paper proposes an algorithm called hidden Markov Model-based Load Balancing (HMMLB). HMMLB utilizes the hidden Markov Model (HMM) to select paths for data flows with fewer monitored links, less time cost, and approximate the same network throughput rate as a traditional centralized load balancing algorithm. To generate HMMLB, this research first turns the problem of path selection into an HMM problem. Secondly, deploying traditional centralized load balancing algorithms in the data center topology to collect training data. Finally, training the HMM with the collected data. Through simulation experiments, this paper verifies HMMLB\u2019s effectiveness.<\/jats:p>","DOI":"10.1093\/comjnl\/bxz142","type":"journal-article","created":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T19:09:11Z","timestamp":1571857751000},"page":"1449-1462","source":"Crossref","is-referenced-by-count":6,"title":["Hidden Markov Model-based Load Balancing in Data Center Networks"],"prefix":"10.1093","volume":"63","author":[{"given":"Binjie","family":"He","sequence":"first","affiliation":[{"name":"College of Mathmatics and Computer Science, Fuzhou University, China"}]},{"given":"Dong","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Mathmatics and Computer Science, Fuzhou University, China"}]},{"given":"Chang","family":"Zhao","sequence":"additional","affiliation":[{"name":"College of Mathmatics and Computer Science, Fuzhou University, China"}]}],"member":"286","published-online":{"date-parts":[[2019,12,7]]},"reference":[{"key":"2020101408043903000_ref1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","article-title":"Mapreduce: simplified data processing on large clusters","volume":"51","author":"Dean","year":"2008","journal-title":"Commun. ACM"},{"key":"2020101408043903000_ref2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/1402946.1402967","article-title":"A scalable, commodity data center network architecture","volume":"38","author":"Alfares","year":"2008","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"2020101408043903000_ref3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/1897852.1897877","article-title":"Vl2: a scalable and flexible data center network","volume":"54","author":"Greenberg","year":"2009","journal-title":"Commun. ACM"},{"key":"2020101408043903000_ref4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/1402946.1402968","article-title":"Dcell: a scalable and fault-tolerant network structure for data centers","volume":"38","author":"Guo","year":"2008","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"2020101408043903000_ref5","doi-asserted-by":"crossref","first-page":"2324","DOI":"10.1109\/COMST.2018.2816042","article-title":"Load balancing in data center networks: a survey","volume":"20","author":"Zhang","year":"2018","journal-title":"IEEE Commun. Surv. Tut."},{"key":"2020101408043903000_ref6","first-page":"202","article-title":"The Nature of Data Center Traffic: Measurements and Analysis","volume-title":"2009 Internet Measurement Conference","author":"Kandula","year":"2009"},{"key":"2020101408043903000_ref7","first-page":"19","article-title":"Hedera: Dynamic Flow Scheduling for Data Center Networks","volume-title":"Proc. 7th USENIX Conf. Networked Systems Design and Implementation","author":"Al-Fares","year":"2010"},{"key":"2020101408043903000_ref8","doi-asserted-by":"crossref","first-page":"1629","DOI":"10.1109\/INFCOM.2011.5934956","article-title":"Mahout: Low-Overhead Datacenter Traffic Management using End-Host-based Elephant Detection","volume-title":"2011 Proc. IEEE INFOCOM","author":"Curtis","year":"2011"},{"key":"2020101408043903000_ref9","doi-asserted-by":"crossref","DOI":"10.1002\/0471650129.dob0318","volume-title":"Hidden Markov Model (HMM)","author":"Meyer","year":"2004"},{"key":"2020101408043903000_ref10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1145\/1592681.1592692","article-title":"Understanding Data Center Traffic Characteristics","volume-title":"Proc. 1st ACM Workshop on Research on Enterprise Networking","author":"Benson","year":"2009"},{"key":"2020101408043903000_ref11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/MNET.2013.6574663","article-title":"Sketching the data center network traffic","volume":"27","author":"Liu","year":"2013","journal-title":"IEEE Netw."},{"key":"2020101408043903000_ref12","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/ICTON.2006.248387","article-title":"Optimization of the Shortest-Path Routing with Equal-Cost Multi-Path Load Balancing","volume-title":"2006 Int. Conf. Transparent Optical Networks","author":"Dzida","year":"2006"},{"key":"2020101408043903000_ref13","doi-asserted-by":"crossref","DOI":"10.17487\/rfc2992","volume-title":"Analysis of an Equal-Cost Multi-Path Algorithm","author":"Hopps","year":"2000"},{"key":"2020101408043903000_ref14","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1145\/2740070.2626309","article-title":"Fastpass: a centralized \u201czero-queue\u201d datacenter network","volume":"44","author":"Perry","year":"2014","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"2020101408043903000_ref15","first-page":"1","article-title":"FDALB: flow distribution aware load balancing for datacenter networks","volume-title":"2016 IEEE\/ACM 24th Int. Symposium on Quality of Service (IWQoS)","author":"Wang","year":"2016"},{"key":"2020101408043903000_ref16","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1109\/ICNP.2014.59","article-title":"Freeway: adaptively isolating the elephant and mice flows on different transmission paths","volume-title":"2014 IEEE 22nd Int. Conf. Network Protocols","author":"Wang","year":"2014"},{"key":"2020101408043903000_ref17","doi-asserted-by":"crossref","first-page":"30648","DOI":"10.1109\/ACCESS.2019.2902610","article-title":"A practical traffic control scheme with load balancing based on PCE architecture","volume":"7","author":"Zhang","year":"2019","journal-title":"IEEE Access"},{"key":"2020101408043903000_ref18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3243173","article-title":"Efficient traffic load-balancing via incremental expansion of routing choices","volume":"4","author":"Yin","year":"2019","journal-title":"ACM Trans. Model. Perform. Eval. Comput. Syst."},{"key":"2020101408043903000_ref19","doi-asserted-by":"crossref","first-page":"e3875","DOI":"10.1002\/dac.3875","article-title":"Nature-inspired meta-heuristic algorithms for solving the load balancing problem in the software-defined network","volume":"32","author":"Akbar Neghabi","year":"2019","journal-title":"Int. J. Commun. Syst."},{"key":"2020101408043903000_ref20","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3390\/sym11020145","article-title":"Novel multi-level dynamic traffic load-balancing protocol for data center","volume":"11","author":"Memon","year":"2019","journal-title":"Symmetry"},{"key":"2020101408043903000_ref21","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/TPDS.2018.2858815","article-title":"Luopan: sampling-based load balancing in data center networks","volume":"30","author":"Wang","year":"2019","journal-title":"IEEE Trans. Parallel Distr. Syst."},{"key":"2020101408043903000_ref22","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1364\/JOCN.3.000411","article-title":"Analysis of blocking probability for first-fit wavelength assignment in transmission-impaired optical networks","volume":"3","author":"He","year":"2011","journal-title":"IEEE\/OSA J. Optical Commun. Netw."},{"key":"2020101408043903000_ref23","first-page":"1","article-title":"Simulated-annealing load balancing for resource allocation in cloud environments","volume-title":"Proc. 2013 Int. Conf. Parallel and Distributed Computing, Applications and Technologies","author":"Fan","year":"2013"},{"key":"2020101408043903000_ref24","volume-title":"Bisection Bandwidth","author":"Surhone","year":"2010"},{"key":"2020101408043903000_ref25","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/2534169.2486020","article-title":"TCP ex machina: computer-generated congestion control","volume":"43","author":"Winstein","year":"2013","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"2020101408043903000_ref26","first-page":"577","article-title":"The infinite hidden Markov model","volume":"14","author":"Beal","year":"2002","journal-title":"Adv. Neural Inf Process Syst."},{"key":"2020101408043903000_ref27","first-page":"147","article-title":"Maximum likelihood estimation (MLE)","volume":"17","author":"Paszek","year":"2005","journal-title":"BMS Bull. Sociol. Methodol."},{"key":"2020101408043903000_ref28","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/79.410439","article-title":"Implementing the Viterbi algorithm","volume":"12","author":"Lou","year":"1995","journal-title":"IEEE Signal Process Mag."},{"key":"2020101408043903000_ref29","first-page":"139","volume-title":"Int. Conf. Communication, Computing & Systems (ICCCS)","author":"Kaur","year":"2014"},{"key":"2020101408043903000_ref30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.53829\/ntr201408fa4","article-title":"Ryu SDN framework-open-source SDN platform software","volume":"12","author":"Kubo","year":"2014","journal-title":"NTT Technical Rev."},{"key":"2020101408043903000_ref31","first-page":"62","article-title":"State-of-the-art survey on software-defined networking (SDN)","volume":"26","author":"Zhang","year":"2015","journal-title":"J. Softw."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/63\/10\/1449\/33876530\/bxz142.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/63\/10\/1449\/33876530\/bxz142.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T14:59:12Z","timestamp":1721919552000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/63\/10\/1449\/5666159"}},"subtitle":[],"editor":[{"given":"Alan","family":"Marshall","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2019,12,7]]},"references-count":31,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2019,12,7]]},"published-print":{"date-parts":[[2020,10,19]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxz142","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2020,10]]},"published":{"date-parts":[[2019,12,7]]}}}