Affiliation:
1. Computer Science Division, Department of EECS, University of California, Berkeley, and International Computer Science Institute, Berkeley, CA
Abstract
This paper presents a control-theoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a round-robin-like 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 Packet-Pair rate probing technique, and a provably stable rate-based flow control scheme. A Kalman state estimator is derived from discrete-time 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 continuous-time 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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Software
Reference47 articles.
1. Client requirements for real-time communication services
2. Rate controlled servers for very high-speed networks
3. A scheme for real-time channel establishment in wide-area networks
4. A stop-and-go queueing framework for congestion management
5. 5
. L. Zhang A New Architecture for Packet Switching Network Protocols PhD thesis Massachusetts Institute of Technology July 1989. 5. L. Zhang A New Architecture for Packet Switching Network Protocols PhD thesis Massachusetts Institute of Technology July 1989.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献