Miaji, Yaser and Hassan, Suhaidi (2009) Just queueing (JQ): Scheduling algorithm for the internet. In: First International Conference on Networks & Communications (NetCoM-2009), 27-29 December 2009, Le Royal Meridien,Chennai, India. IEEE Computer Society, pp. 161-165. ISBN 978-1-4244-5364-1

PDF Restricted to Repository staff only Download (125kB)

Abstract

Fairness in packets scheduling in routers is a fundamental objective for designing a scheduler. The magnificent WFQ, which approximate GPS to a distinctive level of accuracy, attempts to allocate the bandwidth fairly among the flows according to Maxmin principle and to source-destination fashion. Nevertheless,referring to Rawls’ method for theory of justice, “rank alternatives to the worst possible outcome”, could be inferred as the distribution of the congestion, in case of its incidence, rather than the fairness. This article reveals the discussion in displacing scholars’ attention from bandwidth allocation to distribution of the congestion or the charge. It introduces the conceptual framework of just queuing (JQ) principle.

Item Type:	Book Section
Uncontrolled Keywords:	Queueing algorithm , Scheduling mechanism , WFQ
Subjects:	T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions:	College of Arts and Sciences
Depositing User:	Prof. Ts. Dr. Suhaidi Hassan
Date Deposited:	20 Feb 2011 01:04
Last Modified:	20 Feb 2011 01:04
URI:	https://repo.uum.edu.my/id/eprint/2147

Actions (login required)

View Item