Proxy servers for scalable interactive video support

Fabmi, H.; Latif, Muhammad; Sedigh-Ali, S.; Ghafoor, Arif; Liu, P.; Hsu, Liang H.

doi:10.1109/2.947092

Cited by 51 publications

(29 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As such, a single encoded version of an object would match the bandwidth and format demands of all requests to the object. According to the selection of the portions to cache, we can classify existing algorithms into four categories: sliding-interval caching [2,6,21], prefix caching [10,14,19], segment caching [4,8,28], and rate-split caching [26]. Our scheme is particularly related to the ratesplit caching in the sense that we also partition the stream along the rate axis.…”

Section: Previous Workmentioning

confidence: 99%

See 1 more Smart Citation

A QoS-Based Joint Scheduling and Caching Algorithm for Multimedia Objects

Liu

2004

World Wide Web

View full text Add to dashboard Cite

With the development of the broadband Internet, multimedia services have been widely deployed and contributed to a significant amount of today's Internet traffic. Like normal web objects (e.g., HTML pages and images), media objects can benefit from proxy caching; yet their unique features such as huge size and high bandwidth demand imply that conventional proxy caching strategies have to be substantially revised. Moreover, in the current Internet, clients are highly heterogeneous; it is necessary to differentiate their Quality-of-Service (QoS) requirements in streaming. However, the presence of an intermediate proxy in a streaming system poses great challenges to designers. This paper proposes a novel QoS-based algorithm for media streaming with proxy caching. We employ layered coding and transmission, and jointly consider the problems of caching and scheduling to improve the QoS for the clients. We derive general and effective solutions to the problems and evaluate their performance under various configurations. The results demonstrate that the proposed algorithm can accommodate diverse QoS demands from the clients, and yet satisfy stringent resource limits.

show abstract

Section: Previous Workmentioning

confidence: 99%

“…There has been plenty of works devoted to streaming media caching [1,2,4,[6][7][8]10,12,14,19,[21][22][23]26,28]. Most of them target homogeneous clients, which have identical or similar configurations and capabilities behind a proxy.…”

Section: Previous Workmentioning

confidence: 99%

A QoS-Based Joint Scheduling and Caching Algorithm for Multimedia Objects

Liu

2004

World Wide Web

View full text Add to dashboard Cite

show abstract

“…Some other researchers have considered the disk model, such as the RAID [21] disk model, and multicast [20] for client interactive request support. On the proxy side, some solutions to support client interactive requests for Internet streaming delivery have also been proposed to create additional data files, called summarization [16] or hotspots [9], containing discontinuous but representative scenes of a media object, and cache them separately from the media files. In [16], the proxy is responsible for shot boundary detection and key-frame selection and summarization.…”

Section: Related Workmentioning

confidence: 99%

“…The summarization and media data can be both cached in multiple cooperative proxies. While in [9], the proxy only caches the hotspots to reduce client interaction requests (normally short) to the video servers which house the videos. By relating these summarization and hotspots to the video data, they provide support to fast forward and rewind.…”

Section: Related Workmentioning

confidence: 99%

“…They usually require the creation of additional data files in the proxy or in the media server and can support only a limited set of interactive operations such as fast forward, rewind, and preview [9,16]. None of them provides effective support for jumps, which according to a recent study are among the dominant interactive operations from clients [6].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

DISC: Dynamic Interleaved Segment Caching for Interactive Streaming

Guo

Chen

Xiao

et al.

25th IEEE International Conference on Distributed Computing Systems (ICDCS'05)

View full text Add to dashboard Cite

show abstract

Proxy caching algorithms and implementation for time‐shifted TV services

Wauters

Meerssche

Backx

et al. 2007

Trans Emerging Tel Tech

View full text Add to dashboard Cite

SUMMARYThe increasing popularity of multimedia streaming applications introduces new challenges in content distribution networks (CDNs). Streaming services such as Video on Demand (VoD) or digital television over the Internet (IPTV) are very bandwidth-intensive and cannot tolerate the high start-up delays and poor loss properties of today's Internet. To solve these problems, caching (the initial segment of) popular streams at proxies could be envisaged. This paper presents a novel caching algorithm and architecture for timeshifted television (tsTV) and its implementation, using the IETF's Real-Time Streaming Protocol (RTSP). The algorithm uses sliding caching windows with sizes depending on content popularity and/or distance metrics. The caches can work in stand-alone mode as well as in co-operative mode. This paper shows that the network load can already be reduced considerably using small diskless caches, especially when using co-operative caching. A prototype implementation is detailed and evaluated through performance measurements.

show abstract

Proxy servers for scalable interactive video support

Cited by 51 publications

References 6 publications

A QoS-Based Joint Scheduling and Caching Algorithm for Multimedia Objects

A QoS-Based Joint Scheduling and Caching Algorithm for Multimedia Objects

DISC: Dynamic Interleaved Segment Caching for Interactive Streaming

Proxy caching algorithms and implementation for time‐shifted TV services

Contact Info

Product

Resources

About