Fundamental tradeoffs in distributed algorithms for rate adaptive multimedia streams

Authors:
Vilas Veeraraghavan;Steven Weber
Affiliations:
Department of ECE, Drexel University, 3141 Chestnut Street, Philadelphia, PA 19104, United States;Department of ECE, Drexel University, 3141 Chestnut Street, Philadelphia, PA 19104, United States
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2008

Citing 4
Cited 0

The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)

The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
Non-convex optimization and rate control for multi-class services in the Internet

IEEE/ACM Transactions on Networking (TON)
Rate adaptive multimedia streams: optimization and admission control

IEEE/ACM Transactions on Networking (TON)
Fundamental design issues for the future Internet

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rate adaptive multimedia streams adjust the encoding rate dynamically (with corresponding changes in media content resolution) in response to changing levels of congestion along the route. The field of optimization based congestion control has yielded sophisticated distributed algorithms for resource allocation among competing elastic streams. In this work we study the fundamental tradeoffs for a class of optimization based distributed algorithms for rate adaptive streams. We focus on three tradeoffs: (i) the tradeoff between maximizing client average quality of service (QoS) and client fairness, (ii) the tradeoff between granularity of control (both temporal and spatial) and QoS, and (iii) the tradeoff between maximizing the received volume and minimizing the fluctuations in received rate. We illustrate these tradeoffs through extensive ns-2 simulations on two distinct topologies - (i) a single bottleneck like and (ii) a linear network.