By Topic

Queueing processes in GPS and PGPS with LRD traffic inputs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xiang Yu ; Dept. of Comput. Sci. & Eng., State Univ. of New York, USA ; I. L. -J. Thng ; Yuming Jiang ; Chunming Qiao

Long range dependent (LRD) traffic whose single server queue process is Weibull Bounded (WB) is first analyzed. Two upper bounds on the individual session's queue length of LRD traffic under the generalized processor sharing (GPS) scheduling discipline are then contributed. It is shown that the index parameter in the upper bound of one LRD flow, (in addition to the decay rate and the asymptotic constant), may be affected by other LRD flows. A new concept, called LRD isolation, is subsequently contributed and accompanying it, a new technique is contributed to check whether a flow, with a given GPS weight assignment, can be guaranteed to be LRD isolated. This technique is also amenable for use in an online call admission control (CAC) scenario. When existing flows have already been assigned contract weights that cannot be changed, our technique can be used to determine minimum contract weights to be assigned to a new flow in order to guarantee the flow to be LRD isolated. The results are also extended to a PGPS (packet-based GPS) scheduler and relevant numerical results are provided to show the usefulness of our bounds and LRD isolation technique.

Published in:

IEEE/ACM Transactions on Networking  (Volume:13 ,  Issue: 3 )