File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: rStream: Resilient and optimal peer-to-peer streaming with rateless codes

TitlerStream: Resilient and optimal peer-to-peer streaming with rateless codes
Authors
KeywordsDistributed applications
Distributed networks
Media streaming
Peer-to-peer protocol
Issue Date2008
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tpds
Citation
Ieee Transactions On Parallel And Distributed Systems, 2008, v. 19 n. 1, p. 77-92 How to Cite?
AbstractDue to the lack of stability and reliability in peer-topeer networks, multimedia streaming over peer-to-peer networks represents several fundamental engineering challenges. First, multimedia streaming sessions need to be resilient to volatile network dynamics and node departures that are characteristic in peer-to-peer networks. Second, they need to take full advantage of the existing bandwidth capacities, by minimizing the delivery of redundant content and the need for content reconciliation among peers during streaming. Finally, streaming peers need to be optimally selected to construct high-quality streaming topologies, so that end-to-end latencies are taken into consideration. The original contributions of this paper are two-fold. First, we propose to use a recent coding technique, referred to as rateless codes, to code the multimedia bitstreams before they are transmitted over peer-to-peer links. The use of rateless codes eliminates the requirements of content reconciliation, as well as the risks of delivering redundant content over the network. Rateless codes also help the streaming sessions to adapt to volatile network dynamics. Second, we minimize end-to-end latencies in streaming sessions by optimizing towards a latency-related objective in a linear optimization problem, the solution to which can be efficiently derived in a decentralized and iterative fashion. The validity and effectiveness of our new contributions are demonstrated in extensive experiments in emulated realistic peer-to-peer environments with our rStream implementation. © 2008 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/92626
ISSN
2015 Impact Factor: 2.661
2015 SCImago Journal Rankings: 1.590
References

 

DC FieldValueLanguage
dc.contributor.authorWu, Cen_HK
dc.contributor.authorLi, Ben_HK
dc.date.accessioned2010-09-17T10:52:17Z-
dc.date.available2010-09-17T10:52:17Z-
dc.date.issued2008en_HK
dc.identifier.citationIeee Transactions On Parallel And Distributed Systems, 2008, v. 19 n. 1, p. 77-92en_HK
dc.identifier.issn1045-9219en_HK
dc.identifier.urihttp://hdl.handle.net/10722/92626-
dc.description.abstractDue to the lack of stability and reliability in peer-topeer networks, multimedia streaming over peer-to-peer networks represents several fundamental engineering challenges. First, multimedia streaming sessions need to be resilient to volatile network dynamics and node departures that are characteristic in peer-to-peer networks. Second, they need to take full advantage of the existing bandwidth capacities, by minimizing the delivery of redundant content and the need for content reconciliation among peers during streaming. Finally, streaming peers need to be optimally selected to construct high-quality streaming topologies, so that end-to-end latencies are taken into consideration. The original contributions of this paper are two-fold. First, we propose to use a recent coding technique, referred to as rateless codes, to code the multimedia bitstreams before they are transmitted over peer-to-peer links. The use of rateless codes eliminates the requirements of content reconciliation, as well as the risks of delivering redundant content over the network. Rateless codes also help the streaming sessions to adapt to volatile network dynamics. Second, we minimize end-to-end latencies in streaming sessions by optimizing towards a latency-related objective in a linear optimization problem, the solution to which can be efficiently derived in a decentralized and iterative fashion. The validity and effectiveness of our new contributions are demonstrated in extensive experiments in emulated realistic peer-to-peer environments with our rStream implementation. © 2008 IEEE.en_HK
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tpdsen_HK
dc.relation.ispartofIEEE Transactions on Parallel and Distributed Systemsen_HK
dc.subjectDistributed applicationsen_HK
dc.subjectDistributed networksen_HK
dc.subjectMedia streamingen_HK
dc.subjectPeer-to-peer protocolen_HK
dc.titlerStream: Resilient and optimal peer-to-peer streaming with rateless codesen_HK
dc.typeArticleen_HK
dc.identifier.emailWu, C:cwu@cs.hku.hken_HK
dc.identifier.authorityWu, C=rp01397en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TPDS.2007.1119en_HK
dc.identifier.scopuseid_2-s2.0-37149007634en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-37149007634&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume19en_HK
dc.identifier.issue1en_HK
dc.identifier.spage77en_HK
dc.identifier.epage92en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridWu, C=15836048100en_HK
dc.identifier.scopusauthoridLi, B=23467418800en_HK
dc.identifier.citeulike6881514-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats