Application of the generalised ballot theorem for evaluation of performance in packet buffers with non-first in first out scheduling

Packet scheduling is a vital component to support different classes of service in all-packet networks. In classical queuing systems, the waiting-time performance of non-first in first out buffer scheduling systems could be predicted through the use of analysis. However, all-packet networks feature t...

Full description

Saved in:
Bibliographic Details
Main Authors: Syed Ariffin, Sharifah Hafizah, Schormans, John A., Ma, A. H. I.
Format: Article
Published: Institution of Engineering and Technology 2009
Subjects:
Online Access:http://eprints.utm.my/id/eprint/13177/
http://dx.doi.org/10.1049/iet-com.2008.0062
Tags: Add Tag
No Tags, Be the first to tag this record!