Fair queueing with service envelopes (FQSE): a cousin-fair hierarchical scheduler for subscriber access networks

Authors:
G. Kramer;A. Banerjee;N. K. Singhal;B. Mukherjee;Sudhir Dixit;Yinghua Ye
Affiliations:
Univ. of California, Davis, CA, USA;-;-;-;-;-
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2006

Citing 0
Cited 6

Analytical and experimental study on Ethernet passive optical networks: challenges and solutions

International Journal of Communication Networks and Distributed Systems
A fair scheduling discipline for Ethernet passive optical networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Active scheduling algorithm for intra-ONU dynamic bandwidth allocation in ethernet passive optical networks

ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
User-oriented hierarchical bandwidth scheduling for ethernet passive optical networks

Computer Communications
A fitting report position scheme for the gated IPACT dynamic bandwidth algorithm in EPONs

IEEE/ACM Transactions on Networking (TON)
Shortest propagation delay (SPD) first scheduling for EPONs with heterogeneous propagation delays

IEEE Journal on Selected Areas in Communications - Special issue on next-generation broadband optical access network technologies

Quantified Score

Hi-index	0.07

Visualization

Abstract

In this paper, we propose and investigate the characteristics of a fair queueing with service envelopes (FQSE) algorithm-a hierarchical fair-share scheduling algorithm for access networks based on a remote scheduling system such as Ethernet passive optical networks (EPON) or cable TV network. FQSE is designed to overcome the limiting factors of a typical remote scheduling system such as large control-plane delay, limited control-plane bandwidth, and significant queue switch-over overhead. The algorithm is based on a concept of service envelope-a function representing the fair allocation of resources based on a global network condition called satisfiability parameter (SP). We define properties of cousin-fairness and sibling-fairness and show the FQSE to be cousin-fair. FQSE is unique in that it is the only hierarchical algorithm that is simultaneously cousin-fair. Furthermore, we show the necessary techniques to adapt FQSE to variable-sized packet-based networks. We analyze FQSE performance in EPON serving 1024 independent queues and demonstrate FQSE's ability to provide guaranteed bandwidth to each queue and to share the excess bandwidth fairly.