ACM Home Page
Please provide us with feedback. Feedback
Fine-grained layered multicast with STAIR
Full text PdfPdf (636 KB)
Source IEEE/ACM Transactions on Networking (TON) archive
Volume 14 ,  Issue 1  (February 2006) table of contents
Pages: 81 - 93  
Year of Publication: 2006
ISSN:1063-6692
Authors
John W. Byers  Department of Computer Science, Boston University, Boston, MA
Gu-In Kwon  School of Computer Science and Engineering, Inha University, Incheon, South Korea
Michael Luby  Digital Fountain, Inc., Fremont, CA
Michael Mitzenmacher  Harvard University, Cambridge, MA
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 52,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: 10.1109/TNET.2005.863479

ABSTRACT

Traditional approaches to receiver-driven layered multicast have advocated the benefits of cumulative layering, which can enable coarse-grained congestion control that complies with TCP-friendliness equations over large time scales. In this paper, we quantify the costs and benefits of using noncumulative layering and present a new, scalable multicast congestion control scheme called STAIR that embodies this approach. Our first main contribution is a set of performance criteria on which we base a comparative evaluation of layered multicast schemes. In contrast to the conventional wisdom, we demonstrate that fine-grained rate adjustment can be achieved with only modest increases in the number of layers, aggregate bandwidth consumption and control traffic. The STAIR protocol that we subsequently define and evaluate is a multiple rate congestion control scheme that provides a fine-grained approximation to the behavior of TCP additive increase/multiplicative decrease (AIMD) on a per-receiver basis.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
[1] D. Bansal and H. Balakrishnan, "Binomial congestion control algorithms," in Proc. IEEE INFOCOM, Anchorage, AK, Apr. 2001, pp. 631-640.
 
2
[2] J. Byers, M. Handley, G. Horn, M. Luby, and L. Vicisano. (2000, Aug.) More thoughts on reference simulations for reliable multicast congestion control schemes. [Online]. Available: http://www.cs.bu.edu/fac/byers/pubs/mrefsims.ps
 
3
 
4
[4] J. Byers, M. Luby, and M. Mitzenmacher, "Fine-grained layered multicast," in Proc. IEEE INFOCOM, Apr. 2001, pp. 1143-1151.
 
5
[5] J. W. Byers, G. Horn, M. Luby, M. Mitzenmacher, and W. Shaver, "FLID-DL: congestion control for layered multicast," IEEE J. Sel. Areas Commun., vol. 20, no. 8, pp. 1558-1570, Oct. 2002.
 
6
[6] J. W. Byers, M. Luby, and M. Mitzenmacher, "A digital fountain approach to asynchronous reliable multicast," IEEE J. Sel. Areas Commun., vol. 20, no. 8, pp. 1528-1540, Oct. 2002.
 
7
8
 
9
[9] S. Golestani, "Fundamental observations on multicast congestion control in the Internet," in Proc. IEEE INFOCOM, New York, Mar. 1999, pp. 990-1000.
 
10
 
11
12
 
13
[13] M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Efficient erasure correcting codes," IEEE Trans. Information Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
14
 
15
 
16
[16] The network simulator - ns-2. [Online]. Available: http://www.isi.edu/ nsnam/ns
17
18
19
 
20
 
21
[21] L. Vicisano, L. Rizzo, and J. Crowcroft, "TCP-like congestion control for layered multicast data transfer," in Proc. IEEE INFOCOM, San Francisco, CA, Apr. 1998, pp. 996-1003.
 
22
[22] J. Widmer, R. Denda, and M. Mauve, "A survey on TCP-friendly congestion control," IEEE Network, vol. 15, no. 3, pp. 28-37, May 2001.
23
 
24


Collaborative Colleagues:
John W. Byers: colleagues
Gu-In Kwon: colleagues
Michael Luby: colleagues
Michael Mitzenmacher: colleagues