Please use this identifier to cite or link to this item:
|Title:||APRICOD: An access-pattern-driven distributed caching middleware for fast content discovery of noncontinuous media access||Authors:||Zhao, Z.W.
Noncontinuous media access
|Issue Date:||May-2013||Citation:||Zhao, Z.W., Ooi, W.T. (2013-05). APRICOD: An access-pattern-driven distributed caching middleware for fast content discovery of noncontinuous media access. ACM Transactions on Multimedia Computing, Communications and Applications 9 (2) : -. ScholarBank@NUS Repository. https://doi.org/10.1145/2457450.2457457||Abstract:||Content discovery is a major source of latency in peer-to-peer (P2P) media streaming systems, especially in the presence of noncontinuous user access, such as random seek in Video-on-Demand (VoD) streaming and teleportation in a Networked Virtual Environment (NVE). After the aforementioned user interactions, streaming systems often need to initiate the content discovery process to identify where to retrieve the requested media objects. Short content lookup latency is demanded to ensure smooth user experience. Existing content discovery systems based on either a Distributed Hash Table (DHT) or gossip mechanism cannot cope with noncontinuous access efficiently due to their long lookup latency. In this work, we propose an access-pattern-driven distributed caching middleware named APRICOD, which caters for fast and scalable content discovery in peer-to-peer media streaming systems, especially when user interactions are present. APRICOD exploits correlations among media objects accessed by users, and adapts to shift in the user access pattern automatically. We first present a general APRICOD design that can be used with any existing content discovery system. We then present an implementation of APRICOD on top of Pastry, which we use to evaluate APRICOD. Our evaluation in a 1024-node system, using a Second Life trace with 5, 735 users and a VoD trace with 54 users, shows that APRICOD can effectively resolve all continuous access queries with a single hop deterministically with node failure as an exception, and resolve noncontinuous access queries with a single hop with high probability. © 2013 ACM.||Source Title:||ACM Transactions on Multimedia Computing, Communications and Applications||URI:||http://scholarbank.nus.edu.sg/handle/10635/77821||ISSN:||15516857||DOI:||10.1145/2457450.2457457|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 27, 2020
WEB OF SCIENCETM
checked on Mar 19, 2020
checked on Mar 29, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.