Академический Документы
Профессиональный Документы
Культура Документы
04/15/02
Packet scheduling is necessary when multiple packets compete for a common outgoing link
04/15/02 Guansong Zhang Page 3
Switch Fabric
04/15/02
04/15/02
Guansong Zhang
Page 6
non-work-conserving
04/15/02
Guansong Zhang
Page 7
Frame-based
04/15/02
Generalized processor sharing (GPS) Weighted fair queueing (P-GPS) Virtual clock Self-clocked fair queueing
04/15/02 Guansong Zhang Page 9
Round-robin Schedulers
Basic scheme: serve all backlogged sessions in a round-robin fashion Weighted round-robin (fixed-length packets):
Time is divided into frames Each sessions is assigned a weight in terms of number of packets that could be served during a frame A counter is maintained for each session to record the number of packets that have been served during the current frame Each session is assigned a weight in terms of number of bits (or bytes)
Guansong Zhang Page 10
04/15/02
GPS is an ideal scheduling discipline with respect to a fluid-model: The minimum service that a connection can receive in any interval of time is:
04/15/02 Guansong Zhang Page 11
Maintaining V(t) requires a GPS system is simulated in parallel with the WFQ scheduler The timestamp TSi associated with the k-th packet arriving at t of flow i is calculated as:
04/15/02
Guansong Zhang
Page 12
VC achieves worst-case delay for a leaky-bucket controlled session comparable to WFQ However, VC can not bound short-term unfairness
04/15/02 Guansong Zhang Page 13
Latency-Rate Servers
LR-server defines a general class of schedulers Each specific scheduler S that belongs to LRserver is only characterized by a parameter S, named latency LR-server provides a convenient way to analyze the worst-case behaviors, such as delay, buffer requirement, and internal burstiness in an arbitrary topology network where a broad range of schedulers are employed.
04/15/02
Guansong Zhang
Page 15
C B F D
A i
04/15/02
Guansong Zhang
Page 16
Definition of LR-Servers
Assumption:
Non-cut-through server Ai(, t) and Wi(, t) are increased only when the last bit of a packet arrives/leaves the server
System busy period: a maximal interval of time during which the server is never idle Backlogged period for session i: any period of time during which packets belonging to that session are continuously queued in the system
Define Qi(t) = Ai(0, t) Wi(0,t)
04/15/02
Guansong Zhang
Page 17
Definition of LR-Servers
Session i busy period: a maximal interval of time (1,2] such that for any time t(1,2], Ai(1,t) i(t- 1)
Note that a session busy period is only related to the arrival traffic and allocated rate This definition facilitates LR-servers to be able to analyze a broad range of schedulers
04/15/02
Guansong Zhang
Page 18
Definition of LR-Servers
A server S belongs in the class LR if and only if all times t after time that the jth busy period of session i started and until the packets that arrived during this period are serviced,
S S W i , j ( , t ) max(0, i (t i )) iS is the minimum non-negative number that satisfies the above inequality The right-hand side of the above equation defines an envelope to bound the minimum service offered to session i during a busy period
04/15/02 Guansong Zhang Page 19
04/15/02
Guansong Zhang
Page 20
04/15/02
Page 21
04/15/02
Guansong Zhang
Page 22
It is interesting to notice that the results from a series of LR servers is the same as that from a single LR server with a latency that equals to the sum of the formers
04/15/02 Guansong Zhang Page 23
Fairness of LR Servers
Normalized service: Wi(,t)/i A scheduler is perfectly fair if, For a packetized scheduler, it is close to fair if, This definition originated from SCFQ paper
04/15/02 Guansong Zhang
Page 24
04/15/02
Guansong Zhang
Page 26
Bounded fairness (comparable to SCFQ) Introduce another class of schedulers, named Rate Proportional Server (RPS)
Latency comparable to WFQ
04/15/02 Guansong Zhang Page 27
Pi(t) increases exactly by the normalized service session i received when it is backlogged
Pi(t) Pi() = Wi(t, ) / i
04/15/02
Guansong Zhang
Page 28
04/15/02
Guansong Zhang
Page 29
An Interesting Illustration
04/15/02
Guansong Zhang
Page 31
Page 33
04/15/02
Guansong Zhang
Page 34
04/15/02
Guansong Zhang
Page 36
04/15/02
Guansong Zhang
Page 37
04/15/02
Guansong Zhang
Page 39
Ci is defined as,
04/15/02
Guansong Zhang
Page 40
The above constraint can be satisfied by the use of a re-calibration mechanism periodically to bound the maximum difference between P(t) and Pi(t)
04/15/02 Guansong Zhang Page 41
A finite constant P can be found such that: P(t) Pi(t) P, for any iB(t)
Any RPS server can achieve bounded fairness by periodically re-calibrating the system potential using the base potential function, if the interval between re-calibration is bounded
04/15/02 Guansong Zhang Page 42
Construction of FRPS
During a system-busy period, the function P(t) is a piecewise linear function of time t At time 0< 1< < k, the system potential is updated as: At any time t between update, The interval between updates is bounded,
j+1 - j T P(t) = P(j) + (t- j), j<t<j+1 P(j) = max( P(j-), SP(j) )
04/15/02
Guansong Zhang
Page 43
Properties of SPFQ
Fairness of SPFQ, comparable to WFQ
According to the definition of SSPFQ(t), the complexity for system potential updating is O(logV), which is fine since at least O(logV) is necessary to do departure selection
04/15/02
Guansong Zhang
Page 45
Introduce another fairness measurement, named worst-case fair index (WFI) E.g. shaped VirtualClock & shaped SPFQ
04/15/02
Page 46
Reference
[1] D. Stiliadis and A. Varma, "Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms" in IEEE/ACM Transactions on Networking, October 1998 [2] D. Stiliadis and A. Varma, Rate Proportional Servers: A Design Methodology for Fair Queueing Algorithms," in IEEE/ACM Transactions on Networking, April 1998 [3] D. Stiliadis and A. Varma, ``Efficient Fair Queueing Algorithms for Packet Switched Networks," in IEEE/ACM Transactions on Networking, April 1998 [4] A. K. Parekh and R. G. Gallager A generalized processor sharing approach to flow control: the single node case, in Proc. of IEEE INFOCOM, May 1992 [5] L. Zhang, Virtual clock: a new traffic control algorithm for packet switching networks, in Proc. ACM SIGCOMM, Sep 1990
04/15/02
Guansong Zhang
Page 47
Reference (contd)
S. Golestani A selfclocked fair queueing scheme for broadband applications, in Proceedings of IEEE INFOCOM, April 1994 M. Shreedhar and G. Varghese Ecient fair queueing using deficit round robin, in Proceedings of ACM SIGCOMM, Sep 1995 J. C. R. Bennett and H. Zhang, WF2Q: worst-case fair weighted fair queueing, in Proceeding of IEEE INFOCOM, Mar, 1996 J. C. R. Bennett and H. Zhang, Hierarchical packet fair queueing algorithms, in IEEE/ACM Tran. on Networking, Oct 1997 D. Stiliadis and A. Varma, A general methodology for design efficient traffic scheduling and shaping algorithms, in Proc. IEEE INFOCOM, Apr 1997 F. M. Chiussi and A. Francini, A distributed scheduling architecture for scalable packet switches, in IEEE JSAC, Dec 2000
04/15/02
Guansong Zhang
Page 48
49