Stationary deterministic flows: II. the single-server queue
Theoretical Computer Science
Sirpent: a high-performance internetworking approach
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A binary feedback scheme for congestion avoidance in computer networks
ACM Transactions on Computer Systems (TOCS)
Design and analysis of a flow control algorithm for a network of rate allocating servers
Design and analysis of a flow control algorithm for a network of rate allocating servers
Deterministic analysis of flow and congestion control policies in virtual circuits
Deterministic analysis of flow and congestion control policies in virtual circuits
A control-theoretic approach to flow control
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Algorithms for unboundedly parallel simulations
ACM Transactions on Computer Systems (TOCS)
Internetworking with TCP/IP (2nd ed.), vol. I
Internetworking with TCP/IP (2nd ed.), vol. I
Open systems interconnection (rev. ed.): its architecture and protocols
Open systems interconnection (rev. ed.): its architecture and protocols
The Operational Analysis of Queueing Network Models
ACM Computing Surveys (CSUR)
Ergodicity Conditions and Congestion Control in Computer Networks
Proceedings of the International Workshop organized by the Commision of the European Communities on Modelling and Performance Evaluation of Computer Systems
Window dynamics
| Hi-index | 0.00 |
A model for a virtual circuit in the form of a tandem of servers that process incoming packets using a FIFO (first-in, first-out) discipline is proposed. The service times are assumed to be known completely. These may differ from packet to packet and from server to server. The model permits a variety of buffer or transit time constraints to be incorporated into the model. Several results that help one to understand the transient behavior of a virtual circuit are presented. On the basis of these results, a number of schemes that may be used to determine the time when the next packet must be sent over the network are presented. Transit delay and throughput are used to evaluate a given schedule. Solutions are given for maximum throughput, minimum transit delay, and maximum throughput under transit delay constraints. It is expected that these results will have a substantial bearing on the study of congestion control policies in computer networks, particularly those based on predicting network behavior.