Jitter control in QoS networks

We study jitter control in networks with guaranteed quality of service (QoS) from the competitive analysis point of view: we propose on-line algorithms that control jitter and compare their performance to the best possible (by an off-line algorithm) for any given arrival sequence. For delay jitter, where the goal is to minimize the difference between delay times of different packets, we show that a simple on-line algorithm using a buffer of B slots guarantees the same delay jitter as the best off-line algorithm using buffer space B/2. We prove that the guarantees made by our on-line algorithm hold, even for simple distributed implementations, where the total buffer space is distributed along the path of the connection, provided that the input stream satisfies a certain simple property. For rate jitter, where the goal is to minimize the difference between inter-arrival times, we develop an on-line algorithm using a buffer of size 2B + h for any h ≥ 1, and compare its jitter to the jitter of an optimal off-line algorithm using buffer size B. We prove that our algorithm guarantees that the difference is bounded by a term proportional to B/h.

[1]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[2]  Lixia Zhang,et al.  A new architecture for packet switching network protocols , 1989 .

[3]  Srinivasan Keshav,et al.  Rate controlled servers for very high-speed networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[4]  S. Jamaloddin Golestani A Stop-and-Go Queueing Framework for Congestion Management , 1990, SIGCOMM.

[5]  Domenico Ferrari,et al.  Client requirements for real-time communication services , 1990, IEEE Communications Magazine.

[6]  Hui Zhang,et al.  Comparison of rate-based service disciplines , 1991, SIGCOMM '91.

[7]  ZhangHui,et al.  Comparison of rate-based service disciplines , 1991 .

[8]  Craig Partridge Isochronous applications do not require jitter-controlled networks , 1991, RFC.

[9]  D. Towsley,et al.  On per-session end-to-end delay distributions and the call admission problem for real-time applications with QOS requirements , 1993, SIGCOMM '93.

[10]  Domenico Ferrari,et al.  Rate-Controlled Service Disciplines , 1994, J. High Speed Networks.

[11]  Joseph Pasquale,et al.  Leave-in-Time: a new service discipline for real-time communications in a packet-switching network , 1995, SIGCOMM '95.

[12]  Hui Zhang,et al.  Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.

[13]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

[14]  Andrew S. Tanenbaum,et al.  Computer networks (3rd ed.) , 1996 .

[15]  Cheng-Shong Wu,et al.  Characterizing traffic behavior and providing end-to-end service guarantees within ATM networks , 1997, Proceedings of INFOCOM '97.

[16]  Rainer Händel,et al.  ATM Networks: Concepts, Protocols, Applications , 1998 .

[17]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .