Using name-based mappings to increase hit rates

IEEE/ACM Transactions on Networking

Volumn 6, Issue 1, 1998, Pages 1-14

  Thaler, David G ^a,b   Ravishankar, Chinya V ^a,b  

^a IEEE   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Caching; Client server systems; Computer networks; Distributed agreement; Multicast routing; Proxies; World Wide Web

Indexed keywords

BUFFER STORAGE; COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; DATA RECORDING; DISTRIBUTED DATABASE SYSTEMS; INFORMATION SERVICES; NETWORK PROTOCOLS; PROBABILITY; RANDOM PROCESSES;

CLIENT SERVER SYSTEMS; HIGHEST RANDOM WEIGHT (HRW) MAPPINGS; MULTICAST ROUTING PROTOCOLS; WORLD WIDE WEB (WWW);

WIDE AREA NETWORKS;

EID: 0031997530     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.663936     Document Type: Article

References (30)

1. T. Ballardie, P. Francis, and J. Crowcroft, "An architecture for scalable inter-domain multicast routing," in Proc. ACM SIGCOMM, Sept. 1993, pp. 85-95.
2. S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C.-G. Liu, and L. Wei, "An architecture for wide-area multicast routing," in Proc. ACM SIGCOMM, Aug. 1994, pp. 126-135.
3. J. Gwertzman and M. Seltzer, "World-wide web cache consistency," in Proc. 1996 USENIX Tech. Conf., Jan. 1996, pp. 141-151.
4. C. M. Bowman, P. B. Danzig, D. R. Hardy, U. Manber, and M. F. Schwartz, "The harvest information discovery and access system," in Proc. Second Int. World Wide Web Conf., Oct. 1994, pp. 763-771.
5. M. S. Squillante and E. D. Lazowska, "Using processor-cache affinity information in shared-memory multiprocessor scheduling," IEEE Trans. Parallel Distrib. Syst., vol. 4, pp. 131-143, Feb. 1993.
6. R. Vaswani and J. Zahorjan, "The implications of cache affinity on processor scheduling for multiprogrammed, shared memory multiprocessors," in Proc. 13th Symp. Operating System Principles, Oct. 1991, pp. 26-40.
7. J. D. Salehi, J. F. Kurose, and D. Towsley, "The effectiveness of affinity-based scheduling in multiprocessor network protocol processing (extended version)," IEEE/ACM Trans. Networking, vol. 4, pp. 516-530, Aug. 1996.
8. V. Paxson and S. Floyd, "Wide-area traffic: The failure of poisson modeling," in Proc. ACM SIGCOMM, Aug. 1994, pp. 257-268.
9. R. Jain and S. A. Routhier, "Packet trains - Measurements and a new model for computer network traffic," IEEE J. Select. Areas Commun., vol. SAC-4, pp. 986-995, Sept. 1986.
10. M. Fisz, Probability Theory and Mathematical Statistics. New York: Wiley, 1963.
11. P. B. Danzig, R. S. Hall, and M. F. Schwartz, "A case for caching file objects inside internetworks," Univ. Colorado, Boulder, CO, Tech. Rep. CU-CS-642-93, Mar. 1993.
12. Cisco Systems. "Scaling the world wide web." [Online]. Available: HTTP: http://cio.cisco.com/warp/public/751/advtg/swww_wp.htm.
13. R. G. Smith, "The contract net protocol: High-level communication and control in a distributed problem solver," ACM Trans. Comput., pp. 1104-1113, Dec. 1980.
14. M. Satyanarayanan, "Scalable, secure, and highly available distributed file access," IEEE Comput. Mag., vol. 23, pp. 9-21, May 1990.
15. T. Brisco, "DNS support for load balancing," RFC-1794, Apr. 1995.
16. E. Katz, M. Butler, and R. McGrath, "A scalable HTTP server: The NCSA prototype," Comput. Networks ISDN Syst., vol. 27, pp. 155-164, 1994.
17. D. Estrin, D. Farinacci, A. Helmy, D. Thaler, S. Deering, M. Handley, V. Jacobson, C.-G. Liu, P. Sharma, and L. Wei, "Protocol independent multicast-sparse mode (PIM-SM): Specification," RFC-2117, June 1997.
18. D. Estrin, A. Helmy, P. Huang, and D. Thaler, "A dynamic bootstrap mechanism for rendezvous-based multicast routing," IEEE/ACM Trans. Networking, to be published.
19. D. E. Knuth, The Art of Computer Programming, vol. 1., 2nd ed. Reading, MA: Addison-Wesley, 1973.
20. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1988.
21. I. Niven, H. S. Zuckerman, and H. L. Montgomery, An Introduction to the Theory of Numbers, 5th ed. New York: Wiley, 1991.
22. S. K. Park and K. W. Miller, "Random number generators: Good ones are hard to find," CACM, vol. 31, no. 10, pp. 1192-1201, Oct. 1988.
23. D. G. Carta, "Two fast implementations of the "minimal standard" random number generator," CACM, vol. 33, no. 1, Jan. 1990.
24. S. Williams, M. Abrams, C. R. Standridge, G. Abdulla, and E. A. Fox, "Removal policies in network caches for world-wide web documents," in Proc. ACM SIGCOMM'96, pp. 293-305, Aug. 1996.
25. M. Abrams, C. R. Standridge, G. Abdulla, S. Williams, and E. A. Fox, "Caching proxies: Limitations and potentials," in Proc. 4th Int. World-Wide Web Conf., Dec. 1995.
26. S. Glassman, "A caching relay for the world wide web," Comput. Networks ISDN Syst., vol. 27, no. 2, Nov. 1994.
27. C. R. Cunha, A. Bestavros, and M. E. Crovella, "Characteristics of WWW client-based traces," Boston Univ., Boston, MA, Tech. Rep. BU-CS-95-010, July 1995.
28. M. R. Nelson, "File verification using CRC," Dr. Dobb's J., May 1992.
29. D. Neal, "The harvest object cache in New Zealand," Comput. Networks ISDN Syst, vol. 28, pp. 1415-1430, May 1996.
30. A. Ballardie, "Core based trees (CBT version 2) multicast routing: Protocol specification," RFC-2189, Sept. 1997.