Logo image
Fundamental tradeoffs in distributed algorithms for rate adaptive multimedia streams
Conference proceeding   Open access   Peer reviewed

Fundamental tradeoffs in distributed algorithms for rate adaptive multimedia streams

Vilas Veeraraghavan and Steven Weber
NETWORKING 2007: AD HOC AND SENSOR NETWORKS, WIRELESS NETWORKS, NEXT GENERATION INTERNET, PROCEEDINGS, v 4479, pp 640-651
01 Jan 2007
url
https://doi.org/10.1007/978-3-540-72606-7_55View
Published, Version of Record (VoR)Maybe Open Access (Publisher Bronze) Open

Abstract

Computer Science Computer Science, Theory & Methods Science & Technology Technology Telecommunications
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 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. These tradeoffs are illustrated through extensive simulation results using ns-2.

Metrics

5 Record Views

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#11 Sustainable Cities and Communities

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Web of Science research areas
Computer Science, Theory & Methods
Telecommunications
Logo image