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...
Saved in:
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!
|
Similar Items
-
Efficient accelerated simulation technique for packet switched networks : a buffer with two priority inputs
by: Ariffin, Sharifah H. S., et al.
Published: (2004) -
Packet buffer management in wimax network
by: Etsu, Ishaya Iliya
Published: (2009) -
Analysis on the effect of first-in-first-out queue length ratio to the multi-hop wireless network performance
by: Ho, Peng Hou
Published: (2014) -
Enhanced buffer management policy and packet prioritization for wireless sensor network
by: Rabileh, A.A., et al.
Published: (2018) -
Enhanced buffer management policy and packet prioritization for wireless sensor network
by: Rabileh, A.A., et al.
Published: (2018)