Handbook of combinatorics (vol. 1)
Handbook of combinatorics (vol. 1)
An analytic study of caching in computer systems
Journal of Parallel and Distributed Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Fractal Nature of WWW and Its Application to Cache Modeling
On the Fractal Nature of WWW and Its Application to Cache Modeling
Characteristics of WWW Client-based Traces
Characteristics of WWW Client-based Traces
Source coding and graph entropies
IEEE Transactions on Information Theory
Multilevel diversity coding with distortion
IEEE Transactions on Information Theory
A hybrid network coding technique for single-hop wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Nonlinear index coding outperforming the linear optimum
IEEE Transactions on Information Theory
Index coded repetition-based MAC in vehicular ad-hoc networks
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Network coding awareness based fairly scheduling protocol in wireless network
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
On the index coding problem and its relation to network coding and matroid theory
IEEE Transactions on Information Theory
Efficient processing of requests with network coding in on-demand data broadcast environments
Information Sciences: an International Journal
Hi-index | 0.12 |
The Informed-Source Coding On Demand (ISCOD)approach for efficiently supplying nonidentical data from a central server to multiple caching clients over a broadcast channel is presented. The key idea underlying ISCOD is the joint exploitation of the data blocks already cached by each client, the server's full knowledge of client-cache contents and client requests, and the fact that each client only needs to be able to derive the blocks requested by it rather than all the blocks ever transmitted or even the union of the blocks requested by the different clients. We present two-phase ISCOD algorithms: the server first creates ad-hoc error-correction sets based on its knowledge of client states; next, it uses erasure-correction codes to construct the data for transmission. Each client uses its cached data and the received supplemental data to derive its requested blocks. The result is up to a several-fold reduction in the amount of transmitted supplemental data. Also, we define k-partial cliques in a directed graph and cast ISCOD in terms of partial-clique covers.