By Topic

Fast reconfigurable 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

2 Author(s)
Chao, C.Y. ; Dept. of Electr. & Comput. Eng., Florida Atlantic Univ., Boca Raton, FL, USA ; Ilyas, M.

Two distributed channel allocation algorithms are presented for a reconfigurable communication network with a multiple-channel link architecture. In this architecture, every switching node can dynamically allocate transmitters and receivers among links to match traffic fluctuations and hence improve the average delay and throughput performance over that of a fixed-link architecture. The authors show that the first algorithm always converges to an optimum configuration while assuming that link may never be saturated and requiring global information on channel allocation. The second algorithm needs local information only and poses no limitation on link capacity but may terminate at suboptimum configurations. The conditions under which the local search algorithm may fail to converge to an optimum configuration is also discussed.<>

Published in:

Computers and Communications, 1989. Conference Proceedings., Eighth Annual International Phoenix Conference on

Date of Conference:

22-24 March 1989