Cart (Loading....) | Create Account
Close category search window

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
$31 $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)
Srinivas, A.M. ; Int. Inst. of Inf. Technol., Hyderabad, India ; Pandey, M. ; Garimella, R.M.

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

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.