Jonathan Santos and David Wetherall. Increasing effective link bandwidth by suppressing replicated data. In Proc. of USENIX Annual Technical Conference, June 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....compression can be built into servers and clients as in the mod gzip module available for the Apache webserver and HTTP 1. 1 compliant browsers [16] Delta encoding, the transmission of only parts of documents which differ between client and server, can also be used to compress network traffic [15, 27, 28, 35]. 5.2 Optimizing algorithms for low energy Advanced RISC Machines (ARM) provides an application note which explains how to write C code in a manner best suited for its processors and ISA [1] Suggestions include rewriting code to avoid software emulation and working with 32 bit quantities ....

J. Santos and D. Wetherall. Increasing effective link bandwidth by suppressing replicated data. In USENIX Annual Technical Conference, June 1998.

....transfers, and a trace driven 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 ....

....be expensive to compute, nor should the digest representation consume too many header bytes. A cryptographic hash algorithm such as SHA 1 [41] might have the right properties. 7. 2 Similar Proposals DTD is an application level analogue of the router level approach proposed by Santos Wetherall [46] and Spring Wetherall [50] The two approaches are in some sense complementary, because each can avoid some redundant data transfers eliminated by the other. For example, the router based approach can eliminate transfers of common prefixes of slightly different payloads, while DTD does not suffer ....

J. Santos and D. Wetherall. Increasing effective link bandwidth by suppressing replicated data. In Proc. USENIX Annual Technical Conf., June 1998.

....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 ....

J. Santos and D. Wetherall. Increasing Effective Link Bandwidth by Suppressing Replicated Data. Proc. Usenix Annual Technical. Conference, June 1998. 108

....transfers, and a trace driven 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 ....

....be expensive to compute, nor should the digest representation consume too many header bytes. A cryptographic hash algorithm such as SHA 1 [41] might have the right properties. 7. 2 Similar Proposals DTD is an application level analogue of the router level approach proposed by Santos Wetherall [46] and Spring Wetherall [50] The two approaches are in some sense complementary, because each can avoid some redundant data transfers eliminated by the other. For example, the router based approach can eliminate transfers of common prefixes of slightly different payloads, while DTD does not ....

J. Santos and D. Wetherall. Increasing effective link bandwidth by suppressing replicated data. In Proc. USENIX Annual Technical Conf., June 1998.

....a server independent name. They also failed to report on the frequency at which duplicate files were transferred using different filenames or hostnames. Santos and Weatherall propose and analyze a link level duplicate suppression mechanism quite similar, in some ways, to the HTTP level mechanism [44]. In their approach, a compressor system is used on the sending side of a link, and a decompressor is used on the receiving side. In practice, these systems might be integrated into the routers, and would be duplicated for a bidirectional link. The compressor stores each packet s payload in ....

Jonathan Santos and David Wetherall. Increasing Effective Link Bandwidth by Suppressing Replicated Data. In Proc. USENIX 1998 Annual Technical Conference, pages 213-224. New Orleans, LA, June, 1998.

....Transcoding 2 Converting a multimedia data stream from one format to another within the network. Duplicate Data Suppression 3 Reduce superfluous duplicate data transmission over high cost links. Table 1. Representative application specific packet processing routines. 1 [1] 2 [7] 3 [14] Application Insts Executed per Message Loads Stores ( Ctrl Flow ( Other ( IP forward 200 25.4 12.7 61.9 MD5 2000 10.7 2.8 86.5 3DES 40000 17.8 1.2 81.0 Table 2. Benchmark characteristics. 4 of 12 schedule these concurrent operations such that each pipeline stage is occupied. ....

J. Santos and D. Wetherall. Increasing Effective Link Bandwidth by Suppressing Replicated Data. Proceedings of the Usenix Annual Technical Conference, pp. 213-224. New Orleans, Louisiana, June 1998. USENIX.

....in such networks. These updates may be periodic, spontaneous, or in response to a query from the gatherer. Even in today s networks, in the context of web cache updates, there is evidence of small packet traffic originating from a set of nodes to another node [7] Also, the packet trace at MIT [8] shows that replicated packets (packets with identical payloads) form a significant fraction of the total number of packets in a network. Thus, a scalable mechanism for gathering information sent by a large number of entities, without overwhelming the receiver and the network, is needed. Just as ....

....and replication removal to transformer tunnels. The reassembly function combines small packets to form a larger packet. This reduces the number of packets within the network and also reduces load at the receiver by reducing the number of interrupts generated. The replication removal function [8] reduces redundancy in the data packets flowing over a link by sending identical payloads only once across the link. This paper is organized as follows. Section 3 describes what aggregation functions are meaningful in the context of gathercast. Section 4 gives the details of the gathercast ....

[Article contains additional citation context not shown here]

J. Santos and D. Wetherall, "Increasing effective link bandwidth by suppressing replicated data," in Proceedings of the USENIX Annual Technical Conference, June 1998.

No context found.

Jonathan Santos and David Wetherall. Increasing effective link bandwidth by suppressing replicated data. In Proc. of USENIX Annual Technical Conference, June 1998.

No context found.

J. Santos and D. Wetherall. Increasing Effective Link Bandwidth by Suppressing Replicated Data. Proceedings of the Usenix Annual Technical Conference, pp. 213-224. New Orleans, Louisiana, June 1998. USENIX.

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