Coding on demand by an Informed Source (ISCOD) for efficient broadcast of different supplemental data to caching clients

IEEE Transactions on Information Theory

Volumn 52, Issue 6, 2006, Pages 2825-2830

  Birk, Yitzhak ^a   Kol, Tomer ^a,b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b IBM RESEARCH   (United States)

Author keywords

Caching clients; Clique cover; Communication complexity; Error correcting codes; Information dissemination; Informed Source Coding On Demand (ISCOD); k partial clique; Maximum matching; Multicast

Indexed keywords

CACHING CLIENTS; CLIQUE COVER; COMMUNICATION COMPLEXITY; ERROR-CORRECTING CODES; INFORMED-SOURCED CODING ON DEMAND (ISCOD); MAXIMUM MATCHING;

ALGORITHMS; CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); ENCODING (SYMBOLS); ERROR CORRECTION; INFORMATION DISSEMINATION; MULTICASTING;

DATA COMMUNICATION SYSTEMS;

EID: 33745179498     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.874540     Document Type: Article

References (17)

1. Backweb Homepage. [Online]. Available: http://www.backweb.com
2. Pointcast Homepage. [Online]. Available: http://www.pointcast.com
3. Starburst Communications Homepage. [Online]. Available: http://www.starburstcom.com
4. Y. Birk and T. Kol, "Informed-source coding-on-demand (ISCOD) over broadcast channels," in Proc. IEEE INFOCOM, San Francisco, CA, 1998, pp. 1257-1264.
5. J. J. Metzner, "An improved broadcast retransmission protocol," IEEE Trans. Commun., vol. 32, pp. 679-683, 1984.
6. K. Sakakibara and M. Kasahara, "A multicast hybrid arq scheme using mds codes and gmd decoding," IEEE Trans. Commun., vol. 43, pp. 2933-2940, Dec. 1995.
7. A. Shiozaki, "Adaptive type-ii hybrid broadcast arq system," IEEE Trans. Commun., vol. 44, pp. 420-422, Apr. 1996.
8. A. A. El-Gamal and T. M. Cover, "Achievable rates for multiple descriptions," IEEE Trans. Inf. Theory, vol. IT-28, pp. 851-857, Nov. 1982.
9. R.W. Yeung, "Multilevel diversity coding with distortion," IEEE Trans. Inform. Theory, vol. 41, pp. 412-422, Mar. 1995.
10. N. Alon and A. Orlitsky, "Source coding and graph entropies," IEEE Trans. Inf. Theory, vol. 42, pp. 1329-1339, Sep. 1996.
11. A. Orlitsky, "Worst-case interactive communication i: Two messages are almost optimal," IEEE Trans. Inf. Theory, vol. 36, pp. 1111-1126, Sep. 1990.
12. (1996) Propogation, Replication and Caching. W3C. [Online]. Available: http://www.w3.org/pub/www/propogation/activity.html
13. C. R. Cunha, A. Bestavros, and M. E. Crovella, "Characteristics of www Client-Based Traces," CS Dept. Boston University, Tech. Rep. BU-CS-95-010, 1995.
14. V. Almeida and A. de Oliveira, "On the Fractal Nature of www and its Application to Cache Modeling," CS Dept. Boston University, Tech. Rep. BU-CS-96-004, 1996.
15. D. Buck and M. Singhal, "An analytic study of caching in computer systems," J. Par. and Distrib. Compt., vol. 32, pp. 205-214, Feb. 1996.
16. R. Graham, M. Grötschel, and L. Lovász, Eds., Handbook of Combinatorics. New York: Elsevier Science B.V, 1995, vol. I.
17. M. R. Garey and D. S. Johnson, Computers and Intracability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.