Effective bandwidths at multi-class queues | Zendy

F. P. Kelly | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Effective bandwidths at multi-class queues

Author(s) -

F. P. Kelly

Publication year - 1991

Publication title -

queueing systems

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.426

H-Index - 54

eISSN - 1572-9443

pISSN - 0257-0130

DOI - 10.1007/bf01158789

Subject(s) - queue , computer science , limiting , bandwidth (computing) , queueing theory , fork–join queue , mathematical optimization , computer network , queue management system , mathematics , engineering , mechanical engineering

Consider a queue which serves traffic from a number of distinct sources and which is required to deliver a performance guarantee, expressed in terms of the mean delay or the probability the delay exceeds a thresh- old. For various simple models we show that an effective bandwidth can be associated with each source, and that the queue can deliver its performance guarantee by limiting the sources served so that their effective bandwidths sum to less than the capacity of the queue.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research