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

Combinatorial properties of two-level hypernet 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)
Hui-Ling Huang ; Dept. of Inf. Manage., Southern Taiwan Univ. of Technol., Taiwan ; Gen-Huey Chen

The purpose of the paper is to investigate combinatorial properties of the hypernet network. The hypernet network owns two structural advantages: expansibility and equal degree. In addition, it was shown to be efficient in both communication and computation. Since the number of nodes contained in the hypernet network increases very rapidly with expansion level, we emphasize the hypernet network of two levels (denoted by HN(d, 2)) with a practical view. Recently, combinatorial properties such as container (i.e., node-disjoint paths), wide diameter, and fault diameter have received much attention due to their increasing importance and applications in networks. The following results are obtained for HN(d, 2): (1) best containers with width d-1, (2) containers with (maximum) width d, (3) the (d-1)-wide diameter, (4) the d-wide diameter, (5) the (d-2)-fault diameter, and (6) the (d-1)-fault diameter. More specifically, between every two nodes of HN(d, 2), d (or d-1) packets can be transmitted simultaneously with at most D+2 (or D+1) parallel steps, where D=2d+1 is the diameter of HN(d, 2). Besides, the diameter of HN(d, 2) will increase by at most two (or one), if there are at most d-1 (or d-2) node faults. Our results reveal that HN(d, 2) is not only efficient in parallel transmission, but robust in fault tolerance

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:10 ,  Issue: 11 )

Date of Publication:

Nov 1999

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.