Abstract
Dispersity multicasting is an extension of dispersity routing for multicast communication. In dispersity multicasting, m arc-disjoint subtrees are used for source-destinations message delivery. If the bottleneck flow control is applied to each of the m arc-disjoint subtrees, there might still exist extra bandwidth for the multicast communication. To exploit the extra bandwidth, we introduce the concept of virtual connections. In this paper, we design a flow control algorithm for the availablebit-rate dispersity multicasting with two arc-disjoint subtrees and one virtual connection. Issues for applying the algorithm to ATM networks are discussed. Simulation studies show that, in general, our algorithm enhances the throughput of dispersity multicasting.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 9th International Conference on Computer Communications and Networks, ICCCN 2000 |
| Editors | Ton Engbersen, E. K. Park |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 598-603 |
| Number of pages | 6 |
| ISBN (Electronic) | 0780364945 |
| DOIs | |
| Publication status | Published - 2000 |
| Externally published | Yes |
| Event | 9th International Conference on Computer Communications and Networks, ICCCN 2000 - Las Vegas, United States Duration: 16 Oct 2000 → 18 Oct 2000 |
Publication series
| Name | Proceedings - International Conference on Computer Communications and Networks, ICCCN |
|---|---|
| Volume | 2000-October |
| ISSN (Print) | 1095-2055 |
Conference
| Conference | 9th International Conference on Computer Communications and Networks, ICCCN 2000 |
|---|---|
| Country/Territory | United States |
| City | Las Vegas |
| Period | 16/10/00 → 18/10/00 |
Bibliographical note
Publisher Copyright:© 2000 IEEE.
Keywords
- Available-bit-rate point-tomultlpointconnections
- Dispersity routing