loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th IEEE Symposium on Computers and Communications (ISCC'05)
Some Schedulers to Achieve Proportional Junk Rate Differentiation
Cartagena, Murcia, Spain
June 27-June 30
ISBN: 0-7695-2373-0
Yuan-Cheng Lai, National Taiwan University of Science and Technology
Arthur Chang, National Taiwan University of Science and Technology
The queueing delay or loss rate is usually used as the performance metric for the real-time multimedia applications. In this paper, to provide more suitable quality of services (QoS) requirements of some applications, we propose a new performance metric, junk rate, where junk is the packet which queueing delay exceeds its time threshold. The model of proportional junk rate differentiation is also constructed to provide the predictable and controllable ratio of junk rates for different classes. Three schedulers, namely, proportional junk rate scheduler with infinite memory, proportional junk rate scheduler with memory M, average junk distance scheduler, are proposed to achieve this model. Simulation results show that three schedulers actually yield this model well.
Citation:
Yuan-Cheng Lai, Arthur Chang, "Some Schedulers to Achieve Proportional Junk Rate Differentiation," iscc, pp.907-912, 10th IEEE Symposium on Computers and Communications (ISCC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.