Intelligent packet discarding policies for real-time traffic over wireless networks.

Yuen Ching Wan.Thesis (M.Phil.)--Chinese University of Hong Kong, 2006.Includes bibliographical references (leaves 77-83).Abstracts in English and Chinese.Abstract --- p.iAcknowledgement --- p.iiiChapter 1 --- Introduction --- p.1Chapter 1.1 --- Nature of Real-Time Traffic --- p.1Chapter 1.2 --- Delay Variability in Wireless Networks --- p.2Chapter 1.2.1 --- Propagation Medium --- p.3Chapter 1.2.2 --- Impacts of Network Designs --- p.5Chapter 1.3 --- The Keys - Packet Lifetime & Channel State --- p.8Chapter 1.4 --- Contributions of the Thesis --- p.8Chapter 1.5 --- Organization of the Thesis --- p.9Chapter 2 --- Background Study --- p.11Chapter 2.1 --- Packet Scheduling --- p.12Chapter 2.2 --- Call Admission Control (CAC) --- p.12Chapter 2.3 --- Active Queue Management (AQM) --- p.13Chapter 2.3.1 --- AQM for Wired Network --- p.14Chapter 2.3.2 --- AQM for Wireless Network --- p.17Chapter 3 --- Intelligent Packet Discarding Policies --- p.21Chapter 3.1 --- Random Packet Discard --- p.22Chapter 3.1.1 --- Variable Buffer Limit (VABL) --- p.22Chapter 3.2 --- Packet Discard on Expiration Likelihood (PEL) --- p.23Chapter 3.2.1 --- Working Principle --- p.24Chapter 3.2.2 --- Channel State Aware Packet Discard on Expiration Likelihood (CAPEL) --- p.26Chapter 3.3 --- System Modeling --- p.29Chapter 3.3.1 --- Wireless Channel as an Markov-Modulated Poisson Process (MMPP) --- p.30Chapter 3.3.2 --- System Analysis --- p.30Chapter 3.3.3 --- System Time Distribution --- p.33Chapter 3.3.4 --- Approximation of System Time Distribution by Gamma Distribution --- p.36Chapter 3.4 --- Goodput Analysis of Intelligent Packet Discarding Policies --- p.38Chapter 3.4.1 --- Variable Buffer Limit (VABL) --- p.38Chapter 3.4.2 --- CAPEL at the End-of-Line --- p.39Chapter 3.4.3 --- CAPEL at the Head-of-Line --- p.43Chapter 4 --- Performance Evaluation --- p.44Chapter 4.1 --- Simulation --- p.44Chapter 4.1.1 --- General Settings --- p.45Chapter 4.1.2 --- Choices of Parameters --- p.46Chapter 4.1.3 --- Variable Buffer Limit (VABL) --- p.49Chapter 4.1.4 --- CAPEL at the End-of-Line --- p.53Chapter 4.1.5 --- CAPEL at the Head-of-Line --- p.60Chapter 4.2 --- General Discussion --- p.64Chapter 4.2.1 --- CAPEL vs RED --- p.64Chapter 4.2.2 --- Gamma Approximation for System Time Distribution . --- p.69Chapter 5 --- Conclusion --- p.70Chapter A --- Equation Derivation --- p.73Chapter A.l --- Steady State Probabilities --- p.73Bibliography --- p.7

Performance modelling and analysis of congestion control mechanisms for communication networks with quality of service constraints. An investigation into new methods of controlling congestion and mean delay in communication networks with both short range dependent and long range dependent traffic.

Active Queue Management (AQM) schemes are used for ensuring the Quality of Service (QoS) in telecommunication networks. However, they are sensitive to parameter settings and have weaknesses in detecting and controlling congestion under dynamically changing network situations. Another drawback for the AQM algorithms is that they have been applied only on the Markovian models which are considered as Short Range Dependent (SRD) traffic models. However, traffic measurements from communication networks have shown that network traffic can exhibit self-similar as well as Long Range Dependent (LRD) properties. Therefore, it is important to design new algorithms not only to control congestion but also to have the ability to predict the onset of congestion within a network. An aim of this research is to devise some new congestion control methods for communication networks that make use of various traffic characteristics, such as LRD, which has not previously been employed in congestion control methods currently used in the Internet. A queueing model with a number of ON/OFF sources has been used and this incorporates a novel congestion prediction algorithm for AQM. The simulation results have shown that applying the algorithm can provide better performance than an equivalent system without the prediction. Modifying the algorithm by the inclusion of a sliding window mechanism has been shown to further improve the performance in terms of controlling the total number of packets within the system and improving the throughput. Also considered is the important problem of maintaining QoS constraints, such as mean delay, which is crucially important in providing satisfactory transmission of real-time services over multi-service networks like the Internet and which were not originally designed for this purpose. An algorithm has been developed to provide a control strategy that operates on a buffer which incorporates a moveable threshold. The algorithm has been developed to control the mean delay by dynamically adjusting the threshold, which, in turn, controls the effective arrival rate by randomly dropping packets. This work has been carried out using a mixture of computer simulation and analytical modelling. The performance of the new methods that haveMinistry of Higher Education in Egypt and the Egyptian Cultural Centre and Educational Bureau in Londo

Reactive traffic control mechanisms for communication networks with self-similar bandwidth demands

Communication network architectures are in the process of being redesigned so that many different services are integrated within the same network. Due to this integration, traffic management algorithms need to balance the requirements of the traffic which the algorithms are directly controlling with Quality of Service (QoS) requirements of other classes of traffic which will be encountered in the network. Of particular interest is one class of traffic, termed elastic traffic, that responds to dynamic feedback from the network regarding the amount of available resources within the network. Examples of this type of traffic include the Available Bit Rate (ABR) service in Asynchronous Transfer Mode (ATM) networks and connections using Transmission Control Protocol (TCP) in the Internet. Both examples aim to utilise available bandwidth within a network. Reactive traffic management, like that which occurs in the ABR service and TCP, depends explicitly on the dynamic bandwidth requirements of other traffic which is currently using the network. In particular, there is significant evidence that a wide range of network traffic, including Ethernet, World Wide Web, Varible Bit Rate video and signalling traffic, is self-similar. The term self-similar refers to the particular characteristic of network traffic to remain bursty over a wide range of time scales. A closely associated characteristic of self-similar traffic is its long-range dependence (LRD), which refers to the significant correlations that occur with the traffic. By utilising these correlations, greater predictability of network traffic can be achieved, and hence the performance of reactive traffic management algorithms can be enhanced. A predictive rate control algorithm, called PERC (Predictive Explicit Rate Control), is proposed in this thesis which is targeted to the ABR service in ATM networks. By incorporating the LRD stochastic structure of background traffic, measurements of the bandwidth requirements of background traffic, and the delay associated with a particular ABR connection, a predictive algorithm is defined which provides explicit rate information that is conveyed to ABR sources. An enhancement to PERC is also described. This algorithm, called PERC+, uses previous control information to correct prediction errors that occur for connections with larger round-trip delay. These algorithms have been extensively analysed with regards to their network performance, and simulation results show that queue lengths and cell loss rates are significantly reduced when these algorithms are deployed. An adaptive version of PERC has also been developed using real-time parameter estimates of self-similar traffic. This has excellent performance compared with standard ABR rate control algorithms such as ERICA. Since PERC and its enhancement PERC+ have explicitly utilised the index of self-similarity, known as the Hurst parameter, the sensitivity of these algorithms to this parameter can be determined analytically. Research work described in this thesis shows that the algorithms have an asymmetric sensitivity to the Hurst parameter, with significant sensitivity in the region where the parameter is underestimated as being close to 0.5. Simulation results reveal the same bias in the performance of the algorithm with regards to the Hurst parameter. In contrast, PERC is insensitive to estimates of the mean, using the sample mean estimator, and estimates of the traffic variance, which is due to the algorithm primarily utilising the correlation structure of the traffic to predict future bandwidth requirements. Sensitivity analysis falls into the area of investigative research, but it naturally leads to the area of robust control, where algorithms are designed so that uncertainty in traffic parameter estimation or modelling can be accommodated. An alternative robust design approach, to the standard maximum entropy approach, is proposed in this thesis that uses the maximum likelihood function to develop the predictive rate controller. The likelihood function defines the proximity of a specific traffic model to the traffic data, and hence gives a measure of the performance of a chosen model. Maximising the likelihood function leads to optimising robust performance, and it is shown, through simulations, that the system performance is close to the optimal performance as compared with maximising the spectral entropy. There is still debate regarding the influence of LRD on network performance. This thesis also considers the question of the influence of LRD on traffic predictability, and demonstrates that predictive rate control algorithms that only use short-term correlations have close performance to algorithms that utilise long-term correlations. It is noted that predictors based on LRD still out-perform ones which use short-term correlations, but that there is Potential simplification in the design of predictors, since traffic predictability can be achieved using short-term correlations. This thesis forms a substantial contribution to the understanding of control in the case where self-similar processes form part of the overall system. Rather than doggedly pursuing self-similar control, a broader view has been taken where the performance of algorithms have been considered from a number of perspectives. A number of different research avenues lead on from this work, and these are outlined

An Introduction to Computer Networks

An open textbook for undergraduate and graduate courses on computer networks

Goodput Analysis of a Fluid Queue with Selective Discarding and a Responsive Bursty Source

In this paper we analyse a feedback system consisting of a finite buffer fluid queue and a responsive source. The source alternates between silence periods and active periods. At random epochs of times the source becomes ready to send a burst of fluid. The length of the bursts (length of the active periods) are independent and identically distributed with some general distribution. The queue employs a threshold discarding policy in the sense that only those bursts at whose commencement epoch (the instant at which the source is ready to send), the workload (i.e., the amount of fluid in the buffer) is less than some preset threshold are accepted. If the burst is rejected then the source backs off from sending. Using techniques from Volterra Integral Equations we obtain an explicit characterization of the queue length distribution at commencement epochs of bursts from which we obtain an explicit characterization of the goodput ratio associated with such a feedback system. For the particular case of exponential distribution of on-periods we are able to obtain explicit closed form expression for the goodput ratio. Our explicit characterizations shall be quite helpful in studying the sensitivity of goodput ratio to different parameters, in selecting optimal discarding threshold etc. which will further provide useful "engineering" guidelines for better network designing