skip to main content
10.1145/1005847.1005856acmconferencesArticle/Chapter ViewAbstractPublication PagesmmsysConference Proceedingsconference-collections
Article

Managing a portfolio of overlay paths

Published: 16 June 2004 Publication History

Abstract

In recent years, several architectures have been proposed and developed for supporting streaming applications that take advantage of multiple paths through the network simultaneously. We consider the problem of computing a set of paths and the relative amounts of data conveyed through them in order to provide the desired level of performance for data streams. Given the expectation, variance, and covariance of an appropriate metric of interest for overlay links, we attempt to solve the underlying resource allocation problem by applying methods used in managing a finance portfolio. We observe that the flow allocation problem requires constrained application of these methods, and we discuss the tractability of enforcing the constraints. We finally present some simulation results to evaluate the effectiveness of our proposed techniques.

References

[1]
D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris. Resilient Overlay Networks. In Proceedings of ACM Symposium on Operating Systems Principles, 2001.
[2]
R. E. Bailey. Economics of Financial Markets. 2003.
[3]
H. Balakrishnan, H. S. Rahul, and S. Seshan. An Integrated Congestion Management Architecture for Internet Hosts. In Proceedings of SIGCOMM, 1999.
[4]
S. Banerjee, B. Bhattacharjee, and C. Kommareddy. Scalable application layer multicast. In Proceedings of ACM SIGCOMM, 2002.
[5]
A. C. Begen, Y. Altunbasak, and O. Ergun. Multi-path selection for multiple description encoded video streaming. In Proceedings of IEEE International Conference on Communications, 2003.
[6]
J. Byers, J. Considine, M. Mitzenmacher, and S. Rost. Informed Content Delivery Across Adaptive Overlay Networks. In Proceedings of ACM SIGCOMM, 2002.
[7]
M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh. SplitStream: High-bandwidth multicast in a cooperative environment. In 19th ACM Symposium on Operating Systems Principles, 2003.
[8]
W. C. Cheng, C. Chou, L. Golubchik, S. Khuller, and Y. Wan. Large-scale Data Collection: a Coordinated Approach. In Proceedings of IEEE INFOCOM, 2003.
[9]
M. Claypool and J. Riedl. End-to-End Quality in Multimedia Applications. In Chapter 40 in Handbook on Multimedia Computing, 1999.
[10]
M. Claypool and J. Tanner. The Effects of Jitter on the Perceptual Quality of Video. In Proceedings of ACM Multimedia, 1999.
[11]
A. B. Downey. Evidence for long tailed distributions in the internet. In In Proc. of the ACM SIGCOMM Internet Measurement Workshop, 2001.
[12]
K. Harfoush, A. Bestavros, and J. Byers. Robust Identification of shared losses using End-to-End unicast probes. Proceedings of IEEE International Conference on Network Protocols, Oct. 2000.
[13]
R. Hogg and E. Tanis. Probability and Statistical Inference. Prentice Hall, Inc., 2001.
[14]
Y. hua Chu, S. G. Rao, and H. Zhang. A case for end system multicast. In Proceedings of SIGMETRICS, 2000.
[15]
A. B. King. Speed Up Your Site: Web Site Optimization. New Riders, 2003.
[16]
M. Levy and Y. Ritov. Portfolio Optimization with Many Assets: The Importance of Short-Selling, 2001.
[17]
Q. Ma and P. Steenkiste. On path selection for traffic with bandwidth guarantees. In Proceedings of IEEE International Conference on Network Protocols, Atlanta, GA, 1997.
[18]
Z. Ma, H.-R. Shao, and C. Shen. A new Multi-path selection Scheme for Video Streaming on overlay networks. In Proceedings of IEEE International Conference on Communications, 2004.
[19]
T. Nguyen and A. Zakhor. Path Diversity with Forward Error Correction (PDF) System for Packet Switched Networks. In Proceedings of IEEE INFOCOM, 2003.
[20]
V. Padmanabhan, H. Wang, P. Chou, and K. Sripanidkulchai. Distributing streaming media content using cooperative networking. In Proceedings of NOSSDAV, 2002.
[21]
V. N. Padmanabhan, H. J. Wang, and P. A. Chou. Resilient Peer-to-Peer Streaming. In Proceedings of IEEE International Conference on Network Protocols, 2003.
[22]
S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Application-level Multicast using Content-Addressable Networks. In Proceedings of Networked Group Communications, 2001.
[23]
D. Rubenstein, J. Kurose, and D. Towsley. Detecting shared congestion of flows via end-to-end measurement. IEEE/ACM Transactions on Networking, 10(3), 2002.
[24]
S. Savage, A. Collins, E. Hoffman, J. Snell, and T. E. Anderson. The End-to-End Effects of Internet Path Selection. In SIGCOMM, pages 289--299, 1999.
[25]
S. Shuzhong. What is CAPM without Short Selling? In NTU International Conference on Finance, 2002.
[26]
S. Vavasis. Nonlinear Optimization: Complexity Issues. Oxford Science, New York, 1991.
[27]
E. Veloso, V. Almeida, W. Meira, A. Bestavros, and S. Jin. A hierarchical characterization of a live streaming media workload. In Internet Measurement Workshop, 2002.
[28]
O. Verscheure, P. Frossard, and M. Hamdi. MPEG-2 Video Services over Packet Networks: Joint Effect of Encoding Rate and Data Loss on User-Oriented QoS. In Proceedings of NOSSDAV, 1998.
[29]
X. Wang and H. Schulzrinne. Adaptive Reservation: A New Framework for Multimedia Adaptation. In IEEE International Conference on Multimedia and Expo (II), 2000.
[30]
R. M. Z. Bodie. Finance. 2000.
[31]
M. Zhang, J. Lai, A. Krishnamurthy, L. Peterson, and R. Wang. Improving Performance and Reliability with Multi-Path TCP. In Proceedings of Usenix Annual Technical Conference, 2004.
[32]
Y. Zhang, N. Duffield, V. Paxson, and S. Shenkar. On the constancy of internet path properties. Proceedings of Internet Measurement Workshop, Nov. 2001.
[33]
S. Q. Zhuang, B. Y. Zhao, A. D. Joseph, R. H. Katz, and J. Kubiatowicz. Bayeux: An Architecture for Scalable and Fault-tolerant Wide-Area Data Dissemination. In Proceedings of NOSSDAV, 2001.

Cited By

View all
  • (2013)On Issues of Multi-path Routing in Overlay - Networks Using Optimization AlgorithmsRecent Progress in Data Engineering and Internet Technology10.1007/978-3-642-28807-4_61(435-440)Online publication date: 2013
  • (2010)Efficient and dynamic routing topology inference from end-to-end measurementsIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2009.202253818:1(123-135)Online publication date: 1-Feb-2010
  • (2008)Network Routing Topology Inference from End-to-End MeasurementsIEEE INFOCOM 2008 - The 27th Conference on Computer Communications10.1109/INFOCOM.2008.16(36-40)Online publication date: Apr-2008

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
NOSSDAV '04: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
June 2004
168 pages
ISBN:1581138016
DOI:10.1145/1005847
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 June 2004

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. overlay networks
  2. video streaming

Qualifiers

  • Article

Conference

NOSSDAV04
Sponsor:

Acceptance Rates

Overall Acceptance Rate 118 of 363 submissions, 33%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)1
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2013)On Issues of Multi-path Routing in Overlay - Networks Using Optimization AlgorithmsRecent Progress in Data Engineering and Internet Technology10.1007/978-3-642-28807-4_61(435-440)Online publication date: 2013
  • (2010)Efficient and dynamic routing topology inference from end-to-end measurementsIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2009.202253818:1(123-135)Online publication date: 1-Feb-2010
  • (2008)Network Routing Topology Inference from End-to-End MeasurementsIEEE INFOCOM 2008 - The 27th Conference on Computer Communications10.1109/INFOCOM.2008.16(36-40)Online publication date: Apr-2008

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media