Work Conserving Scheduler with Global Finish Time for Network Latency Guarantee 


Vol. 48,  No. 1, pp. 55-64, Jan.  2023
10.7840/kics.2023.48.1.55


PDF
  Abstract

Guaranteeing end-to-end network latency bounds is required in many applications. Ideally, the flows should be protected in separate queues against the burst accumulation. Means to provide per-flow performance without maintaining flow states have been suggested in the literature. The global finish time, which is the essential of the packet state, is derived at the entering node of a flow, and then recorded as a meta-data to a packet, retrieved at the downstream nodes. The global finish time is usually modified according to the current state of the downstream nodes. In this work, we suggest a simple method that approximates the current flow state with the global finish time. The suggested method has the property that the service order of all the packets having the same path does not change during the path. By this property the problem of finding the minimum finish order has become much simpler, with a FIFO queue per input port and a HoQ examiner. It is proved that the proposed scheduler is a packetized rate-proportional server, therefore enjoys much better latency upper bounds and the improved scalability.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Related Articles
  Cite this article

[IEEE Style]

J. Joung, "Work Conserving Scheduler with Global Finish Time for Network Latency Guarantee," The Journal of Korean Institute of Communications and Information Sciences, vol. 48, no. 1, pp. 55-64, 2023. DOI: 10.7840/kics.2023.48.1.55.

[ACM Style]

Jinoo Joung. 2023. Work Conserving Scheduler with Global Finish Time for Network Latency Guarantee. The Journal of Korean Institute of Communications and Information Sciences, 48, 1, (2023), 55-64. DOI: 10.7840/kics.2023.48.1.55.

[KICS Style]

Jinoo Joung, "Work Conserving Scheduler with Global Finish Time for Network Latency Guarantee," The Journal of Korean Institute of Communications and Information Sciences, vol. 48, no. 1, pp. 55-64, 1. 2023. (https://doi.org/10.7840/kics.2023.48.1.55)
Vol. 48, No. 1 Index

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880