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

An Euler-path-based multicasting model for wormhole-routed networks: its applications to damaged 2D Tori and meshes

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)
Tong-Ying Juang ; Dept. of Comput. Sci., Chung-Hua Polytech. Inst., Taiwan ; Yu-Chee Tseng ; Ming-Hour Yang

We develop a new multicasting model for wormhole-routed networks based on the concept of Euler path in graph theory. The model can support multiple multicasts freely from deadlock and can be applied to any network which is Eulerian or is Eulerian after some links being removed. We demonstrate the power of this model by showing its fault-tolerant capability in supporting multicasting in a damaged 2-D torus/meshes with regular fault patterns (such as a single node, block, L-shape, +-shape, U-shape, and H-shape). In this regard, it is the first known multicasting algorithm in the literature with such strong fault-tolerant capability

Published in:

Performance, Computing, and Communications Conference, 1997. IPCCC 1997., IEEE International

Date of Conference:

5-7 Feb 1997

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.