{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:01:41Z","timestamp":1743026501065,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030457778"},{"type":"electronic","value":"9783030457785"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45778-5_20","type":"book-chapter","created":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T17:02:34Z","timestamp":1587315754000},"page":"296-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["DeepRoute: Herding Elephant and Mice Flows with Reinforcement Learning"],"prefix":"10.1007","author":[{"given":"Mariam","family":"Kiran","sequence":"first","affiliation":[]},{"given":"Bashir","family":"Mohammed","sequence":"additional","affiliation":[]},{"given":"Nandini","family":"Krishnaswamy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"20_CR1","unstructured":"Achieving high utilization with software-driven WAN. Technical report MSR-TR-2013-54, August 2013. https:\/\/www.microsoft.com\/en-us\/research\/publication\/achieving-high-utilization-with-software-driven-wan\/"},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"Akella, A., Seshan, S., Shaikh, A.: An empirical evaluation of wide-area internet bottlenecks. In: SIGMETRICS, pp. 316\u2013317 (2003). https:\/\/doi.org\/10.1145\/781027.781075, http:\/\/doi.acm.org\/10.1145\/781027.781075","DOI":"10.1145\/781027.781075"},{"key":"20_CR3","unstructured":"Al-Fares, M., Radhakrishnan, S., Raghavan, B., Huang, N., Vahdat, A.: Hedera: dynamic flow scheduling for data center networks. In: USENIX Conference Networked Systems Design and Implementation, p. 19 (2010). http:\/\/dl.acm.org\/citation.cfm?id=1855711.1855730"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Alizadeh, M., et al.: Data center TCP (DCTCP). In: SIGCOMM, pp. 63\u201374 (2010). https:\/\/doi.org\/10.1145\/1851182.1851192, http:\/\/doi.acm.org\/10.1145\/1851182.1851192","DOI":"10.1145\/1851182.1851192"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Awduche, D., Malcolm, J., Agogbua, J., O\u2019Dell, M., McManus, J.: Requirements for traffic engineering over MPLS (1999)","DOI":"10.17487\/rfc2702"},{"key":"20_CR6","doi-asserted-by":"publisher","unstructured":"Benson, T., Anand, A., Akella, A., Zhang, M.: MicroTE: fine grained traffic engineering for data centers. In: Conference on Emerging Networking Experiments and Technologies, pp. 8:1\u20138:12 (2011). https:\/\/doi.org\/10.1145\/2079296.2079304, http:\/\/doi.acm.org\/10.1145\/2079296.2079304","DOI":"10.1145\/2079296.2079304"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Carpio, F., Engelmann, A., Jukan, A.: DiffFlow: differentiating short and long flows for load balancing in data center networks. In: GLOBECOM, pp. 1\u20136, December 2016. https:\/\/doi.org\/10.1109\/GLOCOM.2016.7841733","DOI":"10.1109\/GLOCOM.2016.7841733"},{"key":"20_CR8","doi-asserted-by":"publisher","unstructured":"Chakravorty, R., Banerjee, S., Rodriguez, P., Chesterfield, J., Pratt, I.: Performance optimizations for wireless wide-area networks: comparative study and experimental evaluation. In: International Conference on Mobile Computing and Networking, pp. 159\u2013173 (2004). https:\/\/doi.org\/10.1145\/1023720.1023737, http:\/\/doi.acm.org\/10.1145\/1023720.1023737","DOI":"10.1145\/1023720.1023737"},{"key":"20_CR9","unstructured":"Cisco: Trending analysis (2019). https:\/\/www.cisco.com\/c\/en\/us\/solutions\/collateral\/service-provider\/visual-networking-index-vni\/vni-hyperconnectivity-wp.html"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Clark, D., et al.: Measurement and analysis of Internet interconnection and congestion. In: Telecommunication Policy Research Conference, September 2014","DOI":"10.2139\/ssrn.2417573"},{"key":"20_CR11","unstructured":"Congdon, P.: Link layer discovery protocol and MIB. V1. 0, 20 May 2002, pp. 1\u201320 (2002)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Curtis, A.R., Mogul, J.C., Tourrilhes, J., Yalagandula, P., Sharma, P., Banerjee, S.: DevoFlow: scaling flow management for high-performance networks. SIGCOMM Comput. Commun. Rev. 41","DOI":"10.1145\/2043164.2018466"},{"key":"20_CR13","doi-asserted-by":"publisher","unstructured":"Domzal, J., Jajszczyk, A.: New congestion control mechanisms for flow-aware networks. In: International Conference Communications, May 2008. https:\/\/doi.org\/10.1109\/ICC.2008.11","DOI":"10.1109\/ICC.2008.11"},{"issue":"4","key":"20_CR14","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/90.413212","volume":"3","author":"S Floyd","year":"1995","unstructured":"Floyd, S., Jacobson, V.: Link-sharing and resource management models for packet networks. IEEE\/ACM Trans. Netw. 3(4), 365\u2013386 (1995). https:\/\/doi.org\/10.1109\/90.413212","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"Habibi Gharakheili, H., Sivaraman, V., Moors, T., Vishwanath, A., Matthews, J., Russell, C.: Enabling fast and slow lanes for content providers using software defined networking. IEEE\/ACM Trans. Netw. 25(3), 1373\u20131385 (2017). https:\/\/doi.org\/10.1109\/TNET.2016.2627005","DOI":"10.1109\/TNET.2016.2627005"},{"key":"20_CR16","unstructured":"Hemminger, S., et al.: Network emulation with NetEm. In: Linux Conference Au, pp. 18\u201323 (2005)"},{"key":"20_CR17","doi-asserted-by":"publisher","unstructured":"Iselt, A., Kirstadter, A., Pardigon, A., Schwabe, T.: Resilient routing using MPLS and ECMP. In: 2004 Workshop on High Performance Switching and Routing 2004. HPSR, pp. 345\u2013349, April 2004. https:\/\/doi.org\/10.1109\/HPSR.2004.1303507","DOI":"10.1109\/HPSR.2004.1303507"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Jain, S., et al.: B4: experience with a globally-deployed software defined WAN. SIGCOMM Comput. Commun. Rev. 43(4), 3\u201314 (2013). https:\/\/doi.org\/10.1145\/2534169.2486019, http:\/\/doi.acm.org\/10.1145\/2534169.2486019","DOI":"10.1145\/2534169.2486019"},{"key":"20_CR19","unstructured":"Jay, N., Rotman, N., Godfrey, B., Schapira, M., Tamar, A.: A deep reinforcement learning perspective on internet congestion control. In: International Conference Machine Learning, vol. 97, pp. 3050\u20133059, 09\u201315 June 2019. http:\/\/proceedings.mlr.press\/v97\/jay19a.html"},{"key":"20_CR20","doi-asserted-by":"publisher","unstructured":"Jin, X., et al.: Optimizing bulk transfers with software-defined optical WAN. In: SIGCOMM, pp. 87\u2013100 (2016). https:\/\/doi.org\/10.1145\/2934872.2934904, http:\/\/doi.acm.org\/10.1145\/2934872.2934904","DOI":"10.1145\/2934872.2934904"},{"key":"20_CR21","doi-asserted-by":"publisher","unstructured":"Kandula, S., Menache, I., Schwartz, R., Babbula, S.R.: Calendaring for wide area networks. In: SIGCOMM, pp. 515\u2013526 (2014). https:\/\/doi.org\/10.1145\/2619239.2626336, http:\/\/doi.acm.org\/10.1145\/2619239.2626336","DOI":"10.1145\/2619239.2626336"},{"key":"20_CR22","doi-asserted-by":"publisher","unstructured":"Kiran, M., Chhabra, A.: Understanding flows in high-speed scientific networks: a NetFlow data study. Future Gener. Comput. Syst. 94, 72\u201379 (2019). https:\/\/doi.org\/10.1016\/j.future.2018.11.006, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167739X18302322","DOI":"10.1016\/j.future.2018.11.006"},{"key":"20_CR23","doi-asserted-by":"publisher","unstructured":"Li, Y., Chang, K., Bel, O., Miller, E.L., Long, D.D.E.: CAPES: unsupervised storage performance tuning using neural network-based deep reinforcement learning. In: International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 42:1\u201342:14 (2017). https:\/\/doi.org\/10.1145\/3126908.3126951, http:\/\/doi.acm.org\/10.1145\/3126908.3126951","DOI":"10.1145\/3126908.3126951"},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"Mao, H., Alizadeh, M., Menache, I., Kandula, S.: Resource management with deep reinforcement learning. In: ACM Workshop on Hot Topics in Networks, pp. 50\u201356 (2016). https:\/\/doi.org\/10.1145\/3005745.3005750, http:\/\/doi.acm.org\/10.1145\/3005745.3005750","DOI":"10.1145\/3005745.3005750"},{"key":"20_CR25","unstructured":"Mortimer, M.: iPerf3 documentation (2018)"},{"key":"20_CR26","doi-asserted-by":"publisher","unstructured":"Munir, A., et al.: Minimizing flow completion times in data centers. In: IEEE INFOCOM, pp. 2157\u20132165, April 2013. https:\/\/doi.org\/10.1109\/INFCOM.2013.6567018","DOI":"10.1109\/INFCOM.2013.6567018"},{"issue":"12","key":"20_CR27","doi-asserted-by":"publisher","first-page":"2475","DOI":"10.1109\/LCOMM.2018.2872980","volume":"22","author":"M Noormohammadpour","year":"2018","unstructured":"Noormohammadpour, M., Srivastava, A., Raghavendra, C.S.: On minimizing the completion times of long flows over inter-datacenter WAN. IEEE Commun. Lett. 22(12), 2475\u20132478 (2018). https:\/\/doi.org\/10.1109\/LCOMM.2018.2872980","journal-title":"IEEE Commun. Lett."},{"key":"20_CR28","volume-title":"Wireshark & Ethereal Network Protocol Analyzer Toolkit","author":"A Orebaugh","year":"2006","unstructured":"Orebaugh, A., Ramirez, G., Beale, J.: Wireshark & Ethereal Network Protocol Analyzer Toolkit. Elsevier, Amsterdam (2006)"},{"key":"20_CR29","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D., et al.: Mastering the game of go with deep neural networks and tree search. Nature 529, 484 (2016). https:\/\/doi.org\/10.1038\/nature16961","journal-title":"Nature"},{"key":"20_CR30","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. A Bradford Book, USA (2018)"},{"key":"20_CR31","unstructured":"Tomar, M., Sathuluri, A., Ravindran, B.: MaMiC: macro and micro curriculum for robotic reinforcement learning. In: International Conference on Autonomous Agents and MultiAgent Systems, pp. 2226\u20132228 (2019). http:\/\/dl.acm.org\/citation.cfm?id=3306127.3332066"},{"key":"20_CR32","unstructured":"Trestian, R., Muntean, G., Katrinis, K.: MiceTrap: scalable traffic engineering of datacenter mice flows using OpenFlow, pp. 904\u2013907, May 2013"},{"key":"20_CR33","doi-asserted-by":"publisher","unstructured":"Valadarsky, A., Schapira, M., Shahaf, D., Tamar, A.: Learning to route. In: Hot Topics in Networks, pp. 185\u2013191 (2017). https:\/\/doi.org\/10.1145\/3152434.3152441, http:\/\/doi.acm.org\/10.1145\/3152434.3152441","DOI":"10.1145\/3152434.3152441"},{"issue":"1","key":"20_CR34","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TNSM.2016.2517087","volume":"13","author":"W Wang","year":"2016","unstructured":"Wang, W., Sun, Y., Salamatian, K., Li, Z.: Adaptive path isolation for elephant and mice flows by exploiting path diversity in datacenters. IEEE Trans. Netw. Serv. Manag. 13(1), 5\u201318 (2016). https:\/\/doi.org\/10.1109\/TNSM.2016.2517087","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"20_CR35","doi-asserted-by":"publisher","unstructured":"Wang, Z., Crowcroft, J.: Analysis of shortest-path routing algorithms in a dynamic network environment. SIGCOMM Comput. Commun. Rev. 22(2), 63\u201371 (1992). https:\/\/doi.org\/10.1145\/141800.141805, http:\/\/doi.acm.org\/10.1145\/141800.141805","DOI":"10.1145\/141800.141805"},{"key":"20_CR36","doi-asserted-by":"crossref","unstructured":"Winstein, K., Balakrishnan, H.: TCP ex machina: computer-generated congestion control. In: SIGCOMM, Hong Kong (2013)","DOI":"10.1145\/2486001.2486020"},{"key":"20_CR37","doi-asserted-by":"publisher","unstructured":"Xiao, J.: Learning affordance for autonomous driving. In: Workshop on Smart, Autonomous, and Connected Vehicular Systems and Services (2017). https:\/\/doi.org\/10.1145\/3131944.3133941, http:\/\/doi.acm.org\/10.1145\/3131944.3133941","DOI":"10.1145\/3131944.3133941"},{"key":"20_CR38","doi-asserted-by":"publisher","unstructured":"Yan, Z., Tracy, C., Veeraraghavan, M., Jin, T., Liu, Z.: A network management system for handling scientific data flows. J. Netw. Syst. Manag. 24(1), 1\u201333 (2016). https:\/\/doi.org\/10.1007\/s10922-014-9336-2, http:\/\/dx.doi.org\/10.1007\/s10922-014-9336-2","DOI":"10.1007\/s10922-014-9336-2"},{"key":"20_CR39","unstructured":"Zhu, C., Leung, H., Hu, S., Cai, Y.: A Q-values sharing framework for multiple independent Q-learners. In: International Conference on Autonomous Agents and MultiAgent Systems, pp. 2324\u20132326 (2019). http:\/\/dl.acm.org\/citation.cfm?id=3306127.3332099"}],"container-title":["Lecture Notes in Computer Science","Machine Learning for Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45778-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T01:04:36Z","timestamp":1709427876000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-45778-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030457778","9783030457785"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45778-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MLN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning for Networking","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mln2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.adda-association.org\/mln\/Home.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}