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

Strictly Nonblocking Function-Cast d-Ary Multi-Log Networks under Fanout and Crosstalk Constraints

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)
Yang Wang ; Dept. of Comput. Sci. & Eng., State Univ. of New York, Amherst, NY ; Ngo, H.Q. ; Xiaohong Jiang

We derive conditions which are both necessary and sufficient for the d-ary multi-log switching networks to be f-cast strictly nonblocking under all combinations of fanout and crosstalk constraints. The fanout constraint tells us which stage(s) of the networks has fanout capability. The crosstalk constraint tells us whether or not two routes are allowed to share a link, or are allowed to share a switching element (crosstalk-free or not). The most novel contribution of this paper is the analytical technique, which combines an algebraic view of the d-ary multi-log network with the max-flow min-cut theorem. Our results are more general than previously known results on several fronts: (a) d-ary networks are more general than binary networks, (b) f-cast covers both unicast (f = 1) and broadcast (f = N), (c) both link-blocking and node-blocking are considered in a unified manner, and (d) all combinations of fanout constraints are considered.

Published in:

Communications, 2008. ICC '08. IEEE International Conference on

Date of Conference:

19-23 May 2008

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.