Title
On G-Networks And Resource Allocation In Multimedia Systems
Abstract
Consider a multimedia-on-demand server who transmits video documents through a high-speed network, to geographically distributed clients. The server accumulates-requests for specific documents in separate queues. The queues need to share the transmission medium in some fashion, typically in Round-Robin (RR) mode. We describe the resulting performance modeling problem, and develop an approximate representation using queuing networks. Our analytic model enables the efficient implementation of a new scheduling scheme, that we call the Local Round-Robin (LRR). We show that LRR yields significant improvement in system performance, compared to the original RR.
Publication Date
10-16-2000
Publication Title
European Journal of Operational Research
Volume
126
Issue
2
Number of Pages
308-318
Document Type
Article
Personal Identifier
scopus
DOI Link
https://doi.org/10.1016/S0377-2217(99)00480-4
Copyright Status
Unknown
Socpus ID
0034675405 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/0034675405
STARS Citation
Gelenbe, Erol and Shachnai, Hadas, "On G-Networks And Resource Allocation In Multimedia Systems" (2000). Scopus Export 2000s. 766.
https://stars.library.ucf.edu/scopus2000/766