Improved congestion control for packet switched data networks and the Internet

Congestion control is one of the fundamental issues in computer networks. Without proper congestion control mechanisms there is the possibility of inefficient utilization of resources, ultimately leading to network collapse. Hence congestion control is an effort to adapt the performance of a network to changes in the traffic load without adversely affecting users perceived utilities. This thesis is a step in the direction of improved network congestion control. Traditionally the Internet has adopted a best effort policy while relying on an end-to-end mechanism. Complex functions are implemented by end users, keeping the core routers of network simple and scalable. This policy also helps in updating the software at the users' end. Thus, currently most of the functionality of the current Internet lie within the end users' protocols, particularly within Transmission Control Protocol (TCP). This strategy has worked fine to date, but networks have evolved and the traffic volume has increased many fold; hence routers need to be involved in controlling traffic, particularly during periods of congestion. Other benefits of using routers to control the flow of traffic would be facilitating the introduction of differentiated services or offering different qualities of service to different users. Any real congestion episode due to demand of greater than available bandwidth, or congestion created on a particular target host by computer viruses, will hamper the smooth execution of the offered network services. Thus, the role of congestion control mechanisms in modern computer networks is very crucial. In order to find effective solutions to congestion control, in this thesis we use feedback control system models of computer networks. The closed loop formed by TCPIIP between the end hosts, through intermediate routers, relies on implicit feedback of congestion information through returning acknowledgements. This feedback information about the congestion state of the network can be in the form of lost packets, changes in round trip time and rate of arrival of acknowledgements. Thus, end hosts can either execute reactive or proactive congestion control mechanisms. The former approach uses duplicate acknowledgements and timeouts as congestion signals, as done in TCP Reno, whereas the latter approach depends on changes in the round trip time, as in TCP Vegas. The protocols employing the second approach are still in their infancy as they cannot co-exist safely with protocols employing the first approach. Whereas TCP Reno and its mutations, such as TCP Sack, are presently widely used in computer networks, including the current Internet. These protocols require packet losses to happen before they can detect congestion, thus inherently leading to wastage of time and network bandwidth. Active Queue Management (AQM) is an alternative approach which provides congestion feedback from routers to end users. It makes a network to behave as a sensitive closed loop feedback control system, with a response time of one round trip time, congestion information being delivered to the end host to reduce data sending rates before actual packets losses happen. From this congestion information, end hosts can reduce their congestion window size, thus pumping fewer packets into a congested network until the congestion period is over and routers stop sending congestion signals. Keeping both approaches in view, we have adopted a two-pronged strategy to address the problem of congestion control. They are to adapt the network at its edges as well as its core routers. We begin by introducing TCPIIP based computer networks and defining the congestion control problem. Next we look at different proactive end-to-end protocols, including TCP Vegas due to its better fairness properties. We address the incompatibility problem between TCP Vegas and TCP Reno by using ECN based on Random Early Detection (RED) algorithm to adjust parameters of TCP Vegas. Further, we develop two alternative algorithms, namely optimal minimum variance and generalized optimal minimum variance, for fair end-to-end protocols. The relationship between (p, 1) proportionally fair algorithm and the generalized algorithm is investigated along with conditions for its stable operation. Noteworthy is a novel treatment of the issue of transient fairness. This represents the work done on congestion control at the edges of network. Next, we focus on router-based congestion control algorithms and start with a survey of previous work done in that direction. We select the RED algorithm for further work due to it being recommended for the implementation of AQM. First we devise a new Hybrid RED algorithm which employs instantaneous queue size along with an exponential weighted moving average queue size for making decisions about packet marking/dropping, and adjusts the average value during periods of low traffic. This algorithm improves the link utilization and packet loss rate as compared to basic RED. We further propose a control theory based Auto-tuning RED algorithm that adapts to changing traffic load. This algorithm can clamp the average queue size to a desired reference value which can be used to estimate queuing delays for Quality of Service purposes. As an alternative approach to router-based congestion control, we investigate Proportional, Proportional-Integral (PI) and Proportional-Integral-Derivative (PID) principles based control algorithms for AQM. New control-theoretic RED and frequency response based PI and PID control algorithms are developed and their performance is compared with that of existing algorithms. Later we transform the RED and PI principle based algorithms into their adaptive versions using the well known square root of p formula. The performance of these load adaptive algorithms is compared with that of the previously developed fixed parameter algorithms. Apart from some recent research, most of the previous efforts on the design of congestion control algorithms have been heuristic. This thesis provides an effective use of control theory principles in the design of congestion control algorithms. We develop fixed-parameter-type feedback congestion control algorithms as well as their adaptive versions. All of the newly proposed algorithms are evaluated by using ns-based simulations. The thesis concludes with a number of research proposals emanating from the work reported

Induction Motors

AC motors play a major role in modern industrial applications. Squirrel-cage induction motors (SCIMs) are probably the most frequently used when compared to other AC motors because of their low cost, ruggedness, and low maintenance. The material presented in this book is organized into four sections, covering the applications and structural properties of induction motors (IMs), fault detection and diagnostics, control strategies, and the more recently developed topology based on the multiphase (more than three phases) induction motors. This material should be of specific interest to engineers and researchers who are engaged in the modeling, design, and implementation of control algorithms applied to induction motors and, more generally, to readers broadly interested in nonlinear control, health condition monitoring, and fault diagnosis

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

Integrated Water Resources Management Karlsruhe 2010 : IWRM, International Conference, 24 - 25 November 2010 conference proceedings

In dieser Arbeit werden dual-orthogonal, linear polarisierte Antennen für die UWB-Technik konzipiert. Das Prinzip zur Realisierung der Strahler wird vorgestellt, theoretisch und simulativ untersucht, sowie messtechnisch verifiziert. Danach werden Konzepte zur Miniaturisierung der Strahler dargelegt, die anschließend zum Aufbau von Antennengruppen verwendet werden. Die Vorteile der entwickelten Antennen werden praktisch anhand des bildgebenden Radars und des Monopuls-Radars gezeigt

Optimisation of network systems for gas and water allocation and spot price dynamic modelling.

This thesis studies the network of high pressure gas transmission pipelines in eastern Australia and the network of irrigation channels in the Goulbum-Murray irrigation district. The objective is to advance the study of network allocation systems. The research questions examined focus on three problems, optimising the delivery of commodities through networks, the optimisation of the cost of supply, and the modelling of prices of commodities that rely on network structures for delivery. A significant part of this research involves the collation of modelling data for the eastern Australian gas network. Three research questions will be addressed. The first research problem is to estimate the price of irrigation water at the start of the irrigation season. Water allocated to holders of water entitlements in the Goulburn- Murray irrigation district are traded on a market exchange. This market has matured to the point where new products based on the water allocations can be introduced which is one of the objectives stated in The Intergovernmental Agreement on a National Water Initiative. The second research question addressed is the absence of a model for simulating the spot price of wholesale natural gas sold in the Victorian declared wholesale gas market. In this thesis a model to simulate this price is presented. With this model holders of a portfolio of energy contracts will now have the ability to ascertain the potential losses they may be exposed to in the spot market. In the third research problem addressed in this thesis, the optimal routing of natural gas to the major demand centres in eastern Australia is addressed. Two formulations are presented with the first focussing on minimising shortfalls on days of simultaneous peak demand across all demand centres. Annual growth factors are applied to current peak day estimates and the model is run for each of the next 20 years and the size of any shortfalls are quantified. The network components that are causing the shortfalls are identified. In the second model the cost of supplying current peak day demand is minimised and the sensitivity of the solution to changes in production costs at supply nodes is discussed. The production costs are the most variable cost in the supply of natural gas. Gas resources are unique and finite and as different gas reservoirs are discovered and depleted the production costs of different gas basins changes