DMCA
The Loss Path Multiplicity Problem in Multicast Congestion Control (1998)
Cached
Download Links
- [ftp.sprintlabs.com]
- [gaia.cs.umass.edu]
- [gaia.cs.umass.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | in Proc. of IEEE Infocom |
| Citations: | 57 - 7 self |
BibTeX
@INPROCEEDINGS{Bhattacharyya98theloss,
author = {Supratik Bhattacharyya and Don Towsley and Jim Kurose},
title = {The Loss Path Multiplicity Problem in Multicast Congestion Control},
booktitle = {in Proc. of IEEE Infocom},
year = {1998},
pages = {856--863}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
An important concern for source-based multicast congestion control algorithms is the loss path multiplicity (LPM) problem that arises because a transmitted packet can be lost on one or more of the many end-to-end paths in a multicast tree. Consequently, if a multicast source's transmission rate is regulated according to loss indications from receivers, the rate may be completely throttled as the number of loss paths increases. In this paper, we analyze a family of additive increase multiplicative decrease congestion control algorithms and show that, unless careful attention is paid to the LPM problem, the average session bandwidth of a multicast session may be reduced drastically as the size of the multicast group increases. This makes it impossible to share bandwidth in a max-min fair manner among unicast and multicast sessions. We show that max-min fairness can be acheived however, if every multicast session regulates its rate according to the most congested end-to-end path in its mu...
Keyphrases
loss path multiplicity problem multicast congestion control multicast session max-min fairness transmission rate loss indication loss path multiplicity important concern multicast source transmitted packet average session bandwidth multicast group many end-to-end path lpm problem share bandwidth max-min fair manner source-based multicast congestion control algorithm careful attention loss path multicast tree congested end-to-end path
