Dynamic Resource Allocation of GPS Queues with Leaky Buckets

Simple item page
dc.contributor.advisorLa, Richard J.en_US
dc.contributor.authorTinnakornsrisuphap, Peerapolen_US
dc.contributor.authorVanichpun, Saruten_US
dc.contributor.authorLa, Richard J.en_US
dc.contributor.departmentISRen_US
dc.contributor.departmentCSHCNen_US
dc.date.accessioned2007-05-23T10:14:40Z
dc.date.available2007-05-23T10:14:40Z
dc.date.issued2003en_US
dc.description.abstractWe 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 in this paper. <p> Theoretically, the 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 the delay and dropped packets.en_US
dc.format.extent214889 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/6404
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 2003-48en_US
dc.relation.ispartofseriesCSHCN; TR 2003-24en_US
dc.subjectGlobal Communication Systemsen_US
dc.titleDynamic Resource Allocation of GPS Queues with Leaky Bucketsen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_2003-48.pdf
Size:
209.85 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports