Abstract
An analysis is provided of queuing models in virtual route networks for which a pacing window flow control mechanism is used. An input queue is introduced to describe the waiting system where messages prevented from entering the network are stored in first-come, first-served manner. Both finite and infinite capacity are considered. The model leads to a Markovian queuing system, which is fully solved by matrix-geometric methods. The analytical results show that the optimal window size which maximizes the power criterion including the admission delay is nearly twice the number of hops (nodes of the network) for the model with infinite input-queue capacity. This rule of thumb also applies to the finite-capacity model with certain restrictions. Simulations are presented to verify the analytical results. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
