{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:46:29Z","timestamp":1760150789343,"version":"build-2065373602"},"reference-count":41,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T00:00:00Z","timestamp":1703894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62101415"],"award-info":[{"award-number":["62101415"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Many emerging Internet of Things (IoT) applications deployed on cloud platforms have strict latency requirements or deadline constraints, and thus meeting the deadlines is crucial to ensure the quality of service for users and the revenue for service providers in these delay-stringent IoT applications. Efficient flow scheduling in data center networks (DCNs) plays a major role in reducing the execution time of jobs and has garnered significant attention in recent years. However, only few studies have attempted to combine job-level flow scheduling and routing to guarantee meeting the deadlines of multi-stage jobs. In this paper, an efficient heuristic joint flow scheduling and routing (JFSR) scheme is proposed. First, targeting maximizing the number of jobs for which the deadlines have been met, we formulate the joint flow scheduling and routing optimization problem for multiple multi-stage jobs. Second, due to its mathematical intractability, this problem is decomposed into two sub-problems: inter-coflow scheduling and intra-coflow scheduling. In the first sub-problem, coflows from different jobs are scheduled according to their relative remaining times; in the second sub-problem, an iterative coflow scheduling and routing (ICSR) algorithm is designed to alternately optimize the routing path and bandwidth allocation for each scheduled coflow. Finally, simulation results demonstrate that the proposed JFSR scheme can significantly increase the number of jobs for which the deadlines have been met in DCNs.<\/jats:p>","DOI":"10.3390\/s24010216","type":"journal-article","created":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T04:51:51Z","timestamp":1703998311000},"page":"216","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Job-Deadline-Guarantee-Based Joint Flow Scheduling and Routing Scheme in Data Center Networks"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5477-2095","authenticated-orcid":false,"given":"Long","family":"Suo","sequence":"first","affiliation":[{"name":"College of Information Science and Technology, Nanjing Forestry University, Nanjing 210037, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han","family":"Ma","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Service Networks, Xidian University, Xi\u2019an 710071, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2075-3312","authenticated-orcid":false,"given":"Wanguo","family":"Jiao","sequence":"additional","affiliation":[{"name":"College of Information Science and Technology, Nanjing Forestry University, Nanjing 210037, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2629-621X","authenticated-orcid":false,"given":"Xiaoming","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Information Science and Technology, Nanjing Forestry University, Nanjing 210037, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,12,30]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/MNET.2018.1700164","article-title":"ETC-IoT: Edge-Node-Assisted Transmitting for the Cloud-Centric Internet of Things","volume":"32","author":"Zhao","year":"2018","journal-title":"IEEE Netw."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/JIOT.2017.2767608","article-title":"Future Edge Cloud and Edge Computing for Internet of Things Applications","volume":"5","author":"Pan","year":"2018","journal-title":"IEEE Internet Things J."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Bozkurt, I., Aguirre, A., and Chandrasekaran, B. (2017, January 30\u201331). Why is the Internet so Slow?. Proceedings of the International Conference on Passive and Active Network Measurement, Sydney, NSW, Australia.","DOI":"10.1007\/978-3-319-54328-4_13"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1109\/JSAC.2020.3018809","article-title":"Resource Allocation for Energy-Efficient MEC in NOMA-Enabled Massive IoT Networks","volume":"39","author":"Liu","year":"2021","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1546","DOI":"10.1109\/TCC.2022.3147226","article-title":"Trust-Based Secure Multi-Cloud Collaboration Framework in Cloud-Fog-Assisted IoT","volume":"11","author":"Zhang","year":"2023","journal-title":"IEEE Trans. Cloud Comput."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Giroire, F., Huin, N., Tomassilli, A., and P\u00e9rennes, S. (May, January 29). When network matters: Data center scheduling with network tasks. Proceedings of the IEEE INFOCOM 2019-IEEE Conference on Computer Communications, Paris, France.","DOI":"10.1109\/INFOCOM.2019.8737415"},{"key":"ref_7","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":"ref_8","unstructured":"Zaharia, M., Chowdhury, M., Franklin, M.J., Shenker, S., and Stoica, I. (2010, January 22\u201325). Spark: Cluster Computing with Working Sets. Proceedings of the 2nd USENIX Conference on Hot Topics in Cloud Computing, Boston, MA, USA."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/2043164.2018448","article-title":"Managing Data transfers in computer clusters with orchestra","volume":"41","author":"Chowdhury","year":"2011","journal-title":"ACM Sigcomm Comput. Commun. Rev."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Hong, C.Y., Caesar, M., and Godfrey, P.B. (2012, January 13\u201317). Finishing Flows Quickly with Preemptive Scheduling. Proceedings of the ACM SIGCOMM 2012 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, Helsinki, Finland.","DOI":"10.1145\/2342356.2342389"},{"key":"ref_11","unstructured":"Guo, Z., Hui, S., Xu, Y., and Chao, H.J. (2016, January 20\u201321). Dynamic flow scheduling for power-efficient data center networks. Proceedings of the 2016 IEEE\/ACM 24th International Symposium on Quality of Service (IWQoS), Beijing, China."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Gopalakrishna, V.K., Kaymak, Y., Lin, C.B., and Rojas-Cessa, R. (2020, January 11\u201314). PEQ: Scheduling Time-Sensitive Data-Center Flows using Weighted Flow Sizes and Deadlines. Proceedings of the 2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR), Newark, NJ, USA.","DOI":"10.1109\/HPSR48589.2020.9098992"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/CC.0.7560891","article-title":"Is minimizing flow completion time the optimal way in meeting flow\u2019s deadline in datacenter networks","volume":"13","author":"Xu","year":"2016","journal-title":"China Commun."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1109\/TSC.2017.2701363","article-title":"Deadline Flow Scheduling in Datacenters with Time-Varying Bandwidth Allocations","volume":"13","author":"Ho","year":"2020","journal-title":"IEEE Trans. Serv. Comput."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Chowdhury, M., and Stoica, I. (2012, January 29\u201330). Coflow: A networking abstraction for cluster applications. Proceedings of the 11th ACM Workshop on Hot Topics in Networks, Association for Computing Machinery, Redmond, WA, USA.","DOI":"10.1145\/2390231.2390237"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Qiu, Z., Stein, C., and Zhong, Y. (2015, January 13\u201315). Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks. Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, Portland, OR, USA.","DOI":"10.1145\/2755573.2755592"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.jpdc.2016.05.009","article-title":"The features, hardware, and architectures of data center networks: A survey","volume":"96","author":"Chen","year":"2016","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1145\/2740070.2626315","article-title":"Efficient coflow scheduling with Varys","volume":"44","author":"Chowdhury","year":"2014","journal-title":"ACM Sigcomm Comput. Commun. Rev."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Ma, S., Jiang, J., Li, B., and Li, B. (2016, January 22\u201327). Chronos: Meeting coflow deadlines in data center networks. Proceedings of the 2016 IEEE International Conference on Communications (ICC), Kuala Lumpur, Malaysia.","DOI":"10.1109\/ICC.2016.7511249"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Luo, S., Yu, H., and Li, L. (2016, January 23\u201327). Decentralized deadline-aware coflow scheduling for datacenter networks. Proceedings of the 2016 IEEE International Conference on Communications (ICC), Kuala Lumpur, Malaysia.","DOI":"10.1109\/ICC.2016.7511251"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"3366","DOI":"10.1109\/TPDS.2016.2525767","article-title":"Towards Practical and Near-Optimal Coflow Scheduling for Data Center Networks","volume":"27","author":"Luo","year":"2016","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1145\/2829988.2787480","article-title":"Efficient Coflow Scheduling without Prior Knowledge","volume":"45","author":"Chowdhury","year":"2015","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ren, F., Shu, R., and Wang, B. (2018, January 4\u20136). Scheduling Coflows with Incomplete Information. Proceedings of the 2018 IEEE\/ACM 26th International Symposium on Quality of Service (IWQoS), Banff, AL, Canada.","DOI":"10.1109\/IWQoS.2018.8624126"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2003","DOI":"10.1109\/TPDS.2019.2905560","article-title":"Efficient Scheduling of Weighted Coflows in Data Centers","volume":"30","author":"Wang","year":"2019","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Liu, Y., Li, W., Li, K., Qi, H., Tao, X., and Chen, S. (2016, January 23\u201326). Scheduling Dependent Coflows with Guaranteed Job Completion Time. Proceedings of the 2016 IEEE Trustcom\/BigDataSE\/ISPA, Tianjin, China.","DOI":"10.1109\/TrustCom.2016.0324"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Borjigin, W., Ota, K., and Dong, M. (2017, January 24\u201327). Time-Saving First: Coflow Scheduling for Datacenter Networks. Proceedings of the 2017 IEEE 86th Vehicular Technology Conference (VTC-Fall), Toronto, ON, Canada.","DOI":"10.1109\/VTCFall.2017.8288339"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s42045-019-00018-6","article-title":"Efficient scheduling for multi-stage coflows","volume":"2","author":"Zhang","year":"2019","journal-title":"CCF Trans. Netw."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/j.comnet.2019.05.010","article-title":"Scheduling dependent coflows to minimize the total weighted job completion time in datacenters","volume":"158","author":"Tian","year":"2019","journal-title":"Comput. Netw."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Wang, J., Zhou, H., Yang, H., Laat, C.D., and Zhao, Z. (2017, January 11\u201314). Deadline-aware coflow scheduling in a DAG. Proceedings of the 2017 IEEE International Conference on Cloud Computing Technology and Science (CloudCom), Hong Kong, China.","DOI":"10.1109\/CloudCom.2017.55"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"A28","DOI":"10.1364\/JOCN.12.000A28","article-title":"OPTUNS: Optical intra-data center network architecture and prototype testbed for a 5G edge cloud [Invited]","volume":"12","author":"Yuang","year":"2020","journal-title":"J. Opt. Commun. Netw."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.jnca.2015.10.017","article-title":"Joint flow routing-scheduling for energy efficient software defined data center networks A prototype of energy-aware network management platform","volume":"63","author":"Zhu","year":"2016","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Chen, K., Bai, W., Yu, M., Tian, C., Geng, Y., Zhang, Y., Li, D., and Wang, S. (May, January 26). Rapier: Integrating routing and scheduling for coflow-aware data center networks. Proceedings of the 2015 IEEE Conference on Computer Communications (INFOCOM), Kowloon, Hong Kong.","DOI":"10.1109\/INFOCOM.2015.7218408"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Jiang, J., Ma, S., Li, B., and Li, B. (2016, January 1\u20134). Tailor: Trimming Coflow Completion Times in Datacenter Networks. Proceedings of the 2016 25th International Conference on Computer Communication and Networks (ICCCN), Waikoloa, HI, USA.","DOI":"10.1109\/ICCCN.2016.7568579"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Li, Y., Jiang, H.C., Tan, H., Zhang, C., and Lau, F. (2016, January 12\u201316). Efficient online coflow routing and scheduling. Proceedings of the the 17th ACM International Symposium. Association for Computing Machinery, Trento, Italy.","DOI":"10.1145\/2942358.2942367"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1771","DOI":"10.1109\/TNET.2019.2930721","article-title":"Joint Online Coflow Routing and Scheduling in Data Center Networks","volume":"27","author":"Tan","year":"2019","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Chen, Y., and Wu, J. (2018, January 20\u201324). Multi-Hop Coflow Routing and Scheduling in Data Centers. Proceedings of the 2018 IEEE International Conference on Communications (ICC), Kansas City, MO, USA.","DOI":"10.1109\/ICC.2018.8422880"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.jpdc.2020.09.007","article-title":"Joint coflow routing and scheduling in leaf-spine data centers","volume":"148","author":"Chen","year":"2021","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"107686","DOI":"10.1016\/j.comnet.2020.107686","article-title":"Scheduling coflows of multi-stage jobs under network resource constraints","volume":"184","author":"Zeng","year":"2021","journal-title":"Comput. Netw."},{"key":"ref_39","unstructured":"Kai, H., Hu, Z., Luo, J., and Liu, X. (May, January 26). RUSH: RoUting and Scheduling for Hybrid Data Center Networks. Proceedings of the 2015 IEEE Conference on Computer Communications (INFOCOM), Kowloon, Hong Kong."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Al-Fares, M., Loukissas, A., and Vahdat, A. (2008, January 17\u201322). A Scalable, Commodity Data Center Network Architecture. Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication. Association for Computing Machinery, Seattle, WA, USA.","DOI":"10.1145\/1402958.1402967"},{"key":"ref_41","unstructured":"(2005, May 05). PuLP. Available online: https:\/\/pypi.org\/project\/PuLP\/."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/24\/1\/216\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:44:40Z","timestamp":1760132680000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/24\/1\/216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,30]]},"references-count":41,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,1]]}},"alternative-id":["s24010216"],"URL":"https:\/\/doi.org\/10.3390\/s24010216","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2023,12,30]]}}}