QoS using delay-synchronized dynamic priority scheduling

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