By Topic

QoS using delay-synchronized dynamic priority scheduling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Siriwong, K. ; Dept. of Comput. Sci. & Eng., Connecticut Univ., Storrs, CT, USA ; Ammar, R.

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. Enhancement of utilization strongly relies on traffic scheduling method adaptable to a varying traffic load, and admission control algorithms that do not depend on worst-case traffic behavior. We propose a new scheduling scheme called delay-synchronized dynamic priority (DSDP), which exploits node synchronization of a multi-hop network by dynamically altering the 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 the DSDP scheme for controlled-load service

Published in:

Computers and Communications, 2001. Proceedings. Sixth IEEE Symposium on

Date of Conference:

2001