Informed content delivery across adaptive overlay networks

IEEE/ACM Transactions on Networking

Volumn 12, Issue 5, 2004, Pages 767-780

  Byers, John W ^a   Considine, Jeffrey ^a   Mitzenmacher, Michael ^b   Rost, Stanislav ^c  

^a BOSTON UNIVERSITY   (United States)

^b HARVARD UNIVERSITY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; ENCODING (SYMBOLS); NETWORK PROTOCOLS; OPTIMIZATION; RELIABILITY;

ADAPTIVE OVERLAY NETWORKS; BLOOM FILTER; CONTENT DELIVERY; DIGITAL FOUNTAIN; ERASURE CODE; RECONCILIATION;

COMPUTER NETWORKS;

EID: 7244254658     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2004.836103     Document Type: Article

References (32)

1. D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris, "Resilient overlay networks," in Proc. ACM SOSP, Banff, AB, Canada, Oct. 2001, pp. 131-145.
2. S. Banerjee, S. Lee, B. Bhattacharjee, and A. Srinivasan, " Resilient multicast using overlays," in Proc. ACM Sigmetrics, June 2003, pp. 102-113.
3. B. Bloom, "Space/time trade-offs in hash coding with allowable errors," Commun. ACM, vol. 13, pp. 422-426, July 1970.
4. A. Broder, "On the resemblance and containment of documents," in Proc. Compression, Complexity of Sequences, Positano, Italy, June 1997, pp. 21-29.
5. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher, " Minwise independent permutations," J. Comput. Syst. Sci., vol. 60, no. 3, pp. 630-659, 2000.
6. J. W. Byers, J. Considine, and M. Mitzenmacher, "Fast approximate reconciliation of set differences," Boston Univ., Boston, MA, Tech. Rep. BUCS-TR-2002-019, July 2002.
7. J. W. Byers, J. Considine, M. Mitzenmacher, and S. Rost, "Informed content delivery across adaptive overlay networks," in Proc. ACM SIGCOMM, Pittsburgh, PA, Aug. 2002, pp. 47-60.
8. J. W. Byers, M. Luby, and M. Mitzenmacher, "Accessing multiple mirror sites in parallel: Using Tornado codes to speed up downloads," in Proc. IEEE INFOCOM, Mar. 1999, pp. 275-83.
9. J. W. Byers, M. Luby, and M. Mitzenmacher, "A digital fountain approach to asynchronous reliable multicast," IEEE J. Select. Areas Commun., vol. 20, pp. 1528-1540, Oct. 2002.
10. M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, "SplitStream: High-bandwidth multicast in a cooperative environment," in Proc. ACM SOSP, Lake Bolton, NY, Oct. 2003, pp. 298-313.
11. Y.-H. Chu, S. Rao, S. Seshan, and H. Zhang, "A case for end system multicast," IEEE J. Select. Areas Commun., vol. 20, pp. 1456-1471, Oct. 2002.
12. J. Considine, "Generating good degree distributions for sparse parity-check codes using Oracles," Boston Univ., Boston, MA, Tech. Rep. BUCS-TR 2001-019, Oct. 2001.
13. L. Devroye, "A note on the probabilistic analysis of Patricia tries," Random Structures and Algorithms, vol. 3, pp. 203-214, 1992.
14. J. Jannotti, D. Gifford, K. Johnson, M. Kaashoek, and J. O'Toole, " Overcast: Reliable multicasting with an overlay network," in Proc. USENIX Symp. Operating Systems Design, Implementation, San Diego, CA, Oct. 2000, pp. 197-212.
15. C. Knessl and W. Szpankowski, "Limit laws for heights in generalized tries and Patricia tries," in Proc. LATIN, 2000, pp. 298-307.
16. D. E. Knuth, The Art of Computer Programming, Volume 3: Sorting and Searching. Reading, MA: Addison-Wesley, 1973.
17. D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat, "Bullet: High-bandwidth data dissemination using an overlay mesh," in Proc. ACM SOSP, 2003, pp. 282-297.
18. M. Luby, "LT Codes," in Proc. 43rd Symp. Foundations of Computer Science, Vancouver, BC, Canada, Nov. 2002, pp. 271-282.
19. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, " Efficient erasure correcting codes," IEEE Trans. Inform. Theory, vol. 47, pp. 569-584, Feb. 2001.
20. A. Mahanti, D. L. Eager, M. K. Vernon, and D. Sundaram-Stukel, " Scalable on-demand media streaming with packet loss recovery," IEEE/ACM Trans. Networking, vol. 11, pp. 195-209, Feb. 2003.
21. P. Maymounkov and D. Mazieres, "Rateless codes and big downloads," in Proc. 2nd Int. Workshop Peer-to-Peer Systems, Feb. 2003, pp. 247-255.
22. R. Merkle, "A digital signature based on a conventional encryption function," in Proc. CRYPTO, Santa Barbara, CA, Aug. 1987, pp. 369-378.
23. Y. Minsky and A. Trachtenberg, "Efficient reconciliation of unordered databases," Cornell Univ., Ithaca, NY, Tech. Rep. TR1999-1778, 1999.
24. Y. Minsky, and A. Trachtenberg, "Scalable set reconciliation," in Proc. 40th Annu. Allerton Conf. Communication, Control, Computing, Oct. 2002, pp. 1607-1616.
25. Y. Minsky, A. Trachtenberg, and R. Zippel, "Set reconciliation with nearly optimal communication complexity," IEEE Trans. Inform. Theory, vol. 49, pp. 2213-2218, Sept. 2003.
26. M. Mitzenmacher, "Compressed Bloom filters," in IEEE/ACM Trans. Networking, vol. 10, Oct. 2002, pp. 604-612.
27. B. Pittel and H. Rubin, "How many random questions are necessary to identify n distinct objects?," J. Combinatorial Theory, ser. A 55, pp. 292-312, 1990.
28. M. Rabin, "Efficient dispersal of information for security, load balancing and fault tolerance," J. ACM, vol. 38, pp. 335-348, 1989.
29. P. Rodriguez and E. W. Biersack, "Dynamic parallel access to replicated content in the Internet," IEEE/ACM Trans. Networking, vol. 10, pp. 455-465, Aug. 2002.
30. S. Savage, A. Collins, E. Hoffman, J. Snell, and T. Anderson, "The end-to-end effects of Internet path selection," in Proc. ACM SIGCOMM, Aug. 1999, pp. 289-299.
31. Swarmcast. [Online] http://www.opencola.org/projects/swarmcast
32. J. S. Vitter, "Random sampling with a reservoir," ACM Trans. Math. Software, vol. 11, pp. 37-57, 1985.