By Topic

New performance bounds of a class off self-routing 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

1 Author(s)
Chin-Tau Lea ; Sch. of Electr. Eng., Georgia Inst. of Technol., Atlanta, GA, USA

Conventional bounds for the maximum throughput of an unbuffered banyan network and its topology equivalents are based on the parallel path setup (PPS) assumption, i.e. paths are set up simultaneously. But the bounds derived under the PPS assumption can be surpassed with a slight variation on the path setup scheme. The authors study the maximum throughputs of an unbuffered banyan network and its topology equivalents in an incremental path setup (IPS) environment. The results represent the ultimate bounds for the maximum throughputs of unbuffered banyan networks. Although the exact analysis of this problem involves a combinatorial explosion, an approximate analysis is given in this work to verify the simulation results

Published in:

Communications, IEEE Transactions on  (Volume:40 ,  Issue: 3 )