Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

DPDSN: data plane deadline-sensitive scheduling in data center networks

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

Many existing works are focused on minimizing the Flow Completion Time (FCT) for data center networks. For example, D-SRTF performs shortest remaining time first (SRTF) scheduling and determines the remaining time according to the estimated remaining flow size and the available bandwidth. D-SRTF mimics the remaining flow size utilizing bytes sent of each flow. However, the flow size is unknown for many application, using the statistics information of the bytes sent to mimic the remaining time of flow is an approximate estimation which is not accurate; Besides, the flow-level fine-grained scheduling schemes will determine priorities according to different stages in lifetime of the flow, which will lead to larger delay jitter. Moreover, traditional schemes are deployed at the terminal which cannot perceive the network status in time. In this paper, we propose DPDSN, a deadline-sensitive priority-based queue scheduling scheme based on programmable data plane for data center networks. DPDSN implements a distributed scheduling scheme inside the network, which has better awareness of network status; Furthermore, DPDSN performs an urgency-sensitive priority-based queue scheduling mechanism under the deadline. According to the elapsed transmission time of packets, the urgency, which represents the average remaining time under the deadline on each remaining switch along the packet forwarding path, is calculated at each switch. DPDSN achieves a kind of packet-level fine-grained control mechanism, which can greatly reduce the network delay jitter compared with the existing works. Extensive simulations on Mininet show that DPDSN outperforms the currently best implementable scheme which is flow-level fine-grained in terms of average FCT, jitter and deadline miss ratio.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Nasrallah A, Thyagaturu AS, Alharbi Z et al (2018) Ultra-low latency (ULL) networks: The IEEE TSN and IETF DetNet standards and related 5G ULL research[J]. IEEE Commun Surv Tutor 21(1):88–145

    Article  Google Scholar 

  2. Perry J, Ousterhout A, Balakrishnan H et al (2014) Fastpass: a centralized zero-queue datacenter network.   Proceedings of the ACM conference on SIGCOMM 2014:307–318

    Google Scholar 

  3. Alizadeh M, Yang S, Sharif M et al (2013) pfabric: Minimal near-optimal datacenter transport. ACM SIGCOMM Comp Commun Rev 43(4):435–446

    Article  Google Scholar 

  4. Mittal R, Agarwal R, Ratnasamy S et al (2016) Universal packet scheduling 13th {USENIX} Symposium on Networked Systems Design and Implementation {NSDI} 16:501–521.

  5. Bai W, Chen L, Chen K et al (2015) Information-agnostic flow scheduling for commodity data centers12th {USENIX}. Symposium on Networked Systems Design and Implementation ({NSDI}) 15:455–468.

  6. Gao C, Lee V, Li K (2018) D-SRTF: Distributed shortest remaining time first scheduling for data center networks. IEEE Trans Cloud Comput

  7. Alizadeh M, Greenberg A, Maltz DA et al (2010) Data center tcp (dctcp)[C].  Proceedings of the ACM SIGCOMM Conference 2010:63–74

    Article  Google Scholar 

  8. Wang T, Xu H, Liu F (2017) Aemon: Information-agnostic mix-flow scheduling in data center networks. Proceedings of the First Asia-Pacific Workshop on Networking 106–112

  9. The P4 (2020) org Applications Working Group. In-band network telemetry (INT) dataplane specification version 2.1. https://github.com/p4lang/p4-applications/blob/master/docs/INTlatest.pdf

  10. Bifulco R, Rétvári G (2018) A survey on the programmable data plane: Abstractions, architectures, and open problems. IEEE 19th International Conference on High Performance Switching and Routing (HPSR). IEEE 1–7

  11. Qian Y, Lu Z, Dou Q (2010) Qos scheduling for nocs: Strict priority queueing versus weighted round robin. IEEE International Conference on Computer Design. IEEE 52–59

  12. Mustafa MEG, Talab SA (2016) The effect of queuing mechanisms first in first out (FIFO), priority queuing (PQ) and weighted fair queuing (WFQ) on network’s routers and applications. Wirel Sens Netw 8(05):77

    Article  Google Scholar 

  13. Li Z, Wan H, Deng Y et al (2018) Time-triggered switch-memory-switch architecture for time-sensitive networking switches. IEEE Trans Comput Aided Des Integr Circuits Syst 39(1):185–198

    Article  Google Scholar 

  14. McKeown N, Anderson T, Balakrishnan H et al (2008) OpenFlow: enabling innovation in campus networks. ACM SIGCOMM Comp Commun Rev 38(2):69–74

    Article  Google Scholar 

  15. Kogan K et al (2020) Towards Software-Defined Buffer Management. IEEE/ACM Trans Networking 28(5):2337–2349

    Article  Google Scholar 

  16. Abbou AN, Taleb T, Song J (2021) A software-defined queuing framework for QoS provisioning in 5G and beyond mobile systems. IEEE Netw 35(2):168–173

    Article  Google Scholar 

  17. Anirudh Sivaraman et al (2016) Programmable Packet Scheduling at Line Rate. SIGCOMM

  18. Naveen Kr, Sharma et al (2020) Programmable calendar queues for high-speed packet scheduling. NSDI’20.

  19. Albert Gran Alcoz et al (2020) SP-PIFO: approximating push-in first-out behaviors using strict-priority queues. NSDI’20.

  20. Yu Z, Hu C, Wu J et al (2021) Programmable packet scheduling with a single queue[C]//Proceedings of the 2021 ACM SIGCOMM. Conference 2021:179–193

    Google Scholar 

  21. Wang W, Casale G (2014) Evaluating weighted round robin load balancing for cloud web services. 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. IEEE 393–400.

  22. Wijnen B, Harrington D, Presuhn R (1997) An architecture for describing SNMP management frameworks. RFC 

  23. Tan L, Su W, Zhang W et al (2021) In-band network telemetry: a survey. Comp Netw 186:107763

  24. Sheng S, Huang Q, Lee PPC (2021) DeltaINT: Toward general in-band network telemetry with extremely low bandwidth overhead. IEEE 29th International Conference on Network Protocols (ICNP). IEEE 1–11.

  25. Chowdhury M, Stoica I (2015) Efficient coflow scheduling without prior knowledge[J]. ACM SIGCOMM Comp Commun Rev 45(4):393–406

    Article  Google Scholar 

  26. Lantz B, Heller B, Mckeown N (2010) A network in a laptop: rapid prototyping for software-defined networks. ACM Sigcomm Hotnets Workshop

  27. Hopps C (2000) Analysis of an equal-cost multi-path algorithm. RFC 2992

Download references

Funding

This work was supported in part funded by China Postdoctoral Science Foundation under Grant 2021M702984, in part by the National Key R&D Program of China under Grant 2019YFB1804303.

Author information

Authors and Affiliations

  1. State Key Laboratory of Media Convergence and Communication, Communication University of China, Beijing, China

    Junjie Geng

Authors
  1. Junjie Geng
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

Junjie Geng performed the modelling analyses of the approach, the experiment using Mininet software, and wrote the manuscript. The author read and approved the manuscript.

Corresponding author

Correspondence to Junjie Geng.

Ethics declarations

Ethics approval

Not applicable.

Consent to participate

Not applicable.

Consent for publication

The manuscript is approved by all authors for publication; all the authors listed have approved the manuscript that is enclosed.

Conflicts of interest

The author declares no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This article is part of the Topical Collection: New Intelligent Manufacturing Technologies through the Integration of Industry 4.0 and Advanced Manufacturing

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Geng, J. DPDSN: data plane deadline-sensitive scheduling in data center networks. Int J Adv Manuf Technol 122, 173–183 (2022). https://doi.org/10.1007/s00170-022-09223-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-022-09223-y

Keywords