{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:02:44Z","timestamp":1764784964434,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T00:00:00Z","timestamp":1666483200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T00:00:00Z","timestamp":1666483200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Ahmet Yesevi University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s11227-022-04893-7","type":"journal-article","created":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T17:03:29Z","timestamp":1666544609000},"page":"5443-5468","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Adjusting ECN marking threshold in multi-queue DCNs with deep learning"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0638-6859","authenticated-orcid":false,"given":"Anuarbek","family":"Amanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1356-8431","authenticated-orcid":false,"given":"Akbar","family":"Majidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nazila","family":"Jahnabakhsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8669-823X","authenticated-orcid":false,"given":"Ayd\u0131n","family":"\u00c7etin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,23]]},"reference":[{"key":"4893_CR1","doi-asserted-by":"publisher","unstructured":"Ramakrishnan K, Floyd S (1998) A proposal to add explicit congestion notification (ECN) to IP. Tech Rep, pp 751\u2013755. https:\/\/doi.org\/10.17487\/RFC2481","DOI":"10.17487\/RFC2481"},{"issue":"4","key":"4893_CR2","first-page":"63","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) Datacenter TCP (DCTCP). Annual Conference of the ACM Special Interest Group on Data Communication (SIGCOMM) 40(4):63\u201374","journal-title":"Annual Conference of the ACM Special Interest Group on Data Communication (SIGCOMM)"},{"key":"4893_CR3","unstructured":"Bai W, Chen L, Chen K, Wu H (2016). Enabling ECN in multi-service multi-queue datacenters. In: NSDI'16: Proceedings of the 13th Usenix Conference on Networked Systems Design and Implementation (NSDI), pp 537\u2013549"},{"key":"4893_CR4","doi-asserted-by":"publisher","unstructured":"Akbar M, Gao X, Zhu S, Jahanbakhsh N, Zheng J, Chen G (2020) MiFi: bounded update to optimize network performance in software-defined data centers. IEEE\/ACM Transactions Netw (ToN), pp 1\u201314. https:\/\/doi.org\/10.1109\/TNET.2022.3192167","DOI":"10.1109\/TNET.2022.3192167"},{"key":"4893_CR5","doi-asserted-by":"publisher","unstructured":"Handley M, Raiciu C, Agache A, Voinescu A, Moore AW, Antichi G, Wo'jcik M (2017) Re-architecting datacenter networks and stacks for low latency and high performance. In: SIGCOMM '17: Proceedings of the Conference of the ACM Special Interest Group on Data Communication (SIGCOMM), pp 29\u201342. https:\/\/doi.org\/10.1145\/3098822.3098825.","DOI":"10.1145\/3098822.3098825"},{"issue":"1","key":"4893_CR6","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/MIC.2017.11","volume":"21","author":"J Luo","year":"2015","unstructured":"Luo J, Jin J, Shan F (2015) Standardization of low-latency TCP with explicit congestion notification: a survey. IEEE Internet Comput 21(1):48\u201355. https:\/\/doi.org\/10.1109\/MIC.2017.11","journal-title":"IEEE Internet Comput"},{"key":"4893_CR7","doi-asserted-by":"crossref","unstructured":"Fred Baker, Gorry Fairhurst (2015). IETF recommendations regarding active queue management. Internet Eng Task Force (IETF), Technical report","DOI":"10.17487\/RFC7567"},{"key":"4893_CR8","unstructured":"Kuhn N,Natarajan P, Khademi N, Ros D (2016) Characterization guide queues for active queue management (aqm). Internet Eng Task Force (IETF), Technical report"},{"key":"4893_CR9","unstructured":"Bagnulo M, Briscoe B (2017) ECN++: adding explicit congestion notification (ECN) to TCP control packets. Draft-bagnulo-tcpm-generalized-ecn-04 (2017, work in progress). Internet Eng Task Force (IETF)"},{"key":"4893_CR10","doi-asserted-by":"crossref","unstructured":"Kuehlewind M, Scheffenegger R, Briscoe B (2015) Problem statement and requirements for increased accuracy in explicit congestion notification (ECN) feedback Internet Engineering Task Force (IETF). RFC 7560","DOI":"10.17487\/RFC7560"},{"key":"4893_CR11","doi-asserted-by":"crossref","unstructured":"Gao C, Lee VCS (2016) DEME: Decouple packet marking from enqueuing for multiple services in datacenter networks. In: In International Conference on Network Protocols (ICNP), pp 1\u20132. IEEE.","DOI":"10.1109\/ICNP.2016.7784465"},{"key":"4893_CR12","doi-asserted-by":"publisher","unstructured":"Gao C, Lee VCS, Li K (2017) DemePro: decouple packet marking from enqueuing for multiple services with proactive congestion control. IEEE Trans Cloud Comput (TCM), pp 1\u20131. https:\/\/doi.org\/10.1109\/TCC.2017.2688318.","DOI":"10.1109\/TCC.2017.2688318"},{"key":"4893_CR13","doi-asserted-by":"crossref","unstructured":"Floyd S, Jacobson V (1993) Random early detection gateways for congestion avoidance. IEEE\/ACM Trans Netw (TON), 1(4):397\u2013413","DOI":"10.1109\/90.251892"},{"key":"4893_CR14","doi-asserted-by":"publisher","unstructured":"Majidi A, Jahanbakhsh N, Gao X, Zheng J, Chen G (2020) ECN+: A marking-aware optimization for ECN threshold via per-port in data center networks. J Netw Comput Appl (JNCA), 152(C). https:\/\/doi.org\/10.1016\/j.jnca.2019.102504, 152:102504\u2013102517.","DOI":"10.1016\/j.jnca.2019.102504"},{"key":"4893_CR15","doi-asserted-by":"publisher","unstructured":"A, Jahanbakhsh N, Gao X, Zheng J, Chen G (2020) DC-ECN: a machine-learning based dynamic threshold control scheme for ECN marking in DCN. Comput Commun 150(C):334\u2013345. https:\/\/doi.org\/10.1016\/j.comcom.2019.10.028Majidi.","DOI":"10.1016\/j.comcom.2019.10.028"},{"key":"4893_CR16","doi-asserted-by":"publisher","unstructured":"Majidi A, Gao X, Jahanbakhsh S, Jamali S, Zheng J, Chen G (2019) Deep-RL: deep reinforcement learning for marking-aware via per-port in data centers. In: 2019 IEEE 25th International Conference on Parallel and Distributed Systems (ICPADS), pp 392\u2013395. https:\/\/doi.org\/10.1109\/ICPADS47876.2019.00061.","DOI":"10.1109\/ICPADS47876.2019.00061"},{"key":"4893_CR17","doi-asserted-by":"publisher","unstructured":"Majidi A, Gao X, Jahanbakhsh N, Zheng J, Chen G (2020) Priority policy in multi-queue datacenter networks via per-port ECN marking. In: 2020 14th International Conference on Ubiquitous Information Management and Communication (IMCOM), pp 1\u20138, IEEE. https:\/\/doi.org\/10.1109\/IMCOM48794.2020.9001721.","DOI":"10.1109\/IMCOM48794.2020.9001721"},{"key":"4893_CR18","doi-asserted-by":"publisher","unstructured":"Shan D, Ren F (2017) Improving ECN marking scheme with micro-burst traffic in data center networks. In: International Conference on Computer Communications (INFOCOM). IEEE, 2017, pp 1\u20139. https:\/\/doi.org\/10.1109\/INFOCOM.2017.8057181.","DOI":"10.1109\/INFOCOM.2017.8057181"},{"issue":"1","key":"4893_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/2007116.2007123","volume":"39","author":"M Alizadeh","year":"2011","unstructured":"Alizadeh M, Kabbani A, Atikoglu B, Prabhakar B (2011) Stability analysis of QCN: the averaging principle. ACM SIGMETRICS Perform Eval Rev 39(1):49\u201360. https:\/\/doi.org\/10.1145\/2007116.2007123","journal-title":"ACM SIGMETRICS Perform Eval Rev"},{"key":"4893_CR20","doi-asserted-by":"publisher","unstructured":"Shan D, Ren F, Cheng P, Shu R, Guo C (2018) Micro-burst in data centers: observations, analysis, and mitigations. In: 2018 IEEE 26th International Conference on Network Protocols (ICNP), 2018, pp 88\u201398. https:\/\/doi.org\/10.1109\/ICNP.2018.00019.","DOI":"10.1109\/ICNP.2018.00019"},{"key":"4893_CR21","doi-asserted-by":"publisher","unstructured":"Wu H, Ju J, Lu G, Guo C, Xiong Y, Zhang Y (2012) Tuning ECN for data center networks. In: CoNEXT '12: Proceedings of the 8th International Conference on Emerging Networking Experiments and Technologies, pp 25\u201336. https:\/\/doi.org\/10.1145\/2413176.2413181.","DOI":"10.1145\/2413176.2413181"},{"key":"4893_CR22","doi-asserted-by":"publisher","unstructured":"Chen L, Chen K, Bai W, Alizadeh M (2016) Scheduling mix-flows in commodity datacenters with karuna. In: Proceedings of the 2016 ACM SIGCOMM Conference, pp 174\u2013187. ACM. https:\/\/doi.org\/10.1145\/2934872.2934888.","DOI":"10.1145\/2934872.2934888"},{"key":"4893_CR23","doi-asserted-by":"publisher","unstructured":"Lu Y, Chen G, Luo L, Tan K, Xiong Y, Wang X, Chen E (2017) One more queue is enough: minimizing flow completion time with explicit priority notification. In: IEEE INFOCOM 2017\u2014IEEE Conference on Computer Communications, 2017, pp 1\u20139. https:\/\/doi.org\/10.1109\/INFOCOM.2017.8056946.","DOI":"10.1109\/INFOCOM.2017.8056946"},{"key":"4893_CR24","unstructured":"Cheng P, Ren F, Shu R, Lin C (2014) Catch the whole lot in an action: rapid precise packet loss notification in data center. In: NSDI'14: Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation (NSDI), pp 17\u201328"},{"key":"4893_CR25","doi-asserted-by":"publisher","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Graves A, Antonoglou I, Wierstra D, Riedmiller M (2013) Playing atari with deep reinforcement learning. arXiv preprint. https:\/\/doi.org\/10.48550\/arXiv.1312.5602.","DOI":"10.48550\/arXiv.1312.5602"},{"key":"4893_CR26","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver D, Huang A, Maddison CJ, Guez A, Sifre L, Van Den Driessche G, Schrittwieser J, Antonoglou I, Panneershelvam V, Lanctot M et al (2016) Mastering the game of Go with deep neural networks and tree search. Nature 529:484\u2013489. https:\/\/doi.org\/10.1038\/nature16961","journal-title":"Nature"},{"key":"4893_CR27","doi-asserted-by":"publisher","unstructured":"Poupart P, Chen Z, Jaini P, Fung F, Susanto H, Geng Y, Chen L, Chen K, Jin H (2016) Online flow size prediction for improved network routing. In: 2016 IEEE 24th International Conference on Network Protocols (ICNP), 2016, pp 1\u20136. https:\/\/doi.org\/10.1109\/ICNP.2016.7785324.","DOI":"10.1109\/ICNP.2016.7785324"},{"key":"4893_CR28","doi-asserted-by":"publisher","unstructured":"Williams CK, Rasmussen CE (2006) Gaussian processes for machine learning. The MIT Press, 2(3):4. https:\/\/doi.org\/10.7551\/mitpress\/3206.001.0001.","DOI":"10.7551\/mitpress\/3206.001.0001"},{"key":"4893_CR29","first-page":"322","volume-title":"Introduction to reinforcement learning","author":"RS Sutton","year":"1998","unstructured":"Sutton RS, Barto AG (1998) Introduction to reinforcement learning. MIT Press, Cambridge, A Bradford Book, p 322"},{"key":"4893_CR30","doi-asserted-by":"publisher","unstructured":"Omar F (2016) Online Bayesian learning in probabilistic graphical models using moment matching with applications. The University of Waterloo's publication. https:\/\/doi.org\/10.13140\/RG.2.2.22951.04003","DOI":"10.13140\/RG.2.2.22951.04003"},{"key":"4893_CR31","unstructured":"Sutton RS, McAllester DA, Singh SP, Mansour Y (1999) Policy gradient methods for reinforcement learning with function approximation. Adv Neural Inf Process Syst"},{"key":"4893_CR32","unstructured":"Silver D, Lever G, Heess N, Degris T, Wierstra D, Riedmiller M (2014) Deterministic policy gradient algorithms. In: ICML'14: Proceedings of the 31st International Conference on International Conference on Machine Learning, vol. 32, pp 387\u2013395"},{"key":"4893_CR33","doi-asserted-by":"publisher","unstructured":"Katta NP, Rexford J, Walker D (2013) Incremental consistent updates. In: HotSDN '13: Proceedings of the second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (SIGCOMM), pp 49\u201354. https:\/\/doi.org\/10.1145\/2491185.2491191.","DOI":"10.1145\/2491185.2491191"},{"key":"4893_CR34","unstructured":"Mnih V, KavukcuogluK, Silver D, Graves A, Antonoglou L, Wierstra D, Riedmiller M (2013) Playing atari with deep reinforcement learning. arXiv preprint: arXiv:1312.5602."},{"key":"4893_CR35","doi-asserted-by":"crossref","unstructured":"Chen L, Lingys J, Chen K, Liu F (2015) Auto: scaling deep reinforcement learning for datacenter-scale automatic traffic optimization. In: SIGCOMM '18: Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication (SIGCOMM), pp 191\u2013205","DOI":"10.1145\/3230543.3230551"},{"key":"4893_CR36","unstructured":"Timothy P Lillicrap, Jonathan J Hunt, Alexander Pritzel, Nicolas Heess, Tom Erez, Yuval Tassa, David Silver, Daan Wierstra (2015). Continuous control with deep reinforcement learning. arXiv preprint: arXiv:1509.02971."},{"key":"4893_CR37","doi-asserted-by":"publisher","unstructured":"Pan Y, Tian C, Zheng J, Zhang G, Susanto H, Bai B, Chen G (2018) Support ECN in multi-queue datacenter networks via per-port marking with selective blindness. In: International Conference on Distributed Computing Systems (ICDCS). IEEE, pp 33\u201342. https:\/\/doi.org\/10.1109\/ICDCS.2018.00014.","DOI":"10.1109\/ICDCS.2018.00014"},{"issue":"4","key":"4893_CR38","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1145\/2534169.2486031","volume":"43","author":"M Alizadeh","year":"2013","unstructured":"Alizadeh M, Yang S, Sharif M, Katti S, McKeown N, Prabhakar B, Shenker S (2013) pFabric: Minimal near-optimal datacenter transport. ACM SIGCOMM Comput Commun Rev 43(4):435\u2013446","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"4893_CR39","doi-asserted-by":"publisher","unstructured":"Van Kessel G, Nunez-Queija R, Borst S (2005) Differenttiated bandwidth sharing with disparate flow sizes. In: Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., 2005, vol 4, pp 2425\u20132435. https:\/\/doi.org\/10.1109\/INFCOM.2005.1498528.","DOI":"10.1109\/INFCOM.2005.1498528"},{"key":"4893_CR40","doi-asserted-by":"publisher","unstructured":"Hu C, Liu B, Zhao H, Chen K, Yu YC, Cheng HW (2014) Discount counting for fast flow statistics on flow size and flow volume. IEEE\/ACM Trans Netw 22(3):970\u2013981. https:\/\/doi.org\/10.1109\/TNET.2013.2270439","DOI":"10.1109\/TNET.2013.2270439"},{"key":"4893_CR41","doi-asserted-by":"publisher","unstructured":"Rai IA, Biersack EW, Urvoy-Kelle G (2005) Size-based scheduling to improve the performance of short TCP flows. EEE Network 19(1):12\u201317. https:\/\/doi.org\/10.1109\/MNET.2005.1383435.","DOI":"10.1109\/MNET.2005.1383435"},{"key":"4893_CR42","doi-asserted-by":"publisher","unstructured":"Bai W, Chen L, Chen K, Han D, Tian C, Wang H (2017) PIAS: practical information-agnostic flow scheduling for commodity data centers. In: IEEE\/ACM Transa Netw 25(4):1954\u20131967. https:\/\/doi.org\/10.1109\/TNET.2017.2669216.","DOI":"10.1109\/TNET.2017.2669216"},{"key":"4893_CR43","doi-asserted-by":"publisher","unstructured":"Kumar A, Xu J (2006) Sketch guided sampling\u2014using on\u2014queue estimates of flow size for adaptive data collection. In: Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, 2006, pp 1\u201311. https:\/\/doi.org\/10.1109\/INFOCOM.2006.326.","DOI":"10.1109\/INFOCOM.2006.326"},{"key":"4893_CR44","doi-asserted-by":"publisher","first-page":"2711","DOI":"10.1109\/INFCOM.2009.5062217","volume":"2009","author":"A Lall","year":"2009","unstructured":"Lall A, Ogihara M, Jun Xu (2009) An efficient algorithm for measuring medium\u2013to\u2013large\u2013sized flows in network traffic. IEEE INFOCOM 2009:2711\u20132715. https:\/\/doi.org\/10.1109\/INFCOM.2009.5062217","journal-title":"IEEE INFOCOM"},{"key":"4893_CR45","doi-asserted-by":"publisher","unstructured":"Hu C, Liu B, Wang S, Tian J, Cheng Y, Chen Y (2012) ANLS: adaptive non\u2013queuear sampling method for accurate flow size measurement. IEEE Trans Commun (ToC)60(3):789\u2013 798. https:\/\/doi.org\/10.1109\/TCOMM.2011.112311.100622.","DOI":"10.1109\/TCOMM.2011.112311.100622"},{"key":"4893_CR46","doi-asserted-by":"publisher","unstructured":"Zandi Y, Majidi A, Ma L (2019) DENA: an intelligent dynamic flow scheduling for rate adjustment in green DCNs. In: IEEE Conference on Local Computer Networks (LCN), pp 234\u2013237. https:\/\/doi.org\/10.1109\/LCN44214.2019.8990731","DOI":"10.1109\/LCN44214.2019.8990731"},{"issue":"1","key":"4893_CR47","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1109\/TNET.2016.2587286","volume":"25","author":"C Lee","year":"2017","unstructured":"Lee C, Park C, Jang K, Moon S, Han D (2017) Dx: latency-based congestion control for datacenters. IEEE\/ACM Trans Netw (TON) 25(1):335\u2013348. https:\/\/doi.org\/10.1109\/TNET.2016.2587286","journal-title":"IEEE\/ACM Trans Netw (TON)"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04893-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04893-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04893-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T10:56:23Z","timestamp":1728212183000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04893-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,23]]},"references-count":47,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["4893"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04893-7","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2022,10,23]]},"assertion":[{"value":"5 October 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflicts of interest to report regarding the present study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}