Abstract
The performance of a network subject to either state dependent or state independent flow control is investigated. In the state dependent case, the flow control policy is a function of the total number of packets for which the controller has not yet received an acknowledgment. In this case it is shown that the optimal flow control is a sliding window mechanism. The effect of the delayed feedback on the network performance as well as the size of the window are studied. The state independent optimal rate is also derived. The performance of the state dependent and state independent flow control policies are compared. Conditions for employing one of the two types of flow control policies for superior end-to-end network performance are discussed. All the results obtained are demonstrated using simple examples.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Bertsekas and R. Gallager,Data Networks (Prentice Hall, Englewood Cliffs, NJ, 1987).
A.D. Bovopoulos and A.A. Lazar, Optimal resource allocation for Markovian queueing networks: The complete information case, Stochastic Models 7 (1991).
A.D. Bovopoulos and A.A. Lazar, Load balancing algorithms for Jacksonian networks with acknowledgment delays,Proc. IEEE INFOCOM'89 Conf., Ottawa, Canada (1989) pp. 749–757.
A.D. Bovopoulos, Resource allocation for Markovian queueing networks: the partial information case, Technical Report WUCS-89-22, Department of Computer Science, Washington University (1989).
A.D. Bovopoulos, Performance evaluation of a traffic control module for ATM networks, Technical Report WUCS-91-22, Department of Computer Science, Washington University (1991).
D. Chiu and R. Jain, Analysis of the increase and decrease algorithms for congestion avoidance in computer networks, Computer Networks and ISDN Systems 17 (1989) 1–14.
D. Comer and R. Yavatkar, FLOWS: Performance guarantees in best effort delivery systems,Proc. IEEE INFOCOM'89 Conf., Ottawa, Canada (1989) pp. 100–109.
M.-T. Hsiao and A.A. Lazar, An extension to Norton's equivalent, Queueing Systems 5 (1989) 401–411.
M.-T. Hsiao and A.A. Lazar, Optimal flow control of multi-class queueing networks with partial information, IEEE Trans. Auto. Control AC-35 (1990) 855–860.
M.-T. Hsiao and A.A. Lazar, Optimal decentralized flow control of Markovian queueing networks with multiple controllers, Performance Evaluation (1991) to appear.
A.A. Lazar, Optimal flow control of a class of queueing networks in equilibrium, IEEE Trans. Auto. Control AC-28 (1983) 1001–1007.
D.G. Luenberger,Linear and Nonlinear Programming, 2nd ed. (Addison-Wesley, 1984).
K.K. Ramakrishnan and R. Jain, A binary feedback scheme for congestion avoidance in computer networks, ACM Trans. Computer Systems (1990) 158–181.
M. Schwartz,Telecommunications Networks, Protocols, Modeling and Analysis (Addison-Wesley, 1987).
J.G. Shanthikumar and D. Yao, Second-order properties of the throughput of a closed queueing network, Math. Oper. Res. 13 (1988) 524–534.
J.G. Shanthikumar and D. Yao, Second-order stochastic properties in queueing systems, Proc. IEEE 77 (1989) 162–170.
J. Walrand,An Introduction to Queueing Networks (Prentice Hall, New Jersey, 1988).
G. Weiss, private communication (1982).
L. Zhang, Designing a new architecture for packet switching communication networks, IEEE Commun. Mag. 25 (1987) 5–12.
L. Zhang, Some thoughts on the packet network architecture, ACM Comput. Commun. Rev. 17 (1987).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bovopoulos, A.D., Lazar, A.A. The effect of delayed feedback information on network performance. Ann Oper Res 36, 101–124 (1992). https://doi.org/10.1007/BF02094326
Issue Date:
DOI: https://doi.org/10.1007/BF02094326