Generating Function For Network Delay

In this paper correspondence between experimental data for packet delay and two theoretical types of distribution is investigated. Statistical tests have shown that only exponential distribution can be used for the description of packet delays in global network. Precision experimental data to within microseconds are gathered by means of the RIPE Test Box. Statistical verification of hypothesis has shown that distribution parameters remain constants during 500 second intervals at least. In paper cumulative distribution function and generating function for packet delay in network are in an explicit form written down, the algorithm of search of parameters of distribution is resulted.Comment: 5 pages, 4 Tables, 5 Figure

A two-level Markov model for packet loss in UDP/IP-based real-time video applications targeting residential users

The packet loss characteristics of Internet paths that include residential broadband links are not well understood, and there are no good models for their behaviour. This compli- cates the design of real-time video applications targeting home users, since it is difficult to choose appropriate error correction and concealment algorithms without a good model for the types of loss observed. Using measurements of residential broadband networks in the UK and Finland, we show that existing models for packet loss, such as the Gilbert model and simple hidden Markov models, do not effectively model the loss patterns seen in this environment. We present a new two-level Markov model for packet loss that can more accurately describe the characteristics of these links, and quantify the effectiveness of this model. We demonstrate that our new packet loss model allows for improved application design, by using it to model the performance of forward error correction on such links

Congestion Control using FEC for Conversational Multimedia Communication

In this paper, we propose a new rate control algorithm for conversational multimedia flows. In our approach, along with Real-time Transport Protocol (RTP) media packets, we propose sending redundant packets to probe for available bandwidth. These redundant packets are Forward Error Correction (FEC) encoded RTP packets. A straightforward interpretation is that if no losses occur, the sender can increase the sending rate to include the FEC bit rate, and in the case of losses due to congestion the redundant packets help in recovering the lost packets. We also show that by varying the FEC bit rate, the sender is able to conservatively or aggressively probe for available bandwidth. We evaluate our FEC-based Rate Adaptation (FBRA) algorithm in a network simulator and in the real-world and compare it to other congestion control algorithms