DBP-M: a technique for meeting end-to-end (m, k)-firm guarantee requirement in point-to-point networks

A real time message stream is said to have an (m, k) firm guarantee requirement if at least m out of any k consecutive messages from the stream must meet their deadlines to ensure adequate quality of service. M. Hamdaoui and P. Ramanathan (1995) recently proposed a scheduling policy called Distance based Priority Assignment (DBP) to better service multiple real time streams, each with its own (m, k) firm guarantee requirement. The key assumption in the DBP technique is that all messages reach their destination in one hop. This assumption, however, is not valid in most networks because there is often no direct connection between the source and the destination nodes of a real time stream. The DBP scheme is extended to deal with streams in which the messages traverse more than one hop in reaching their destination. Through empirical evaluation, it is also shown that this extended DBP scheme, called DBP-M, performs better than existing policies in reducing the probability of not meeting the (m, k) firm guarantee requirement.

[1]  Ramesh Nagarajan.  Quality-of-service issues in high-speed networks , 1993 .

[2]  Jim Kurose,et al.  On per-session end-to-end delay distributions and the call admission problem for real-time applications with QOS requirements , 1993, SIGCOMM 1993.

[3]  Didier Le Gall,et al.  MPEG: a video compression standard for multimedia applications , 1991, CACM.

[4]  Ward Whitt,et al.  Characterizing Superposition Arrival Processes in Packet Multiplexers for Voice and Data , 1986, IEEE J. Sel. Areas Commun..

[5]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[6]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[7]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[8]  Roch Guérin,et al.  Efficient Support of Delay and Rate Guarantees in an Internet , 1996, SIGCOMM.

[9]  Chong Kwan Un,et al.  Performance Analysis of Reconstruction Algorithms for Packet Voice Communications , 1994, Comput. Networks ISDN Syst..

[10]  Kang G. Shin,et al.  On the ability of establishing real-time channels in point-to-point packet-switched networks , 1994, IEEE Trans. Commun..

[11]  Leonidas Georgiadis,et al.  Efficient support of delay and rate guarantees in an internet , 1996, SIGCOMM 1996.

[12]  Donald F. Towsley,et al.  Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service , 1988, JACM.

[13]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[14]  Parameswaran Ramanathan,et al.  A Dynamic Priority Assignement Technique for Streams with (m, k)-Firm Deadlines , 1995, IEEE Trans. Computers.

[15]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.