Proceedings Article10.1109/ICTTA.2008.4530209
FPFQ: A Low Complexity Fair Queueing Algorithm for Broadband Networks
H. Halabian,H. Saidi +1 more
- 07 Apr 2008
- pp 1-6
8
TL;DR: A traffic scheduling algorithm based on the RPS model called FPFQ is proposed, which reduces the system potential function complexity to O(l) while its fairness index is still comparable to that of SFPQ and WFQ.
read more
Abstract: A traffic scheduling algorithm based on the RPS model called FPFQ is proposed. In FPFQ, the result of finishing potentials sorting algorithm is used for recalibration of the system potential function. This reduces the system potential function complexity to O(1) while its fairness index is still comparable to that of SFPQ and WFQ. Analytical methods are invoked to show the effectiveness of FPFQ in terms of Delay bound and fairness index.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A survey on the chronological evolution of timestamp schedulers in packet switching networks
Yaser Miaji,Suhaidi Hassan +1 more
- 04 Dec 2009
TL;DR: This article will demonstrate chronologically how the attempts toward timestamp based scheduling in the packet-switch network have been evolved and will assist the researcher to distinguish the key failure of other proposed mechanisms which have not been implemented in real routers.
6
LVT-SCFQ: A Modified Self Clocked Fair Queueing Algorithm for Broadband Networks
H. Halabian,Hossein Saidi,R. Changiz +2 more
- 23 Nov 2008
TL;DR: A self-clocked traffic scheduling algorithm is proposed by modifying the virtual time function in the well known fair queueing algorithm, SCFQ, and it can be shown that by this modification, the fairness index and the packets worst case delay will remain bounded.
5
•Dissertation
Just Queuing: Policy-Based Scheduling Mechanism for Packet Switching Networks
Yaser Miaji
- 01 Jan 2011
TL;DR: This research adopts the restricted charge policy which imposes the protection of normal user in the scheduling mechanism by providing sustainability to the fairness and protection properties with simplicity in implementation; and hence higher service quality particularly for real-time applications.
5
Breaking the Legend: Maxmin Fairness notion is no longer effective
Yaser Miaji,Suhaidi Hassan +1 more
TL;DR: Analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for real time application and propose the notion of Maxmin-charge which fairly distribute the congestion.
3
Breaking the Legend: Maxmin Fairness notion is no longer effective
Yaser Miaji,Suhaidi Hassan +1 more
TL;DR: In this paper, the authors propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for real-time application, which adopts the disagreement approach be proposing the notion of Maxmin-charge which fairly distribute the congestion.
References
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case
Abhay Parekh,Robert G. Gallager +1 more
TL;DR: Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing (GPS) servers and the effectiveness of PGPS in guaranteeing worst-case session delay is demonstrated under certain assignments.
A self-clocked fair queueing scheme for broadband applications
S.J. Golestani
- 12 Jun 1994
TL;DR: The author proves that the scheme possesses the desired fairness property and is nearly optimal, in the sense that the maximum permissible disparity among the normalized services offered to the backlogged sessions is never more than two times the corresponding figure in any packet-based queueing system.
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Pawan Goyal,Harrick M. Vin,Haichen Chen +2 more
- 28 Aug 1996
TL;DR: Start-time Fair Queuing algorithm is presented that is computationally efficient, achieves fairness regardless of variation in a server capacity, and has the smallest fairness measure among all known fair scheduling algorithms.
VirtualClock: a new traffic control algorithm for packet-switched networks
TL;DR: A new algorithm is described, VirtualClock, for data traffic control in high-speed networks that maintains the statistical multiplexing flexibility of pocket switching while ensuring each data flow its reserved average throughput rate at the same time.
Hierarchical packet fair queueing algorithms
Jon C. R. Bennett,Hui Zhang +1 more
- 28 Aug 1996
TL;DR: It is demonstrated that, in order to provide tight delay bounds in a H-PFQ server, it is essential for the one-level PFQ servers to have small Worst-case Fair Indices (WFI).
513