Overlay caching scheme for overlay networks

2003 ◽  
Author(s):  
Minh Tran ◽  
Wallapak Tavanapong
Keyword(s):  
Overlay Networks ◽  
Caching Scheme

scholarly journals An Improved Hybrid Peer-to-Peer System with Caching for Distributed Data Sharing

2012 ◽  
pp. 193-199
Author(s):  
Arpana George
Keyword(s):  
Data Sharing ◽  
System Performance ◽  
Overlay Networks ◽  
Peer To Peer ◽  
The Other ◽  
Peer Networks ◽  
Distributed Data ◽  
Peer To Peer Networks ◽  
Caching Scheme ◽  
Regular Topology

Peer-to-peer overlay networks are widely used in distributed systems. Based on whether a regular topology is maintained among peers, peer-to-peer networks can be divided into two categories: structured peer-to-peer networks in which peers are connected by a regular topology, and unstructured peer-to-peer networks in which the topology is arbitrary. Structured peer-to-peer networks usually can provide efficient and accurate services but need to spend a lot of effort in maintaining the regular topology. On the other hand, unstructured peer-to-peer networks are extremely resilient to the frequent peer joining and leaving but this is usually achieved at the expense of efficiency. The objective of this work is to design a hybrid peer-to-peer system for distributed data sharing which combines the advantages of both types of peer-to-peer networks and minimizes their disadvantages. Also a caching scheme is proposed for the hybrid peer-to-peer system to improve the system performance.

OCS: An effective caching scheme for video streaming on overlay networks

2006 ◽  
Vol 34 (1) ◽  
pp. 25-56 ◽  
Author(s):  
Minh Tran ◽  
Wallapak Tavanapong ◽  
Wanida Putthividhya
Keyword(s):  
Video Streaming ◽  
Overlay Networks ◽  
Caching Scheme

scholarly journals Cache-Aided General Linear Function Retrieval

Entropy ◽  
2020 ◽  
Vol 23 (1) ◽  
pp. 25
Author(s):  
Kai Wan ◽  
Hua Sun ◽  
Mingyue Ji ◽  
Daniela Tuninetti ◽  
Giuseppe Caire
Keyword(s):  
Linear Function ◽  
Linear Functions ◽  
General Linear ◽  
Linear Combinations ◽  
Past Work ◽  
Single File ◽  
Caching Scheme ◽  
Retrieval Scheme ◽  
Data Points ◽  
Coded Caching

Coded Caching, proposed by Maddah-Ali and Niesen (MAN), has the potential to reduce network traffic by pre-storing content in the users’ local memories when the network is underutilized and transmitting coded multicast messages that simultaneously benefit many users at once during peak-hour times. This paper considers the linear function retrieval version of the original coded caching setting, where users are interested in retrieving a number of linear combinations of the data points stored at the server, as opposed to a single file. This extends the scope of the authors’ past work that only considered the class of linear functions that operate element-wise over the files. On observing that the existing cache-aided scalar linear function retrieval scheme does not work in the proposed setting, this paper designs a novel coded caching scheme that outperforms uncoded caching schemes that either use unicast transmissions or let each user recover all files in the library.

Sign in / Sign up

Export Citation Format

Share Document