Efficient and flexible parallel retrieval using priority encoded transmission

Authors:
Ramaprabhu Janakiraman;Lihao Xu
Affiliations:
Washington University in St. Louis, St. Louis, MO;Washington University in St. Louis, St. Louis, MO
Venue:
NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
Year:
2004

Citing 4
Cited 1

Summary cache: a scalable wide-area Web cache sharing protocol

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient and scalable on-demand data streaming using UEP codes

MULTIMEDIA '01 Proceedings of the ninth ACM international conference on Multimedia
LT Codes

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science

Optimal rate: delay tradeoffs and delay mitigating codes for multipath routed and network coded networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

Many applications, including web transfers, software distribution, video-on-demand, and peer-to-peer data downloads, require the retrieval of structured documents consisting of multiple components like images, video, and text. Large systems using these applications may be made more scalable by using efficient data distribution techniques like multicast, and by enabling clients to retrieve data from multiple servers in parallel.In this paper we propose a new technique for parallel retrieval of structured documents from multiple servers using priority encoded transmission, which allows some subsets of a transmission to be reconstructed before others. We discuss the application of this technique to bulk and streaming media distribution, and provide performance results from trace-based simulations.