Jun-July 2013 EDITION ANALYSIS OF DISTRIBUTED DELAY JITTER CONTROL IN QoS NETWORKS

We study jitter control in networks with guaranteed quality of service (QoS) from the competit ive analysis (as mentioned in [1]) point of view. we analyze on-line algorithms for single jitter regulator that control jitter and compare their performance to the best possible by an off-line algorithm as proposed in [1]. For delay jitter, where the goal is to min imize 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 (proposed in [1]) 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. The significance of the results is that it proves the on-line algorithm to be the best possible algorithm to reduce delay jitter fo r a given buffer size B. The main argue is even if both the distributed and non distributed algorithms get same jitter which one has more advantage. We focused on the advantages of distributing the buffers. The algorithm in its original fo rm is applicab le only to a fixed number of packets. We extend the results to a more practical model in which we compare off-line algorithm with n inputs and on-line algorithms with n1 (>n) inputs