{"publication":"2021 IEEE 18th Annual Consumer Communications & Networking Conference (CCNC)","language":[{"iso":"eng"}],"ddc":["000"],"citation":{"short":"A. Hasnain, H. Karl, in: 2021 IEEE 18th Annual Consumer Communications & Networking Conference (CCNC), IEEE Computer Society, n.d.","ieee":"A. Hasnain and H. Karl, “Learning Flow Scheduling,” in 2021 IEEE 18th Annual Consumer Communications & Networking Conference (CCNC), Las Vegas, USA.","bibtex":"@inproceedings{Hasnain_Karl, title={Learning Flow Scheduling}, DOI={https://doi.org/10.1109/CCNC49032.2021.9369514}, booktitle={2021 IEEE 18th Annual Consumer Communications & Networking Conference (CCNC)}, publisher={IEEE Computer Society}, author={Hasnain, Asif and Karl, Holger} }","ama":"Hasnain A, Karl H. Learning Flow Scheduling. In: 2021 IEEE 18th Annual Consumer Communications & Networking Conference (CCNC). IEEE Computer Society. doi:https://doi.org/10.1109/CCNC49032.2021.9369514","chicago":"Hasnain, Asif, and Holger Karl. “Learning Flow Scheduling.” In 2021 IEEE 18th Annual Consumer Communications & Networking Conference (CCNC). IEEE Computer Society, n.d. https://doi.org/10.1109/CCNC49032.2021.9369514.","mla":"Hasnain, Asif, and Holger Karl. “Learning Flow Scheduling.” 2021 IEEE 18th Annual Consumer Communications & Networking Conference (CCNC), IEEE Computer Society, doi:https://doi.org/10.1109/CCNC49032.2021.9369514.","apa":"Hasnain, A., & Karl, H. (n.d.). Learning Flow Scheduling. In 2021 IEEE 18th Annual Consumer Communications & Networking Conference (CCNC). Las Vegas, USA: IEEE Computer Society. https://doi.org/10.1109/CCNC49032.2021.9369514"},"type":"conference","keyword":["Flow scheduling","Deadlines","Reinforcement learning"],"publisher":"IEEE Computer Society","user_id":"63288","year":"2021","status":"public","_id":"20125","abstract":[{"text":"Datacenter applications have different resource requirements from network and developing flow scheduling heuristics for every workload is practically infeasible. In this paper, we show that deep reinforcement learning (RL) can be used to efficiently learn flow scheduling policies for different workloads without manual feature engineering. Specifically, we present LFS, which learns to optimize a high-level performance objective, e.g., maximize the number of flow admissions while meeting the deadlines. The LFS scheduler is trained through deep RL to learn a scheduling policy on continuous online flow arrivals. The evaluation results show that the trained LFS scheduler admits 1.05x more flows than the greedy flow scheduling heuristics under varying network load.","lang":"eng"}],"conference":{"location":"Las Vegas, USA","name":"2021 IEEE 18th Annual Consumer Communications & Networking Conference (CCNC)","end_date":"2021-01-12","start_date":"2021-01-09"},"title":"Learning Flow Scheduling","date_updated":"2022-01-06T06:54:20Z","department":[{"_id":"75"}],"project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901","_id":"1"}],"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/9369514"}],"author":[{"full_name":"Hasnain, Asif","last_name":"Hasnain","first_name":"Asif","id":"63288"},{"full_name":"Karl, Holger","last_name":"Karl","id":"126","first_name":"Holger"}],"publication_status":"accepted","date_created":"2020-10-19T14:27:17Z","doi":"https://doi.org/10.1109/CCNC49032.2021.9369514"}