Network delay

Abstract: A calculus is developed for obtaining bounds on delay and buffering requirements in a communication network operating in a packet switched mode under a fixed routing strategy. The theory developed is different from traditional approaches to analyzing delay because the model used to describe the entry of data into the network is nonprobabilistic. It is supposed that the data stream entered into the network by any given user satisfies burstiness constraints. A data stream is said to satisfy a burstiness constraint if the quantity of data from the stream contained in any interval of time is less than a value that depends on the length of the interval. Several network elements are defined that can be used as building blocks to model a wide variety of communication networks. Each type of network element is analyzed by assuming that the traffic entering it satisfies bursting constraints. Under this assumption, bounds are obtained on delay and buffering requirements for the network element; burstiness constraints satisfied by the traffic that exits the element are derived. >

Abstract: Control loops that are closed over a communication network get more and more common. A problem with such systems is that the transfer delays will be varying with different characteristics depending on the network hardware and software. The network delays are typically varying due to varying network load, scheduling policies in the network and the nodes, and due to network failures. Two network models of different complexity are studied: Random delays that are independent from transfer to transfer, Random delays with probability distribution functions governed by an underlying Markov chain. The delay models are verified by experimental measurements of network delays. In the thesis it is shown how to analyze stability and expected performance of linear controllers where the network delays are described by one of the two network models above. Methods to evaluate quadratic cost functions are developed. Through the same analysis we find criteria for mean square stability of the closed loop for the different network models. The Linear Quadratic Gaussian (LQG) optimal controller is developed for the two delay models. The derived controller uses knowledge of old time delays. These can be calculated using ``timestamping'' of messages in the network. ``Timestamping'' means that every transfered signal is marked with the time of generation. The receiving node can then calculate how long the transfer delay was by comparing the timestamp with the node's internal clock. (Less)

Abstract: Networked control systems (NCSs) have been one of the main research focuses in academia as well as in industry for many decades and have become a multidisciplinary area. With these growing research trends, it is important to consolidate the latest knowledge and information to keep up with the research needs. In this paper, the NCS and its different forms are introduced and discussed. The beginning of this paper discusses the history and evolution of NCSs. The next part of this paper focuses on different fields and research arenas such as networking technology, network delay, network resource allocation, scheduling, network security in real-time NCSs, integration of components on a network, fault tolerance, etc. A brief literature survey and possible future direction concerning each topic is included.