loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth IEEE Symposium on Computers and Communications (ISCC'01)
QoS Using Delay-Synchronized Dynamic Priority Scheduling
Hammamet, Tunisia
July 03-July 05
ISBN: 0-7695-1177-5
Kannikar Siriwong, University of Conneticut
Reda Ammar, University of Conneticut
Abstract: Controlled-Load Service that provides acceptable quality of service to adaptive real-time applications without making absolute guarantee is extensively considered, owing to its higher resource utilization than Guaranteed Service. Enhancment of utilization strongly relies on traffic scheduling method, adaptable to varying traffic load, and admission control algorithms that do not depend on worst-case traffic behavior. In this paper, we propose a new scheduling scheme called Delay-Synchronized Dynamic Priority (DSDP), which exploits node synchronization of multi-hop network by dynamically altering priority of a packet to offset the deviation from its expected arrival time. Additionally, we develop a measurement-based admission control algorithm that uses existing traffic measurements under DSDP scheme for Controlled-load service.
Citation:
Kannikar Siriwong, Reda Ammar, "QoS Using Delay-Synchronized Dynamic Priority Scheduling," iscc, pp.0276, Sixth IEEE Symposium on Computers and Communications (ISCC'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.