Telecommunication networks: protocols, modeling and analysis
Telecommunication networks: protocols, modeling and analysis
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Improving round-trip time estimates in reliable transport protocols
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Congestion avoidance in computer networks with a connectionless network layer
Innovations in Internetworking
Computer networks
A control-theoretic approach to flow control
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Analysis of dynamic congestion control protocols: a Fokker-Planck approximation
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Dynamics of congestion control and avoidance of two-way traffic in an OSI testbed
ACM SIGCOMM Computer Communication Review
A hop by hop rate-based congestion control scheme
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Analysis of a rate-based control strategy with delayed feedback
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
An adaptive framework for dynamic access to bandwith at high speeds
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Warp control: a dynamically stable congestion protocol and its analysis
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Feedback control of congestion in packet switching networks: the case of a single congested node
IEEE/ACM Transactions on Networking (TON)
A control-theoretic approach to flow control
ACM SIGCOMM Computer Communication Review - Special twenty-fifth anniversary issue. Highlights from 25 years of the Computer Communication Review
On hop-by-hop rate-based congestion control
IEEE/ACM Transactions on Networking (TON)
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A Robust Heuristic for Minimizing Cell Loss in ATM Networks
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
IEEE/ACM Transactions on Networking (TON)
Rate-adaptive snoop: a TCP enhancement scheme over rate-controlled lossy links
IEEE/ACM Transactions on Networking (TON)
Research: Self-optimizing window flow control in high-speed data networks
Computer Communications
| Hi-index | 0.00 |
Recent results on the asymptotically optimal design of sliding windows for virtual circuits in high speed, geographically dispersed data networks in a stationary environment are exploited here in the synthesis of algorithms for adapting windows in realistic, non-stationary environments. The algorithms proposed here require each virtual circuit's source to measure the round trip response times of its packets and to use these measurements to dynamically adjust its window. Our design philosophy is quasi-stationary: we first obtain, for a complete range of parameterized stationary conditions, the relation, called the “design equation”, that exists between the window and the mean response time in asymptotically optimal designs; the adaptation algorithm is simply an iterative algorithm for tracking the root of the design equation as conditions change in a non-stationary environment. A report is given of extensive simulations of networks with data rates of 45 Mbps and propagation delays of up to 47 msecs. The simulations generally confirm that the realizations of the adaptive algorithms give stable, efficient performance and are close to theoretical expectations when these exist.