Shared Content Addressing Protocol (SCAP): Optimizing multimedia content distribution at the transport layer

Schepper, Koen De; Vleeschauwer, Bart De; Hawinkel, Chris; Leekwijck, Werner Van; Famaey, Jeroen; Meerssche, Wim Van de; Turck, Filip De

doi:10.1109/noms.2012.6211912

Cited by 7 publications

(10 citation statements)

References 14 publications

(9 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Shared Content Addressing Protocol (SCAP) is a transport protocol aimed at optimizing the delivery process that allows innetwork intermediary elements to participate in delivering the content [19]. Furthermore it offers support for intermediary caches, multicast-like delivery of shared content requests and announcing deadlines for the delivery of the content.…”

Section: Related Work a Cache Replacement Strategiesmentioning

confidence: 99%

See 1 more Smart Citation

Cooperative Announcement-Based Caching for Video-on-Demand Streaming

Claeys

Bouten

Vleeschauwer

et al. 2016

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

Abstract-Recently, Video-on-Demand (VoD) streaming services like Netflix and Hulu have gained a lot of popularity. This has led to a strong increase in bandwidth capacity requirements in the network. To reduce this network load, the design of appropriate caching strategies is of utmost importance. Based on the fact that, typically, a video stream is temporally segmented into smaller chunks that can be accessed and decoded independently, cache replacement strategies have been developed that take advantage of this temporal structure in the video. In this paper, two caching strategies are proposed that additionally take advantage of the phenomenon of binge watching, where users stream multiple consecutive episodes of the same series, reported by recent user behavior studies to become the everyday behavior. Taking into account this information allows us to predict future segment requests, even before the video playout has started. Two strategies are proposed, both with a different level of coordination between the caches in the network. Using a VoD request trace based on binge watching user characteristics, the presented algorithms have been thoroughly evaluated in multiple network topologies with different characteristics, showing their general applicability. It was shown that in a realistic scenario, the proposed election-based caching strategy can outperform the state-of-the-art by 20% in terms of cache hit ratio while using 4% less network bandwidth.

show abstract

Section: Related Work a Cache Replacement Strategiesmentioning

confidence: 99%

“…The LRU order is used as a final tiebreaker (lines 10-13). When the evicted segment s is a cached segment (s ∈ C), it is removed from the cache and replaced by the new segment v x (lines [18][19][20].…”

Section: Session-aware Cache Replacementmentioning

confidence: 99%

Cooperative Announcement-Based Caching for Video-on-Demand Streaming

Claeys

Bouten

Vleeschauwer

et al. 2016

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

show abstract

“…Shared Content Addressing Protocol (SCAP) is a transport protocol aimed at optimizing the delivery process that allows innetwork intermediary elements to participate in delivering the content [17]. Furthermore it offers support for intermediary caches, multicast-like delivery of shared content requests and announcing deadlines for the delivery of the content.…”

Section: Related Workmentioning

confidence: 99%

An announcement-based caching approach for video-on-demand streaming

Claeys

Bouten

Vleeschauwer³

et al. 2015

2015 11th International Conference on Network and Service Management (CNSM)

View full text Add to dashboard Cite

Abstract-The growing popularity of over the top (OTT) video streaming services has led to a strong increase in bandwidth capacity requirements in the network. By deploying intermediary caches, closer to the end-users, popular content can be served faster and without increasing backbone traffic. Designing an appropriate replacement strategy for such caching networks is of utmost importance to achieve high caching efficiency and reduce the network load. Typically, a video stream is temporally segmented into smaller chunks that can be accessed and decoded independently. This temporal segmentation leads to a strong relationship between consecutive segments of the same video. Therefore, caching strategies have been developed, taking into account the temporal structure of the video. In this paper, we propose a novel caching strategy that takes advantage of clients announcing which videos will be watched in the near future, e.g., based on predicted requests for subsequent episodes of the same TV show. Based on a Video-on-Demand (VoD) production request trace, the presented algorithm is evaluated for a wide range of user behavior and request announcement models. In a realistic scenario, a performance increase of 11% can be achieved in terms of hit ratio, compared to the state-of-the-art.

show abstract

“…Specifying such a deadline profile, rather than associating one deadline for the complete information block the request pertains to (e.g., a file), is typical for streamed information (e.g., audio, speech, video). In [10] an example of such a system is described where the requests specify a byte range (of the memory of the server) and deadlines for the first and last byte of that range. Since in the system of that paper a user is assumed to consume the specified byte range at constant rate, the deadlines for all bytes (i.e., constituents) in that byte range can be determined by linear interpolation.…”

Section: Introductionmentioning

confidence: 99%

“…Since in the system of that paper a user is assumed to consume the specified byte range at constant rate, the deadlines for all bytes (i.e., constituents) in that byte range can be determined by linear interpolation. In the present paper we will provide a mathematical description applicable to any deadline profile, but apply it to the system of [10].…”

Section: Introductionmentioning

confidence: 99%

Scheduling Announced Requests for Streamed Information

Vleeschauwer¹,

Feyaerts²,

Bruneel

et al. 2015

2015 27th International Teletraffic Congress

View full text Add to dashboard Cite

We analyse a scheduling system in which users announce requests for information from a server some time before they actually need this information. Each constituent of the requested information has its own specific deadline, which is characteristic for applications that gradually consume a stream of information (e.g., video). For that purpose, a request fully specifies when the requesting user needs each constituent of this information. Since each user device is equipped with a buffer, the server can exploit this detailed timing information to deliver parts of the requested information upfront. The more the requests are announced in advance, the better the ability of the server to avoid deadline violations. We investigate for a given server capacity via semi-analytical techniques complemented with simulations how much the requests need to be announced in advance to essentially avoid violating all deadlines.

show abstract

Shared Content Addressing Protocol (SCAP): Optimizing multimedia content distribution at the transport layer

Cited by 7 publications

References 14 publications

Cooperative Announcement-Based Caching for Video-on-Demand Streaming

Cooperative Announcement-Based Caching for Video-on-Demand Streaming

An announcement-based caching approach for video-on-demand streaming

Scheduling Announced Requests for Streamed Information

Contact Info

Product

Resources

About