Scalability and QoS guarantee for streams with (m,k)-firm deadline

Authors:
Jiming Chen;Zhi Wang;Yeqiong Song;Youxian Sun
Affiliations:
National Laboratory of Industrial Control Technology Zhejiang University, Hangzhou 310027, P.R. China;National Laboratory of Industrial Control Technology Zhejiang University, Hangzhou 310027, P.R. China;LORIA-TRIO Campus Scientifique B.P.239 54506 VANDOEUVRE-lès-Nancy, France;National Laboratory of Industrial Control Technology Zhejiang University, Hangzhou 310027, P.R. China
Venue:
Computer Standards & Interfaces
Year:
2006

Citing 13
Cited 0

On per-session end-to-end delay distributions and the call admission problem for real-time applications with QOS requirements

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Performance analysis of reconstruction algorithms for packet voice communications

Computer Networks and ISDN Systems
Efficient support of delay and rate guarantees in an internet

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Statistical Real-Time Channels on Multiaccess Bus Networks

IEEE Transactions on Parallel and Distributed Systems
Weakly Hard Real-Time Systems

IEEE Transactions on Computers
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines

IEEE Transactions on Computers
DBP-M: A technique for meeting end-to-end \firm{m}{k} \\ guarantee requirements in point-to-point networks

LCN '97 Proceedings of the 22nd Annual IEEE Conference on Local Computer Networks
Dynamic Window-Constrained Scheduling for Multimedia Applications

ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
Adaptive real-time management of communication and computation resources

Adaptive real-time management of communication and computation resources
Dynamic class-based queue management for scalable media servers

Journal of Systems and Software
A calculus for network delay. I. Network elements in isolation

IEEE Transactions on Information Theory
Scalability and quality of service: a trade-off?

IEEE Communications Magazine
Best-effort scheduling of (m,k)-firm real-time streams in multihop networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Real-time media streams with (m,k)-firm are increasing and attractive as it proposes an alternative quality of service (QoS). In order to meet these ever increasing demands, the problem of scalability should be considered under limited resource. The problem is ignored in the existing solutions all along, because these solutions maintain a separate queue for each stream and per-stream state information. In this paper, we extend the work made in[Ji Ming Chen, Zhi Wang, Ye Qiong Song, and You Xian Sun. A scalable approach for streams with (m,k)-firm deadline. In Proceedings of IEEE Workshop on Quality of Service for Application Servers (2004 October)] and propose loss-rate balance (static) and stream number balance (dynamic) Class Selection Algorithm (CSA) for real-time media streams with (m,k)-firm, which is scalable while offering dynamic performance close to that of existing solutions. The effectiveness of static CSA (S-CSA) that captures the trade-off between scalability and QoS granularity is evaluated through extensive simulation studies. It is also shown that the S-CSA is as effective to guarantee QoS in terms of dynamic failure rate as the dynamic one.