Conference proceeding
Deadlock-free prefix multicasting in irregular networks
PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS
01 Jan 2001
Abstract
A deadlock-free multicast scheme called prefix multicasting in it-regular networks is studied. In a prefix routing, a compact routing table is associated with each node (processor). Basically, each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a prefix of the label of the destination node. Node and channel labeling in an irregular network are done by using a pre-defined spanning tree which may or may not be minimum. The routing process follows a two-phase process of going up and then down along the spanning tree, with a possible cross channel between two branches of the tree between two phases. It is shown that the proposed routing scheme is deadlock- and livelock-free. The approach is extended to multicasting in which the multicast packet is first forwarded to the longest common prefix (LCP) of destinations in the multicast. The packet is then treated as a multi-head worm that can split at branches of the spanning tree as the packet is forwarded down the tree.
Metrics
9 Record Views
Details
- Title
- Deadlock-free prefix multicasting in irregular networks
- Creators
- J WuL Sheng
- Contributors
- E Sha (Editor)
- Publication Details
- PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS
- Publisher
- International Society Computer S & Their Applications (Isca)
- Number of pages
- 6
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Mathematics
- Identifiers
- 991019173789104721
UN Sustainable Development Goals (SDGs)
This output has contributed to the advancement of the following goals:
Source: InCites
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Web of Science research areas
- Computer Science, Artificial Intelligence
- Computer Science, Information Systems
- Computer Science, Theory & Methods