Sciweavers

214 search results - page 13 / 43
» A Fault-tolerant Multicast Routing Algorithm in ATM Networks
Sort
View
IPPS
1996
IEEE
15 years 10 months ago
A Class of Interconnection Networks for Multicasting
Multicast, or one-to-many, communication arises frequently in parallel computing and telecommunication applications. Multicast networks can simultaneously support multiple multicas...
Yuanyuan Yang
IPPS
1997
IEEE
15 years 10 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
INFOCOM
1997
IEEE
15 years 10 months ago
Restricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks
The paper addresses the issue of minimizing the number of nodes involved in routing over a multicast tree and in the maintenance of such a tree in a datagram network. It presents a...
Ehud Aharoni, Reuven Cohen
MMNS
2003
102views Multimedia» more  MMNS 2003»
15 years 7 months ago
A Heuristic Algorithm for the Multi-constrained Multicast Tree
Multicasting is an important communication mechanism for implementing real-time multimedia applications, which usually require the underlying network to provide a number of quality...
Wen-Lin Yang
ECR
2002
165views more  ECR 2002»
15 years 5 months ago
A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups
Many new multimedia applications involve dynamic multiple participants, have stringent endto-end delay requirement and consume large amount of network resources. In this paper, we...
Zhengying Wang, Bingxin Shi, Ling Zou