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

Blocking Bounds for Random Channel Selection on Tree Topologies

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

1 Author(s)
Alanyali, M. ; Dept. of Electr. & Comput. Eng., Boston Univ., Boston, MA

Nonloopy network topologies are considered under the limitation that a channel can be utilized only if it is idle at all neighboring sites. Random channel selection is studied under a standard circuit-switched traffic model. Upper and lower bounds for blocking probabilities are determined via an auxiliary network process whose equilibrium distribution admits a computationally convenient form. By way of another approximate characterization, it is argued that random channel selection incurs vanishing loss of optimality as the number of channels and the traffic load increase in proportion.

Published in:

Information Theory, IEEE Transactions on  (Volume:53 ,  Issue: 12 )

Date of Publication:

Dec. 2007

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.