Results 1 
5 of
5
A ControlTheoretic Approach to Flow Control
, 1991
"... This paper presents a controltheoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a roundrobinlike queue service discipline in the output queues of the network’s switches, and propose deterministic and stochastic models for a single conversation in a ne ..."
Abstract

Cited by 398 (7 self)
 Add to MetaCart
(Show Context)
This paper presents a controltheoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a roundrobinlike queue service discipline in the output queues of the network’s switches, and propose deterministic and stochastic models for a single conversation in a network of such switches. These models motivate the PacketPair rate probing technique, and a provably stable ratebased flow control scheme. A Kalman state estimator is derived from discretetime state space analysis, but there are difficulties in using the estimator in practice. These difficulties are overcome by a novel estimation scheme based on fuzzy logic. We then present a technique to extract and use additional information horn the system to develop a continuoustime system model. This is used to design a wuisnt of the control law that is also provably stable, and, in addition, takes control action as rapidly as possible. Finally, practical issues such as correcting parameter drift and cmmlination with window flow control are described.
PacketPair Flow Control
 IEEE/ACM Transactions on Networking
, 1994
"... This paper presents the packetpair ratebased feedback flow control scheme. This scheme is designed for networks where individual connections do not reserve bandwidth and for the available bitrate (besteffort) component of integrated networks. We assume a roundrobinlike queue service discipline ..."
Abstract

Cited by 46 (2 self)
 Add to MetaCart
(Show Context)
This paper presents the packetpair ratebased feedback flow control scheme. This scheme is designed for networks where individual connections do not reserve bandwidth and for the available bitrate (besteffort) component of integrated networks. We assume a roundrobinlike queue service discipline in the output queues of the network's switches, and propose a linear stochastic model for a single conversation in a network of such switches. These model motivates the PacketPair rate probing technique, which forms the basis for provably stable discrete and continuous time ratebased flow control schemes. We present a novel state estimation scheme based on fuzzy logic. We then address several practical concerns: dealing with system startup, retransmission and timeout strategy, and dynamic setpoint probing. We present a finite state machine as well as source code for a model implementation. The dynamics of a single source, the interactions of multiple sources, and the behavior of packetpai...
DTP: An Efficient Transport Protocol
 IN PROCEEDINGS OF THE IFIP TC6 WORKING CONFERENCE ON COMACM COMPUTING SURVEYS
, 1991
"... We recently introduced a new flow control scheme, called sendtime control, which is based on a deterministic model of virtual circuits in a computer network. In this scheme, the time at which a packet is sent by a source is computed from estimates of roundtrip time, traffic in the network and bott ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We recently introduced a new flow control scheme, called sendtime control, which is based on a deterministic model of virtual circuits in a computer network. In this scheme, the time at which a packet is sent by a source is computed from estimates of roundtrip time, traffic in the network and bottleneck service time. In this paper, we describe a new transport protocol, called DTP, which uses sendtime control as its flow control scheme. Preliminary measurements of coasttocoast connections over the Internet show significant performance improvement over TCP, which is the most commonly used transport protocol in the Internet today.
unknown title
"... This paper presents a controltheoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a roundrobinlike queue service discipline in the output queues of the network’s switches, and propose deterministic and stochastic models for a single conversation in a ne ..."
Abstract
 Add to MetaCart
(Show Context)
This paper presents a controltheoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a roundrobinlike queue service discipline in the output queues of the network’s switches, and propose deterministic and stochastic models for a single conversation in a network of such switches. These models motivate the PacketPair rate probing technique, and a provably stable ratebased flow control scheme. A Kalman state estimator is derived from discretetime state space analysis, but there are difficulties in using the estimator in practice. These difficulties are overcome by a novel estimation scheme based on fuzzy logic. We then present a technique to extract and use additional information from the system to develop a continuoustime system model. This is used to design a variant of the control law that is also provably stable, and, in addition, takes control action as rapidly as possible. Finally, practical issues such as correcting parameter drift and coordination with window flow control are described. 1.
Estimating Available Capacity of a Network Connection
 in Proceedings IEEE International Conference on Networks
, 2001
"... Capacity estimations for an endtoend connection across the is a measure that can be useful to many applications. Its applicability encompasses QoS guarantees, congestion control and other related areas. In this paper, the available capacity of a connection, is defined and estimated through measure ..."
Abstract
 Add to MetaCart
Capacity estimations for an endtoend connection across the is a measure that can be useful to many applications. Its applicability encompasses QoS guarantees, congestion control and other related areas. In this paper, the available capacity of a connection, is defined and estimated through measurements made only at the endpoints. The measurements detects and accounts for variability of cross traffic that pass through this connection. Modifications to current techniques to measure packet service time of the `bottleneck' router is also described. Finally, estimation results on widearea network connections from recent experiments to multiple sites is presented. 1