A conceptual framework for using feedback control within adaptive traffic control systems

Existing adaptive traffic control strategies lack an effective evaluation procedure to check the performance of the control plan after implementation. In the absence of an effective evaluation procedure, errors introduced in the system such as inaccurate estimates of arrival flows, are carried forward in time and reduce the efficiency of the traffic flow algorithms as they assess prevalent traffic conditions. It is evident that the feed-forward nature of these systems cannot accurately update the estimated quantities, especially during oversaturated conditions. This research is an attempt to develop a conceptual framework for the application of feedback control within the basic operation of existing adaptive traffic control systems to enhance their performance. The framework is applied to three existing adaptive traffic control strategies (SCOOT, SCATS, and OPAC) to enable better demand estimations and queue management during oversaturated condition. A numerical example is provided to test the performance of an arterial in a feedback environment. The example involves the design and simulation test of Proportional (P) and Proportional-Integral (P1) controllers and their adaptability to adequately control the arterial. A sensitivity analysis is further performed to justify the use of a feedback control system on arterials and to choose the type of controller best suited under given demand conditions. The simulation results indicated that for the studied arterial, the P1 controller can handle demand estimation and queuing better than P controllers. It was determined that a well designed feedback control system with a PI controller can effectively overcome some of the deficiencies of existing adaptive traffic control systems

An analysis of temporal-difference learning with function approximation

Cover title.Includes bibliographical references (p. 27-28).Supported by NSF. ECS 9216531 Supported by EPRI. 8030-10 Supported by ARO. DAAL-03-92-G-0115John N. Tsitsiklis and Benjamin Van Roy

Improving aggregate user utilities and providing fairness in multi-rate wireless LANs

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.Includes bibliographical references (p. 159-166).A distributed medium access control (MAC) protocol is responsible for allocating the shared spectrum efficiently and fairly among competing devices using a wireless local area network. Unfortunately, existing MAC protocols, including 802.11's DCF, achieve neither efficiency nor fairness under many realistic conditions. In this dissertation, we show that both bit and frame-based fairness,the most widely used notions, lead to drastically reduced aggregate throughput and increased average delay in typical environments, in which competing nodes transmit at different data transmission rates. We demonstrate the advantages of time-based fairness, in which each competing node receives an equal share of the wireless channel occupancy time. Through analysis, experiments on a Linux test bed, and simulation, we demonstrate that time-based fairness can lead to significant improvements in aggregate throughput and average delay. Through a game theoretic analysis and simulation, we also show that existing MAC protocols encourage non-cooperative nodes to employ globally inefficient transmission strategies that lead to low aggregate throughput. We show that providing long-term time share guarantees among competing nodes leads rational nodes to employ efficient transmission strategies at equilibriums.(cont.) We describe two novel solutions, TES (Time-fair Efficient and Scalable MAC protocol) and TBR (Time-based Regulator) that provide time-based fairness and long-term time share guarantees among competing nodes. TBR is a backward-compatible centralized solution that runs at the AP,works in conjunction with DCF, and requires no modifications to clients nor to DCF. TBR is appropriate for existing access point based networks, but not effective when nearby non-cooperative nodes fall under different administrative domains. Our evaluation of TBR on an 802.1lb/Linux test bed shows that TBR can improve aggregate TCP throughput by as much as 105% in rate diverse environments. TES is a non-backward compatible distributed contention-based MAC protocol that is effective in any environment, including non-cooperative environments. Furthermore, the aggregate throughputs sustained with increased loads. Through extensive simulation experiments, we demonstrate that TES is significantly more efficient(as much as 140% improvement in aggregate TCP throughput) and fairer than existing MAC protocols including DCF.by Godfrey Tan.Ph.D

Design and analysis of flow control algorithms for data networks

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.Includes bibliographical references (leaves 110-112).by Paolo L. Naváez Guarnieri.M.S

Wide-area monitoring and control of future smart grids

Application of wide-area monitoring and control for future smart grids with substantial wind penetration and advanced network control options through FACTS and HVDC (both point-to-point and multi-terminal) is the subject matter of this thesis. For wide-area monitoring, a novel technique is proposed to characterize the system dynamic response in near real-time in terms of not only damping and frequency but also mode-shape, the latter being critical for corrective control action. Real-time simulation in Opal-RT is carried out to illustrate the effectiveness and practical feasibility of the proposed approach. Potential problem with wide-area closed-loop continuous control using FACTS devices due to continuously time-varying latency is addressed through the proposed modification of the traditional phasor POD concept introduced by ABB. Adverse impact of limited bandwidth availability due to networked communication is established and a solution using an observer at the PMU location has been demonstrated. Impact of wind penetration on the system dynamic performance has been analyzed along with effectiveness of damping control through proper coordination of wind farms and HVDC links. For multi-terminal HVDC (MTDC) grids the critical issue of autonomous power sharing among the converter stations following a contingency (e.g. converter outage) is addressed. Use of a power-voltage droop in the DC link voltage control loops using remote voltage feedback is shown to yield proper distribution of power mismatch according to the converter ratings while use of local voltages turns out to be unsatisfactory. A novel scheme for adapting the droop coefficients to share the burden according to the available headroom of each converter station is also studied. The effectiveness of the proposed approaches is illustrated through detailed frequency domain analysis and extensive time-domain simulation results on different test systems

Navigation/traffic control satellite mission study. Volume 2 - Systems analyses

Systems analysis of spacecraft network for transoceanic traffic contro

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

Time dependent sharc routing

During the last years, many speed-up techniques for Dijkstra 's algorithm have been developed. As a result, computing a shortest path in a staticroad network is a matter of microseconds. However, only few of those techniques work in time-dependentnetworks. Unfortunately, such networks appear frequentely in reality: Roads are predictably congestured by traffic jams, and efficient timetable information systems rely on time-dependent networks. Hence, a fast technique for routing in such networks is needed. In this work, we present an exacttime-dependent speed-up technique based on our recent SHARC-algorithm. As a result, we are able to efficiently compute shortest paths in time-dependent continental-sized transportation networks, both of roads and of railways. Document type: Part of book or chapter of boo

H? controller design for uncertain multiple-time-delay systems

Tez (doktora) - Anadolu ÜniversitesiAnadolu Üniversitesi, Fen Bilimleri Enstitüsü, Elektrik-Elektronik Mühendisliği Anabilim DalıKayıt no: 181326In this dissertation, H? controller design for systems with multiple uncertain time-delays is studied. In the H? controller design for these systems, since the nominal time-delays are taken outside the generalized plant, the uncertainty block of the overall system may become non-causal. However, the H? controller is designed by the small-gain theorem, which assumes the causality of the feedback interconnected subsystems. To alleviate this difficulty, the sufficient conditions are derived to satisfy the validity of the small-gain theorem for feedback interconnection of non-causal systems. Utilizing these results, an optimal H? flow controller is designed for data-communication networks. Stable H? controller design is also studied and different design approaches are presented. Furthermore, to satisfy one of the time-domain requirements of the flow controller, sufficient conditions are introduced to choose the free parameter in the structure of the designed controller