.png){kind=icon}
.png){kind=icon}
Return
Generalized guaranteed rate scheduling algorithms: A framework
.png){kind=icon}
PRE
AI
DOI：10.1109/90.649514.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we define a class of generalized Guaranteed Rate (GR) scheduling algorithms that includes algorithms which allocate variable rate to packets of a how, We define work-conserving generalized Virtual Clock, Packet-by-Packet Generalized Processor Sharing, and Self-Clocked Fair Queuing scheduling algorithms that can allocate variable rate to the packets of a flow, We also define scheduling algorithms suitable for servers where packet fragmentation may occur, We demonstrate that if a class of rate controllers is employed for a how in conjunction with any scheduling algorithm in GR, then the resulting non-work-conserving algorithm also belongs to GR, This leads to the definition of several non-work-conserving algorithms. We then present a method for deriving the delay guarantee of a network of servers when: 1) different rates are allocated to packets of a flaw at different servers along the path and the bottleneck server for each packet may be different, and 2) packet fragmentation and/or reassembly may occur, This delay guarantee enables a network to provide various service guarantees to flows conforming to any specification, We illustrate this by utilizing delay guarantee to derive delay bounds for flows conforming to Leaky Bucket, Exponentially Bounded Burstiness, and Flow Specification. Our method for determining these bounds is valid in internetworks and leads to tighter results.
Keywords:
computer networks
packet scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
3.6
Papers:
4.4K
Citations:
9.5K
Organization
No organization information available