Fundamental tradeoffs in distributed algorithms for rate adaptive multimedia streams

Authors:
Vilas Veeraraghavan;Steven Weber
Affiliations:
Drexel University, Department of ECE, Philadelphia, PA;Drexel University, Department of ECE, Philadelphia, PA
Venue:
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Year:
2007

Citing 3
Cited 0

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 are streaming media connections where the encoding rate is adjusted dynamically (with corresponding changes in media content resolution) in response to changing levels of congestion along the connection. 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, building on our earlier work. We focus on three tradeoffs: i) the tradeoff between maximizing client average quality of service (QoS) and client fairness, ii) the trade-off 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. These tradeoffs are illustrated through extensive simulation results using ns-2.