Guaranteed dynamic priority assignment scheme for streams with (m, k)-firm deadlines

摘要

A guaranteed dynamic priority assignment scheme for multiple realtime streams with (m, k)-firm deadlines is presented. Analytical and experimental studies show that the proposed scheme provides assurance of timeliness performance and relatively high quality of service compared to existing schemes.