TY - JOUR
T1 - Coding on demand by an Informed Source (ISCOD) for efficient broadcast of different supplemental data to caching clients
AU - Birk, Yitzhak
AU - Kol, Tomer
N1 - Funding Information:
Manuscript received March 14, 2005; revised January 15, 2006. This work was supported in part by a grant from News Data Systems Ltd. The material in this correspondence was presented in part at INFOCOM, San Francisco, CA, March 1998. Y. Birk is with the Technion–Israel Institute of Technology, Technion City, Haifa 32000, Israel (e-mail: [email protected]). T. Kol was with the Electrical Engineering Department, Technion–Israel Institute of Technology, Technion City, Haifa 32000, Israel. He is now with the IBM Research (e-mail: [email protected]). Communicated by R. Srikant, Guest Editor. Digital Object Identifier 10.1109/TIT.2006.874540 Fig. 1. Data disseminated by a server to caching clients via a broadcast channel. A separate, usually much slower, return channel, is also included.
PY - 2006/6
Y1 - 2006/6
N2 - 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.
AB - 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.
KW - Caching clients
KW - Clique cover
KW - Communication complexity
KW - Error-correcting codes
KW - Information dissemination
KW - Informed-Source Coding On Demand (ISCOD)
KW - Maximum matching
KW - Multicast
KW - k-partial clique
UR - http://www.scopus.com/inward/record.url?scp=33745179498&partnerID=8YFLogxK
U2 - 10.1109/TIT.2006.874540
DO - 10.1109/TIT.2006.874540
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:33745179498
SN - 0018-9448
VL - 52
SP - 2825
EP - 2830
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 6
ER -