Improving the Performance of Internet Data Transport

With the explosion of the World Wide Web, the Internet infrastructure faces new challenges in providing high performance for data traffic. First, it must be able to pro-vide a fair-share of congested link bandwidth to every flow. Second, since web traffic is inherently interactive, it must minimize the delay for data transfer. Recent studies have shown that queue management algorithms such as Tail Drop, RED and Blue are deficient in providing high throughput, low delay paths for a data flow. Two major shortcomings of the current algorithms are: they allow TCP flows to get synchronized and thus require large buffers during congestion to enable high throughput; and they allow unfair bandwidth usage for shorter round-trip time TCP flows. We propose algorithms using multiple queues and discard policies with hysteresis at bottleneck routers to address both these issues. Us-ing ns-2 simulations, we show that these algorithms can significantly outperform RED and Blue, especially at smaller buffer sizes. Using multiple queues raises two new concerns: scalability and excess memory bandwidth usage caused by dropping packets which have been queued. We propose and evaluate an architecture using Bloom filters to evenly distribute flows among queues to improve scalability. We have also developed new intelligent packet discard algorithms that discard packets on arrival and are able to achieve performance close to that of policies that may discard packets that have already been queued. Finally, we propose better methods for evaluating the performance of fair-queueing methods. In the current literature, fair-queueing methods are evaluated based on their worst-case performance. This can exaggerate the differences among algorithms, since the worst-case behavior is dependent on the the precise timing of packet arrivals. This work seeks to understand what happens under more typical circumstances

Analysing the characteristics of VoIP traffic

In this study, the characteristics of VoIP traffic in a deployed Cisco VoIP phone system and a SIP based soft phone system are analysed. Traffic was captured in a soft phone system, through which elementary understanding about a VoIP system was obtained and experimental setup was validated. An advanced experiment was performed in a deployed Cisco VoIP system in the department of Computer Science at the University of Saskatchewan. Three months of traffic trace was collected beginning October 2006, recording address and protocol information for every packet sent and received on the Cisco VoIP network. The trace was analysed to find out the features of Cisco VoIP system and the findings were presented.This work appears to be one of the first real deployment studies of VoIP that does not rely on artificial traffic. The experimental data provided in this study is useful for design and modeling of such systems, from which more useful predictive models can be generated. The analysis method used in this research can be used for developing synthetic workload models. A clear understanding of usage patterns in a real VoIP network is important for network deployment and potential network activities such as integration, optimizations or expansion. The major factors affecting VoIP quality such as delay, jitter and loss were also measured and simulated in this study, which will be helpful in an advanced VoIP quality study. A traffic generator was developed to generate various simulated VoIP traffic. The data used to provide the traffic model parameters was chosen from peak traffic periods in the captured data from University of Saskatchewan deployment. By utilizing the Traffic Trace function in ns2, the simulated VoIP traffic was fed into ns2, and delay, jitter and packet loss were calculated for different scenarios. Two simulation experiments were performed. The first experiment simulated the traffic of multiple calls running on a backbone link. The second experiment simulated a real network environment with different traffic load patterns. It is significant for network expansion and integration

Networking Mechanisms for Delay-Sensitive Applications

The diversity of applications served by the explosively growing Internet is increasing. In particular, applications that are sensitive to end-to-end packet delays become more common and include telephony, video conferencing, and networked games. While the single best-effort service of the current Internet favors throughput-greedy traffic by equipping congested links with large buffers, long queuing at the congested links hurts the delay-sensitive applications. Furthermore, while numerous alternative architectures have been proposed to offer diverse network services, the innovative alternatives failed to gain widespread end-to-end deployment. This dissertation explores different networking mechanisms for supporting low queueing delay required by delay-sensitive applications. In particular, it considers two different approaches. The first one assumes employing congestion control protocols for the traffic generated by the considered class of applications. The second approach relies on the router operation only and does not require support from end hosts

Contributions to QoS and energy efficiency in wi-fi networks

The Wi-Fi technology has been in the recent years fostering the proliferation of attractive mobile computing devices with broadband capabilities. Current Wi-Fi radios though severely impact the battery duration of these devices thus limiting their potential applications. In this thesis we present a set of contributions that address the challenge of increasing energy efficiency in Wi-Fi networks. In particular, we consider the problem of how to optimize the trade-off between performance and energy effciency in a wide variety of use cases and applications. In this context, we introduce novel energy effcient algorithms for real-time and data applications, for distributed and centralized Wi-Fi QoS and power saving protocols and for Wi-Fi stations and Access Points. In addition, the di¿erent algorithms presented in this thesis adhere to the following design guidelines: i) they are implemented entirely at layer two, and can hence be easily re-used in any device with a Wi-Fi interface, ii) they do not require modi¿cations to current 802.11 standards, and can hence be readily deployed in existing Wi-Fi devices, and iii) whenever possible they favor client side solutions, and hence mobile computing devices implementing them can benefit from an increased energy efficiency regardless of the Access Point they connect to. Each of our proposed algorithms is thoroughly evaluated by means of both theoretical analysis and packet level simulations. Thus, the contributions presented in this thesis provide a realistic set of tools to improve energy efficiency in current Wi-Fi networks

Architectural and mobility management designs in internet-based infrastructure wireless mesh networks

Wireless mesh networks (WMNs) have recently emerged to be a cost-effective solution to support large-scale wireless Internet access. They have numerous ap- plications, such as broadband Internet access, building automation, and intelligent transportation systems. One research challenge for Internet-based WMNs is to design efficient mobility management techniques for mobile users to achieve seamless roam- ing. Mobility management includes handoff management and location management. The objective of this research is to design new handoff and location management techniques for Internet-based infrastructure WMNs. Handoff management enables a wireless network to maintain active connections as mobile users move into new service areas. Previous solutions on handoff manage- ment in infrastructure WMNs mainly focus on intra-gateway mobility. New handoff issues involved in inter-gateway mobility in WMNs have not been properly addressed. Hence, a new architectural design is proposed to facilitate inter-gateway handoff man- agement in infrastructure WMNs. The proposed architecture is designed to specifi- cally address the special handoff design challenges in Internet-based WMNs. It can facilitate parallel executions of handoffs from multiple layers, in conjunction with a data caching mechanism which guarantees minimum packet loss during handoffs. Based on the proposed architecture, a Quality of Service (QoS) handoff mechanism is also proposed to achieve QoS requirements for both handoff and existing traffic before and after handoffs in the inter-gateway WMN environment. Location management in wireless networks serves the purpose of tracking mobile users and locating them prior to establishing new communications. Existing location management solutions proposed for single-hop wireless networks cannot be directly applied to Internet-based WMNs. Hence, a dynamic location management framework in Internet-based WMNs is proposed that can guarantee the location management performance and also minimize the protocol overhead. In addition, a novel resilient location area design in Internet-based WMNs is also proposed. The formation of the location areas can adapt to the changes of both paging load and service load so that the tradeoff between paging overhead and mobile device power consumption can be balanced, and at the same time, the required QoS performance of existing traffic is maintained. Therefore, together with the proposed handoff management design, efficient mobility management can be realized in Internet-based infrastructure WMNs

PoissonProb: A new rate-based available bandwidth measurement algorithm.

Accurate available bandwidth measurement is important for network protocols and distributed programs design, traffic optimization, capacity planning, and service verification. Research on measuring available bandwidth falls into two basic classes: the network traffic modeling algorithms and the self-induced algorithms. The self-induced algorithms are based on packet dispersion techniques. The currently available bandwidth measurement algorithms face the problems of distortion of measurement on multi-hop paths, system resource limitations, probe traffic intrusiveness and measurement accuracy. We have developed a new rate-based self-induced algorithm---PoissonProb. The intervals between probe packets of this algorithm are in Poisson distribution format and the algorithm infers the available bandwidth according to the average of probe packets rate. The algorithm has been implemented as the PoissonProb Available Bandwidth (PAB) measurement tool. The PAB tool can be operated in either sender-based or receiver-based mode. (Abstract shortened by UMI.) Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2005 .X56. Source: Masters Abstracts International, Volume: 44-03, page: 1418. Thesis (M.Sc.)--University of Windsor (Canada), 2005

Congestion Avoidance Testbed Experiments

DARTnet provides an excellent environment for executing networking experiments. Since the network is private and spans the continental United States, it gives researchers a great opportunity to test network behavior under controlled conditions. However, this opportunity is not available very often, and therefore a support environment for such testing is lacking. To help remedy this situation, part of SRI's effort in this project was devoted to advancing the state of the art in the techniques used for benchmarking network performance. The second objective of SRI's effort in this project was to advance networking technology in the area of traffic control, and to test our ideas on DARTnet, using the tools we developed to improve benchmarking networks. Networks are becoming more common and are being used by more and more people. The applications, such as multimedia conferencing and distributed simulations, are also placing greater demand on the resources the networks provide. Hence, new mechanisms for traffic control must be created to enable their networks to serve the needs of their users. SRI's objective, therefore, was to investigate a new queueing and scheduling approach that will help to meet the needs of a large, diverse user population in a "fair" way

Optimization and Performance Analysis of High Speed Mobile Access Networks

The end-to-end performance evaluation of high speed broadband mobile access networks is the main focus of this work. Novel transport network adaptive flow control and enhanced congestion control algorithms are proposed, implemented, tested and validated using a comprehensive High speed packet Access (HSPA) system simulator. The simulation analysis confirms that the aforementioned algorithms are able to provide reliable and guaranteed services for both network operators and end users cost-effectively. Further, two novel analytical models one for congestion control and the other for the combined flow control and congestion control which are based on Markov chains are designed and developed to perform the aforementioned analysis efficiently compared to time consuming detailed system simulations. In addition, the effects of the Long Term Evolution (LTE) transport network (S1and X2 interfaces) on the end user performance are investigated and analysed by introducing a novel comprehensive MAC scheduling scheme and a novel transport service differentiation model