A. Lopez-Ortiz and Daniel M. German. A multicollaborative push-caching HTTP protocol for the WWW. In Proceedings of the Fifth International World Wide Web Conference, Paris, France, May 1996. Also available as Technical Report CS-96-12, Dept. of Computer Science, Universtiy of Waterloo. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Brian Davison's Web-Caching Bibliography - Davison (Correct)
.... [HN96] HWMS98] HSY98] HK97] HJWC98] IKY97] IST98] JC98] JDB96] JK97] JK98] Kah97] KKO98] WMS98a] KS98a] KW97a] KW97b] KW98] KMK99] KR99] KW99] KA99] KS98b] KLM97] KSW98b] KSW98a] LG98] LHC 98] LSCH98] LWS 99] LD99] LAJF98] Liu98] LC97] LC98] TB97] LOG96] LA94] Luo98] Mah99] MWE00] MEW00] MLB95] MR97] MS97] MSC98] Mar96] MC98] Mar99] MR98] WMFMA98] Mel96] MBV97] MA98] Mog95] Mog96] MDFK97a] MDFK97b] MJ98] MAWM98] Nau98] NLN98] Pad95] PM96] Par96] Pet98] PR94] PK96] Pit97] Pit98] RCG98] RSGR00] RF98b] RF98a] ....
A. Lopez-Ortiz and Daniel M. German. A multicollaborative push-caching HTTP protocol for the WWW. In Proceedings of the Fifth International World Wide Web Conference, Paris, France, May 1996. Also available as Technical Report CS-96-12, Dept. of Computer Science, Universtiy of Waterloo.
Self-Organizing Wide-Area Network Caches - Samrat Bhattacharjee (1997) (34 citations) (Correct)
....at Harvard uses a friends of friends algorithm in which servers selectively push their content to friend caches that reside in active client networks. An similar push caching approach in which servers disseminate popular pages has been proposed by Oritz and German at the University of Waterloo [8]. In both these schemes, the server initiates the caching of an object (that it deems popular) at a remote site. In the simulation results given in the Harvard work, the friendly caches that act as proxys for a given server are chosen to be the nodes closest to networks that generate the most ....
A. Lopez-Ortiz and Daniel M. German. A multicollaborative push-caching http protocol for the WWW. In World Wide Web Conference (WWW5), 1995. Poster Presentation.
Self-Organizing Wide-Area Network Caches - Bhattacharjee, Calvert, Zegura (1997) (34 citations) (Correct)
....Gwertzman at Harvard uses a friends of friends algorithm in which servers selectively push their content to friend caches that reside in client domains. A similar push caching approach in which servers disseminate popular pages has been proposed by Oritz and German at the University of Waterloo [8]. In both schemes, the server initiates the caching of an object (that it deems popular) at a remote site. The Internet Cache Protocol (ICP) 6] defined by the Network Working Group of the IETF is a message format used for communicating among Web caches. Harvest and its successor (Squid) both use ....
A. Lopez-Ortiz and D. M. German, "A multicollaborative push-caching http protocol for the WWW," in World Wide Web Conference (WWW5), 1995. Poster Presentation.
ICP and the Squid Web Cache - Wessels (1997) (58 citations) (Correct)
....validated when requested by a client. This is similar to how Sun Microsystems Network File System (NFS) 30] operates. NFS servers are stateless (as are HTTP servers) and NFS clients are tasked with maintaining cache consistency. One alternative to demand driven caching is known as push caching [31, 32]. Gwertzman and Selzter [31, 33] propose that Web servers replicate popular data in advance based on geography. 2 Push caching is similar to the Andrew File System (AFS) 34] because the servers become stateful and can invalidate stale cached data. However, an AFS server does not choose where ....
A. L'opez-Ortiz and D. M. Germ'an, "A multicollaborative push-caching HTTP protocol for the WWW." http://daisy.uwaterloo.ca/~alopez-o/cspap/cache/Overview.html.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC