Non-preemptive coflow scheduling and routing

Ruozhou Yu, Guoliang Xue, Xiang Zhang, Jian Tang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

As more and more data-intensive applications have been moved to the cloud, the cloud network has become the new performance bottleneck for cloud applications. To boost application performance, the concept of coflow has been proposed to bring application-awareness into the cloud network. A coflow consists of many individual data flows, and a coflow is completed only when all its component flows are transmitted. The network performance of a cloud application is dependent on the completion time of coflows, rather than the completion time of each individual flow. Existing coflow-aware optimization solutions employ flow preemption to reduce the completion time, which brings difficulty in practical implementation and non-negligible overhead. In this paper, we study the non-preemptive coflow scheduling and routing problem in the cloud network. We propose an offline optimization framework for coflow scheduling, as well as two subroutines for coflow routing using single-path routing and multi-path routing respectively. We also show that our proposed framework is easily extensible to the online scenario. Extensive evaluations show that the proposed solutions can greatly reduce coflow completion time compared to coflow-agnostic solutions, and are also computationally efficient.

Original languageEnglish (US)
Title of host publication2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509013289
DOIs
StatePublished - Feb 2 2017
Event59th IEEE Global Communications Conference, GLOBECOM 2016 - Washington, United States
Duration: Dec 4 2016Dec 8 2016

Other

Other59th IEEE Global Communications Conference, GLOBECOM 2016
CountryUnited States
CityWashington
Period12/4/1612/8/16

Fingerprint

Scheduling
Subroutines
Network performance

Keywords

  • Coflow
  • Delay-awareness
  • Scheduling and routing

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Hardware and Architecture
  • Safety, Risk, Reliability and Quality

Cite this

Yu, R., Xue, G., Zhang, X., & Tang, J. (2017). Non-preemptive coflow scheduling and routing. In 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings [7842029] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GLOCOM.2016.7842029

Non-preemptive coflow scheduling and routing. / Yu, Ruozhou; Xue, Guoliang; Zhang, Xiang; Tang, Jian.

2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2017. 7842029.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yu, R, Xue, G, Zhang, X & Tang, J 2017, Non-preemptive coflow scheduling and routing. in 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings., 7842029, Institute of Electrical and Electronics Engineers Inc., 59th IEEE Global Communications Conference, GLOBECOM 2016, Washington, United States, 12/4/16. https://doi.org/10.1109/GLOCOM.2016.7842029
Yu R, Xue G, Zhang X, Tang J. Non-preemptive coflow scheduling and routing. In 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2017. 7842029 https://doi.org/10.1109/GLOCOM.2016.7842029
Yu, Ruozhou ; Xue, Guoliang ; Zhang, Xiang ; Tang, Jian. / Non-preemptive coflow scheduling and routing. 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2017.
@inproceedings{bf2306eaa74c41648644e37085a5efe5,
title = "Non-preemptive coflow scheduling and routing",
abstract = "As more and more data-intensive applications have been moved to the cloud, the cloud network has become the new performance bottleneck for cloud applications. To boost application performance, the concept of coflow has been proposed to bring application-awareness into the cloud network. A coflow consists of many individual data flows, and a coflow is completed only when all its component flows are transmitted. The network performance of a cloud application is dependent on the completion time of coflows, rather than the completion time of each individual flow. Existing coflow-aware optimization solutions employ flow preemption to reduce the completion time, which brings difficulty in practical implementation and non-negligible overhead. In this paper, we study the non-preemptive coflow scheduling and routing problem in the cloud network. We propose an offline optimization framework for coflow scheduling, as well as two subroutines for coflow routing using single-path routing and multi-path routing respectively. We also show that our proposed framework is easily extensible to the online scenario. Extensive evaluations show that the proposed solutions can greatly reduce coflow completion time compared to coflow-agnostic solutions, and are also computationally efficient.",
keywords = "Coflow, Delay-awareness, Scheduling and routing",
author = "Ruozhou Yu and Guoliang Xue and Xiang Zhang and Jian Tang",
year = "2017",
month = "2",
day = "2",
doi = "10.1109/GLOCOM.2016.7842029",
language = "English (US)",
booktitle = "2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Non-preemptive coflow scheduling and routing

AU - Yu, Ruozhou

AU - Xue, Guoliang

AU - Zhang, Xiang

AU - Tang, Jian

PY - 2017/2/2

Y1 - 2017/2/2

N2 - As more and more data-intensive applications have been moved to the cloud, the cloud network has become the new performance bottleneck for cloud applications. To boost application performance, the concept of coflow has been proposed to bring application-awareness into the cloud network. A coflow consists of many individual data flows, and a coflow is completed only when all its component flows are transmitted. The network performance of a cloud application is dependent on the completion time of coflows, rather than the completion time of each individual flow. Existing coflow-aware optimization solutions employ flow preemption to reduce the completion time, which brings difficulty in practical implementation and non-negligible overhead. In this paper, we study the non-preemptive coflow scheduling and routing problem in the cloud network. We propose an offline optimization framework for coflow scheduling, as well as two subroutines for coflow routing using single-path routing and multi-path routing respectively. We also show that our proposed framework is easily extensible to the online scenario. Extensive evaluations show that the proposed solutions can greatly reduce coflow completion time compared to coflow-agnostic solutions, and are also computationally efficient.

AB - As more and more data-intensive applications have been moved to the cloud, the cloud network has become the new performance bottleneck for cloud applications. To boost application performance, the concept of coflow has been proposed to bring application-awareness into the cloud network. A coflow consists of many individual data flows, and a coflow is completed only when all its component flows are transmitted. The network performance of a cloud application is dependent on the completion time of coflows, rather than the completion time of each individual flow. Existing coflow-aware optimization solutions employ flow preemption to reduce the completion time, which brings difficulty in practical implementation and non-negligible overhead. In this paper, we study the non-preemptive coflow scheduling and routing problem in the cloud network. We propose an offline optimization framework for coflow scheduling, as well as two subroutines for coflow routing using single-path routing and multi-path routing respectively. We also show that our proposed framework is easily extensible to the online scenario. Extensive evaluations show that the proposed solutions can greatly reduce coflow completion time compared to coflow-agnostic solutions, and are also computationally efficient.

KW - Coflow

KW - Delay-awareness

KW - Scheduling and routing

UR - http://www.scopus.com/inward/record.url?scp=85015420911&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015420911&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2016.7842029

DO - 10.1109/GLOCOM.2016.7842029

M3 - Conference contribution

BT - 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -