Queuing delay

About: Queuing delay is a research topic. Over the lifetime, 2713 publications have been published within this topic receiving 44892 citations.

A calculus for network delay. I. Network elements in isolation

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. >

Real-Time Control Systems with Delays

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)

A calculus for network delay. II. Network analysis

Abstract: For pt.I see ibid., vol.37, no.1, p.114-31 (1991). A method to analyze the flow of data in a network consisting of the interconnection of network elements is presented. Assuming the data that enters the network satisfies burstiness constraints, burstiness constraints are derived for traffic flowing between network elements. These derived constraints imply bounds on network delay and buffering requirements. By example, it is shown that the use of regulator elements within the network can reduce maximum network delay. It is also found that such a use of regulator elements can enlarge the throughput region where finite bounds for delay are found. Finally, it is shown how regulator elements connected in series can be used to enforce general burstiness constraints. >

The New Routing Algorithm for the ARPANET

Abstract: The new ARPANET routing algorithm is an improvement over the old procedure in that it uses fewer network resources, operates on more realistic estimates of network conditions, reacts faster to important network changes, and does not suffer from long-term loops or oscillations. In the new procedure, each node in the network maintains a database describing the complete network topology and the delays on all lines, and uses the database describing the network to generate a tree representing the minimum delay paths from a given root node to every other network node. Because the traffic in the network can be quite variable, each node periodically measures the delays along its outgoing lines and forwards this information to all other nodes. The delay information propagates quickly through the network so that all nodes can update their databases and continue to route traffic in a consistent and efficient manner. An extensive series of tests were conducted on the ARPANET, showing that line overhead and CPU overhead are both less than two percent, most nodes learn of an update within 100 ms, and the algorithm detects congestion and routes packets around congested areas.