scholarly journals Optimal Linear Coding Schemes for the Secure Decentralized Pliable Index Coding Problem

Author(s):  
Tang Liu ◽  
Daniela Tuninetti
2019 ◽  
Vol 67 (6) ◽  
pp. 3965-3977 ◽  
Author(s):  
Chinmayananda Arunachala ◽  
Vaneet Aggarwal ◽  
B. Sundar Rajan
Keyword(s):  

Sensors ◽  
2020 ◽  
Vol 20 (21) ◽  
pp. 6220
Author(s):  
Tae-Won Ban ◽  
Woongsup Lee ◽  
Jongyeol Ryu

As multimedia traffic has been increasing and is expected to grow more sharply, various technologies using caches have been attracting lots of attention. As one breakthrough technology to deal with the explosively growing traffic, exclusive OR (XOR)-based index coding has been widely investigated because it can greatly enhance the efficiency of network resource by reducing the number of transmissions. In this paper, we investigate how to apply XOR-based index coding to large-scaled practical streaming systems for video traffic that accounts for more than 70% of total Internet traffic. Contrary to most previous studies that have focused on theoretical analysis of optimal performance or development of optimal index coding schemes, our study proposes a new XOR coding-based video streaming (XC). We also propose a new grouping algorithm for creating XC groups while guaranteeing the complete backward compatibility of XC with existing streaming schemes such as unicast (UC), multicast (MC), and broadcast (BC). The performance of the proposed scheme is analyzed in two steps. First, the behavior of video contents in caches at clients is modeled as a Markov chain, and the steady-state probabilities and caching probabilities for each piece of video content are derived. Based on the probabilities, the performance of the proposed system is then analyzed in terms of the average number of connections that each client requires in order to receive one video content. Our numerical results show that the proposed video streaming scheme using XC can reduce the average number of transmissions by up to 18%, compared to the conventional scheme.


Author(s):  
Mohammed Karmoose ◽  
Linqi Song ◽  
Martina Cardone ◽  
Christina Fragouli
Keyword(s):  

Entropy ◽  
2020 ◽  
Vol 22 (7) ◽  
pp. 766
Author(s):  
Nujoom Sageer Karat ◽  
Anoop Thomas ◽  
Balaji Sundar Rajan

For coded caching problems with small buffer sizes and the number of users no less than the amount of files in the server, an optimal delivery scheme was proposed by Chen, Fan, and Letaief in 2016. This scheme is referred to as the CFL scheme. In this paper, an extension to the coded caching problem where the link between the server and the users is error prone, is considered. The closed form expressions for average rate and peak rate of error correcting delivery scheme are found for the CFL prefetching scheme using techniques from index coding. Using results from error correcting index coding, an optimal linear error correcting delivery scheme for caching problems employing the CFL prefetching is proposed. Another scheme that has lower sub-packetization requirement as compared to CFL scheme for the same cache memory size was considered by J. Gomez-Vilardebo in 2018. An optimal linear error correcting delivery scheme is also proposed for this scheme.


Sign in / Sign up

Export Citation Format

Share Document