Analysis and Optimization of Pacing Window Flow Control with Admission Delay

概要

論文の詳細を見る
This paper provides a queueing model analysis of virtual route networks for which a pacing window flow control mechanism is employed with an input queue included. The input queue is introduced into the model to describe the waiting system where messages prevented from entering the network are stored in first-come first-serve manner. Both cases of finite and infinite capacity are considered. The model leads to a Markovian queueing system, which is fully solved through appropriate use of matrix-geometric methods. The empirical rule is that the optimum window size which maximizes the power criterion including the admission delay is nearly twice the number of hops (nodes of the network). Simulations are presented to verify the analytical results. Finally, performance comparisons with the sliding window protocol are made. Our results show that although the average number of messages in the network is higher for the pacing window case, when the input queue delay is taken into consideration the overall performance of the pacing window protocol is better than that of the sliding window.
社団法人電子情報通信学会の論文
1996-12-25