By Topic

Dynamic resource allocation of GPS queues with leaky buckets

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
$31 $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

3 Author(s)
Tinnakomsrisuphap, P. ; Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD, USA ; Vanichpun, S. ; La, R.J.

We study the problem of dynamic resource allocation of a GPS server with two traffic classes when the leaky bucket scheme is employed as a traffic policing mechanism. Three popular input traffic models - independent Poisson arrival, autoregressive model, and partially observed traffic (hidden Markov model) - are investigated. Theoretically, optimal control can be obtained by a basic dynamic programming algorithm. However, such a solution is computationally prohibitive due to the curse of dimensionality. Instead, we propose several heuristic policies with improvements using rollout, parallel rollout, and hindsight optimization techniques under the aforementioned traffic models and show that these techniques can significantly reduce the penalty associated with delays and dropped packets.

Published in:

Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE  (Volume:7 )

Date of Conference:

1-5 Dec. 2003