On the complexity of rate-distortion optimal streaming of packetized media

Loading...
Thumbnail Image
Date
2004
Authors
Röder, Martin
Cardinal, Jean
Editors
Contact
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
URI (citable link)
DOI (citable link)
ArXiv-ID
International patent number
Link to the license
EU project number
Project
Open Access publication
Restricted until
Title in another language
Research Projects
Organizational Units
Journal Issue
Publication type
Contribution to a conference collection
Publication status
Published in
Data Compression Conference, 2004. Proceedings. DCC 2004. - IEEE, 2004. - pp. 192-201. - ISBN 0-7695-2082-0
Abstract
We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For a single data unit, we prove that the problem is NP-hard and provide efficient branch and bound algorithms that are in practice much faster than the best known solution. For a group of interdependent data units, we show how to compute optimal solutions with branch and bound algorithms. The branch and bound algorithms for a group of data units are slower than the current state of the art, the heuristic sensitivity adaptation algorithm, but provide a significantly better rate-distortion performance in many real-world situations.
Summary in another language
Subject (DDC)
004 Computer Science
Keywords
Conference
Data Compression Conference, 2004. DCC 2004, Snowbird, UT, USA
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690RÖDER, Martin, Jean CARDINAL, Raouf HAMZAOUI, 2004. On the complexity of rate-distortion optimal streaming of packetized media. Data Compression Conference, 2004. DCC 2004. Snowbird, UT, USA. In: Data Compression Conference, 2004. Proceedings. DCC 2004. IEEE, pp. 192-201. ISBN 0-7695-2082-0. Available under: doi: 10.1109/DCC.2004.1281464
BibTex
@inproceedings{Roder2004compl-23033,
  year={2004},
  doi={10.1109/DCC.2004.1281464},
  title={On the complexity of rate-distortion optimal streaming of packetized media},
  isbn={0-7695-2082-0},
  publisher={IEEE},
  booktitle={Data Compression Conference, 2004. Proceedings. DCC 2004},
  pages={192--201},
  author={Röder, Martin and Cardinal, Jean and Hamzaoui, Raouf}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/23033">
    <dcterms:title>On the complexity of rate-distortion optimal streaming of packetized media</dcterms:title>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:bibliographicCitation>Proceedings - DCC 2004, Data Compression Conference : March 23 - 25, 2004, Snowbird, Utah / ed. by James A. Storer ... - Los Alamitos, Calif. [u.a.] : IEEE Computer Society, 2004. - S. 192-201. - ISBN 0-7695-2082-0</dcterms:bibliographicCitation>
    <dc:rights>terms-of-use</dc:rights>
    <dc:contributor>Cardinal, Jean</dc:contributor>
    <dc:contributor>Hamzaoui, Raouf</dc:contributor>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23033/2/roeder_230338.pdf"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-05-27T09:03:14Z</dc:date>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:abstract xml:lang="eng">We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For a single data unit, we prove that the problem is NP-hard and provide efficient branch and bound algorithms that are in practice much faster than the best known solution. For a group of interdependent data units, we show how to compute optimal solutions with branch and bound algorithms. The branch and bound algorithms for a group of data units are slower than the current state of the art, the heuristic sensitivity adaptation algorithm, but provide a significantly better rate-distortion performance in many real-world situations.</dcterms:abstract>
    <dc:contributor>Röder, Martin</dc:contributor>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/23033"/>
    <dc:creator>Cardinal, Jean</dc:creator>
    <dc:creator>Hamzaoui, Raouf</dc:creator>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Röder, Martin</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-05-27T09:03:14Z</dcterms:available>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23033/2/roeder_230338.pdf"/>
    <dc:language>eng</dc:language>
    <dcterms:issued>2004</dcterms:issued>
  </rdf:Description>
</rdf:RDF>
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Contact
URL of original publication
Test date of URL
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
Yes
Refereed