### Citations

2008 | A generalized processor sharing approach to flow control in integrated services networks: the multiple node case
- Parekh, Gallager
- 1994
(Show Context)
Citation Context ... bits transmitted until a given instant t, by its reference behavior under corresponding GPS model, refer figure 1. Notice that the s scheme server services the packets from session i during interval =-=[1,2]-=- and [4,6] whereas for intervals [0,1] and [2,4], there is no service offered to the session hence the work progress curve's slope equals to 0. We mean, by Work Progress Estimation (WPE), calculating ... |

191 | Start-time fair queuing: A scheduling algorithm for integrated services packet switching networks.
- Goyal, Vin, et al.
- 1997
(Show Context)
Citation Context ...smitted until a given instant t, by its reference behavior under corresponding GPS model, refer figure 1. Notice that the s scheme server services the packets from session i during interval [1,2] and =-=[4,6]-=- whereas for intervals [0,1] and [2,4], there is no service offered to the session hence the work progress curve's slope equals to 0. We mean, by Work Progress Estimation (WPE), calculating the sessio... |

131 |
A self-clocked fair queuing scheme for broadband applications.
- Golestani
- 1994
(Show Context)
Citation Context ...bki;s (2) where T is an interval sufficient enough to transmit fully the packet k and is given by T = L k ir . scheme delay fairness complexity virtual t over all WFQ [1] optimal factor 2 - O(N) SCFQ =-=[7]-=- f(N) factor 2 O(1) O(logN) SFQ [6] f(N) factor ^ 2 O(1) O(logN) FFQ [2] optimal factor * 3 O(1) O(logN) LFVC [8] optimal factor 8 O(1) O(logN) W F 2Q [4] optimal optimal - O(N) W F 2Q+ [5] optimal op... |

67 |
Hierarchical Packet Fair Queuing Algorithms.
- Bennett, Zhang
- 1996
(Show Context)
Citation Context ..., 35042, France. Campus de Beaulieu, 35042, France. Abstract Scheduling schemes are judged on three important properties: delay bound, fairness and complexity. Recently proposed queue service schemes =-=[4, 5]-=- though guarantee an optimal delay bound and an optimal fairness to a connection but are still delicate in implementation [3]. We propose a new scheduling scheme which works on two novel ideas: 1) wor... |

17 |
Design and Analysis of Frame-Based Fair Queuing: A New Traffic Scheduling Algorithm for Packet Switched Networks
- Stiliadis, Varma
- 1996
(Show Context)
Citation Context ... bits transmitted until a given instant t, by its reference behavior under corresponding GPS model, refer figure 1. Notice that the s scheme server services the packets from session i during interval =-=[1,2]-=- and [4,6] whereas for intervals [0,1] and [2,4], there is no service offered to the session hence the work progress curve's slope equals to 0. We mean, by Work Progress Estimation (WPE), calculating ... |

12 | Leap forward virtual clock: An O(log log N) fair queuing scheme with guaranteed delays and throughput fairness
- Suri, Varghese, et al.
- 1996
(Show Context)
Citation Context ...heme delay fairness complexity virtual t over all WFQ [1] optimal factor 2 - O(N) SCFQ [7] f(N) factor 2 O(1) O(logN) SFQ [6] f(N) factor ^ 2 O(1) O(logN) FFQ [2] optimal factor * 3 O(1) O(logN) LFVC =-=[8]-=- optimal factor 8 O(1) O(logN) W F 2Q [4] optimal optimal - O(N) W F 2Q+ [5] optimal optimal O(logN) O(logN) Table 2: Characteristics of queue service schemes During interval bki;GP S ^ t ^ dki;GP S (... |

1 |
Gestion premtive et quitable de la qualit de service dans les rseaux de paquets intgration de services (Preemptive and fair QoS management in integrated services packet switched networks
- Toutain
- 1997
(Show Context)
Citation Context ...bound, fairness and complexity. Recently proposed queue service schemes [4, 5] though guarantee an optimal delay bound and an optimal fairness to a connection but are still delicate in implementation =-=[3]-=-. We propose a new scheduling scheme which works on two novel ideas: 1) work-based packet tags rather than service finish (or start) time-based tags, 2) session associated virtual time function which ... |