ACM Home Page
Please provide us with feedback. Feedback
Scalability of multicast delivery for non-sequential streaming access
Full text PdfPdf (269 KB)
Source Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems table of contents
Marina Del Rey, California
SESSION: Performance analysis techniques table of contents
Pages: 97 - 107  
Year of Publication: 2002
ISBN:1-58113-531-9
Also published in ...
Authors
Shudong Jin  Boston University, Boston, MA
Azer Bestavros  Boston University, Boston, MA
Sponsor
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 21,   Citation Count: 8
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/511334.511347
What is a DOI?

ABSTRACT

To serve asynchronous requests using multicast, two categories of techniques---stream merging and periodic broadcasting---have been proposed. For sequential streaming access, where requests are uninterrupted from the beginning to the end of an object, these techniques are highly scalable: the required server bandwidth for stream merging grows logarithmically as request arrival rate, and the required server bandwidth for periodic broadcasting varies logarithmically as the inverse of start-up delay. A sequential access model, however, is inappropriate to model partial requests and client interactivity observed in various streaming access workloads. This paper analytically and experimentally studies the scalability of multicast delivery under a non-sequential access model where requests start at random points in the object. We show that the required server bandwidth for any protocol providing immediate service grows at least as the square root of request arrival rate, and the required server bandwidth for any protocol providing delayed service grows linearly with the inverse of start-up delay. We also investigate the impact of limited client receiving bandwidth on scalability. We optimize practical protocols which provide immediate service to non-sequential requests. The protocols utilize limited client receiving bandwidth, and they are near-optimal in that the required server bandwidth is very close to its lower bound.


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
2
 
3
C. C. Aggarwal, J. L. Wolf, and P. S. Yu. A permutation-based pyramid broadcasting scheme for video-on-demand systems. In Proceedings of ICMCS, 1996.
4
 
5
K. C. Almeroth and M. H. Ammar. The use of multicast delivery to provide a scalable and interactive video-on-demand service. IEEE Journal on Selected Areas in Communications, 14:1110-1122, 1996.
 
6
A. Bar-Noy, J. Goshi, R. E. Ladner, and K. Tam. Comparison of stream merging algorithms for media-on-demand. In Proceedings of MMCN, January 2002.
 
7
8
 
9
Y. Cai, K. A. Hua, and K. Vu. Optimizing patching performance. In Proceedings of MMCN, 1999.
 
10
 
11
 
12
M. Chesire, A. Wolman, G. Voelker, and H. Levy. Measurement and analysis of a streaming workload. In Proceedings of USITS, March 2001.
 
13
T. Chiueh and C. Lu. A periodic broadcasting approach to video-on-demand service. In Proceedings of MMCN, 1995.
 
14
E. G. Coffman, J. P. Jelenhovic, and P. Momcilovic. Provably efficient stream merging. In Proceedings of Web Caching Workshop, June 2001.
 
15
 
16
 
17
D. Eager, M. Vernon, and J. Zahorjan. Minimizing bandwidth requirements for on-demand data delivery. In Proceedings of MIS, 1998.
18
 
19
D. Eager, M. Vernon, and J. Zahorjan. Bandwidth skimming: A technique for cost-efficient video-on-demand. In Proceedings of MMCN, January 2000.
 
20
 
21
L. Gao and D. Towsley. Efficient schemes for broadcasting popular videos. In Proceedings of NOSSDAV, June 1998.
 
22
23
 
24
 
25
N. Harel, V. Vellanki, A. Chervenak, G. Abowd, and U. Ramachandran. Workload of a media-enhanced classroom server. In Proceedings of Workshop on Workload Characterization, 1999.
 
26
A. Hu. Video-on-demand broadcasting protocols: A comprehensize study. In Proceedings of INFOCOM, April 2001.
27
28
 
29
L. Juhn and L. Tseng. Harmonic broadcasting for video-on-demand service. IEEE Transactions on Broadcasting, 44(1):100-105, 1998.
 
30
 
31
V. O. Li, W. Liao, X. Qiu, and E. Wong. Performance model of interactive video-on-demand systems. IEEE Journal on Selected Areas in Communications, 14:1099-1109, 1996.
 
32
33
 
34
J. Padhye and J. Kurose. An empirical study of client interactions with a continuous-media courseware server. In Proceedings of NOSSDAV, June 1998.
 
35
J. Paris. An interactive broadcasting protocol for video-on-demand. In Proceedings of IPCCC, April 2001.
 
36
 
37
 
38
J. Paris, S. W. Carter, and D. D. E. Long. A hybrid broadcasting protocol for video on demand. In Proceedings of MMCN, 1999.
 
39
J. Paris, S. W. Carter, and D. D. E. Long. A reactive broadcasting protocol for video on demand. In Proceedings of MMCN, January 2000.
40
 
41
S. Sen, L. Gao, J. Rexford, and D. Towsley. Optimal patching schemes for efficient multimedia streaming. In Proceedings of NOSSDAV, June 1999.
 
42
S. Sen, L. Gao, and D. Towsley. Frame-based periodic broadcast and fundamental resource tradeoffs. In Proceedings of IPCCC, April 2001.
 
43
S. Viswanathan and T. Imielinski. Pyramid broadcasting for video on demand service. In Proceedings of MMCN, 1995.
 
44
Y. Zhao, D. Eager, and M. Vernon. Efficient delivery techniques for variable bit rate multimedia. In Proceedings of MMCN, January 2002.

CITED BY  8
Collaborative Colleagues:
Shudong Jin: colleagues
Azer Bestavros: colleagues