N. T. Spring and D. Wetherall. A protocol-independent technique for eliminating redundant network traffic. In Proc. of ACM SIGCOMM, pages 87--95, Aug. 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....data that are already known to the recipient can be avoided. The most common approach in this case is to work from a common base version known to the sender and recipient, compute the delta, and transmit it. This technique has been applied to web traffic [16] IP level network communication [24], and other domains. An extension to the traditional web delta encoding approach is to select the base version by finding similar, rather than identical, URLs [7] What if one wishes to find a similar file based on content rather than name, among a large collection of files Manber devised a ....

....if two files share many of those features in common, there is a high probability of significant content in common as well. A common use for this technique is to suppress near duplicates in search engine results [6] and variations of the technique have been used in link level duplicate suppression [24] and file systems [8, 17, 20] Because the shingling technique has seen so much use in the systems community of late, we refrain from providing a detailed description of it. Briefly, it uses Rabin fingerprints [21] to compute a hash of consecutive bytes; the key properties of Rabin fingerprints ....

[Article contains additional citation context not shown here]

Neil T. Spring and David Wetherall. A protocolindependent technique for eliminating redundant network traffic. In Proceedings of ACM SIGCOMM, August 2000.

....Dynamic Suppression of Similarity in the Web: Fred Douglis, IBM Research Arun Iyengar, IBM Research Kiem Phong Vo, AT T Labs a Case for Abstract Compression and delta encoding [18] of web resources is a well understood, but infrequently used, technology. Two existing proposals [8, 22] to extend delta encoding beyond successive versions of the same resource suffer from a requirement that the parties participating in the delta encoding process coordinate knowledge of their caches. We make a case for more general mechanisms, and propose a distributed approach that does not ....

....compression as described by vcdiff [14] we ignore simple compression, since it is a well known and straightforward technology. But existing delta encoding technology suffers from a lack of applicability when applied only to successive versions of a single resource [18] Some other approaches [8, 22], which we discuss in the next section, address the lack of applicability but are too restrictive in the requirements they place on the machines performing the encoding. Here, we make a case for an expansion of the HTTP delta encoding specification [17] to identify possible sources of redundancy ....

[Article contains additional citation context not shown here]

Neil T. Spring and David Wetherall. A protocol-independent technique for eliminating redun- dant network traffic. In Proceedings of ACM SIGCOMM, August 2000.

....from caching. For example, streaming media such as audio or video can be and is distributed using specialized proxy caches. Caching of all network tra#c. A few researchers and companies have proposed mechanisms for the caching and compression of network tra#c at the packet or byte level [SW98, SW00, Exp02] Such approaches have the potential to reduce the benefit of passive caches, but prefetching will still be valuable. Other techniques to reduce response times. Many other research areas a#ect userperceived latencies on the Web, including routing, quality of service (QoS) e#orts, and ....

Neil T. Spring and David Wetherall. A protocol-independent technique for eliminating redundant network tra#c. In Proceedings of ACM SIGCOMM, August 2000.

....links since the chatty exchange of checksums could handicap the system. In Tandem Proxy, we chose instead for the partnered proxies to maintain consistent caches, eliminating the need for checksum exchange. 2.4. 2 Spring and Wetherall In the same spirit as Tandem Proxy, Spring and Wetherall [5] presented a design where two caches on opposite ends of a bottleneck link cooperate to reduce trac in a protocol independent fashion. Each cache stores several megabytes of the most recent packets. When a new message is to be sent, the cache replaces any redundant data with references to ....

....For each block of the new le, compute its hash code to see if it matches any blocks in the database. If there is a match, transmit the signature of the cached block. Otherwise, the raw data should be transmitted. Note that this is the same approach that Spring and Wetherall used in their system [5]. Observe, however, that this scheme does not necessarily produce the minimallength di . The system is limited by the granularity of the xed size blocks. For a positive match, it requires all of the bytes within the cached block to be exactly identical to the target block in the new le. What if ....

Neil T. Spring and David Wetherall. A protocol-independent technique for eliminating redundant network trac. In Proceedings of ACM SIGCOMM, August 2000.

....the scale and consequences of this phenomenon. Only a few previous studies have considered the prevalence of aliasing in Web transactions, the performance penalty of conventional URL indexed cache management in large multi level cache hierarchies, or ways to eliminate redundant payload transfers [36, 50]. Few of the Web workload traces that researchers have collected can illuminate the relationship between request URLs and reply payloads, because they do not describe payloads in sufficient detail. In this paper we quantify aliasing and the impact of URL indexed cache management on browser and ....

....simulation demonstrates that one such scheme yields 5.4 and 6.2 improvements in hit rates and byte hit rates, respectively. Even these modest gains are upper bounds, because they assume the full participation of all origin servers [35, 36] Santos Wetherall [46] and Spring Wetherall [50] describe a general protocol independent network layer technique for eliminating redundant traffic by caching packet payloads and transmitting digests thereof to avoid redundant transfers. Muthitacharoen et al. designed a network file system for low bandwidth environments that performs similar ....

[Article contains additional citation context not shown here]

N. T. Spring and D. Wetherall. A protocol-independent technique for eliminating redundant network traffic. In Proc. ACM SIGCOMM, pages 87--95, Aug. 2000.

....to perform their processing effectively. The use of end to end cryptographic protocols greatly complicates the operation of many active network components. Santos, Spring and Wetherall s packet caching schemes, for example, are useless if those packets contain encrypted and thus uncacheable data [Santos98, Spring00]. Many active network designs completely ignore the question of data security. Others use a throwaway paragraph to explain how cryptographic protection can be removed or sidestepped to allow data processing, often by severely limiting the location of services or requiring security protocols to be ....

Neil T. Spring and David Wetherall. A protocol-independent technique for eliminating redundant network traffic. Proc. SIGCOMM

....is known about the scale and consequences of this phenomenon. Only a few previous studies have considered the prevalence of aliasing in Web transactions, its performance impact on multi level cache hierarchies in large production environments, or ways to eliminate the redundant transfers it causes [36, 50]. Few of the Web workload traces that researchers have collected can illuminate the relationship between request URLs and reply payloads, because they do not describe payloads in sufficient detail. In this paper we quantify aliasing and its impact on browser and proxy cache hit rates by examining ....

....simulation demonstrates that one such scheme yields 5.4 and 6.2 improvements in hit rates and byte hit rates, respectively. Even these modest gains are upper bounds, because they assume the full participation of all origin servers [35, 36] Santos Wetherall [46] and Spring Wetherall [50] describe a general protocol independent network layer technique for eliminating redundant traffic by caching packet payloads and transmitting digests thereof to avoid redundant transfers. Muthitacharoen et al. designed a network file system for low bandwidth environments that performs similar ....

[Article contains additional citation context not shown here]

N. T. Spring and D. Wetherall. A protocol-independent technique for eliminating redundant network traffic. In Proc. ACM SIGCOMM, pages 87--95, Aug. 2000.

....updates require a dedicated proxyclient machine, making them a bit cumbersome to set up. Perhaps for this reason the technique is not in widespread use by any file system today. Spring and Wetherall have proposed a protocolindependent technique for eliminating redundant network traffic [21]. They assume two cooperating caches at either end of a slow network link. Both caches store identical copies of the last n Megabytes of network traffic (for values of n up to 100) When one end must send data that already exists in the cache, it instead sends a token specifying where to find the ....

Neil T. Spring and David Wetherall. A protocol independent technique for eliminating redundant network traffic. In Proceedings of the 2000 ACM SIGCOMM Conference, pages 87-- 95, Stockholm, Sweden, August 2000.

....any two levels in a cache hierarchy. The semantics of existing protocols, e.g. HTTP, are largely unchanged if cached payloads and digests thereof are used to avoid redundant transfers. The above scheme is similar in spirit to Spring Wetherall s method of eliminating redundant network traffic [35]. Mogul independently conceived a technique essentially identical to the one presented here but has not published it [27] Re writing the rules of browser proxy interaction is difficult in the most general case because different vendors products must interoperate during migration and backward ....

N. T. Spring and D. Wetherall. A protocol-independent technique for eliminating redundant network traffic. In SIGCOMM, Aug. 2000.

No context found.

N. T. Spring and D. Wetherall. A protocol-independent technique for eliminating redundant network traffic. In Proc. of ACM SIGCOMM, pages 87--95, Aug. 2000.

No context found.

N. T. Spring and D. Wetherall. A protocol-independent technique for eliminating redundant network traffic. In Proc. ACM SIGCOMM, Stockholm, Sweden, Sept. 2000.

No context found.

N. T. Spring and D. Wetherall. A protocol-independent technique for eliminating redundant network traffic. In Proc. ACM SIGCOMM, Stockholm, Sweden, Sept. 2000.

No context found.

N. T. Spring and D. Wetherall. A protocol-independent technique for eliminating redundant network traffic. In Proc. ACM SIGCOMM, Stockholm, Sweden, Sept. 2000.

No context found.

N. T. Spring and D. Wetherall. A protocol-independent technique for eliminating redundant network traffic. In Proc. of ACM SIGCOMM, pages 87--95, Aug. 2000.

No context found.

N. T. Spring and D. Wetherall. A protocol-independent technique for eliminating redundant network traffic. In Proc. of ACM SIGCOMM, pages 87--95, Aug. 2000.

No context found.

SPRING, N. T., AND WETHERALL, D. A ProtocolIndependent Technique for Eliminating Redundant Network Traffic. In Proceedings of ACM SIGCOMM (August 2000).

No context found.

N. Spring, D. Wetherall, A Protocol Independent Technique for Eliminating Redundant Network Traffic, In Proc. ACM SIGCOMM'00, August 2000.

No context found.

N. Spring and D. Wetherall. A protocol independent technique for eliminating redundant network traffic. In Proc. of the ACM SIGCOMM Conference, 2000.

No context found.

N. T. Spring and D. Wetherall. A protocol-independent technique for eliminating redundant network traffic. In Proc. of ACM SIGCOMM, pages 87--95, Aug. 2000.

No context found.

N. T. Spring and D. Wetherall. A protocol-independent technique for eliminating redundant network traffic. In Proc. of ACM SIGCOMM'00, Aug. 2000.

No context found.

Neil T. Spring and David Wetherall. A protocol-independent technique for eliminating redundant network traffic. In Proc. of ACM SIGCOMM, 2000.

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