By Topic

Transient analysis of finite state space, state dependent M/M/1 queues and their application to adaptive routing in communication networks

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

3 Author(s)
A. M. Srinivas ; Int. Inst. of Inf. Technol., Hyderabad, India ; M. Pandey ; R. Murthy Garimella

This paper provides a method to determine the transient behavior of highly realistic finite state space, state dependent M/M/1 queues. This helps in calculating the time varying mean queue length used by many adaptive algorithms to route data (e.g. packets joining the queue having shortest mean queue length: JSQ algorithm).

Published in:

Information Theory Workshop, 2002. Proceedings of the 2002 IEEE

Date of Conference:

20-25 Oct. 2002