By Topic

Performance analysis of computer communication networks with local and global window flow control

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
I. F. Akyildiz ; Sch. of Inf. & Comput. Sci., Georgia Inst. of Technol., Atlanta, GA

A message-switched network with local and global window flow controls is analyzed. Messages arriving to find the global window full or the first destination's local window full are assumed to be lost. Further, if a message from a source system is sent to a destination system of which the local window is full, the message blocks the source system until it can be received from the destination. In that time, no other message can be processed by the source system. An open tandem queueing network model with blocking is developed where the service times are assumed to be general and the scheduling disciplines are first-come, first-served. An approximation algorithm for the effective computation of performance measures, such as the throughput of the system, mean number of messages in the global window, and the mean delay time of the system, is given. The approximation has been validated by several examples; comparing the analytical results with simulation demonstrates good agreement

Published in:

INFOCOM '88. Networks: Evolution or Revolution, Proceedings. Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies, IEEE

Date of Conference:

27-31 Mar 1988