Results 1 - 10 of 396

A Scalable Content-Addressable Network

by Sylvia Ratnasamy , Paul Francis, Mark Handley, Richard Karp, Scott Shenker - IN PROC. ACM SIGCOMM 2001 , 2001
"... Hash tables – which map “keys ” onto “values” – are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a distributed infra ..."
Abstract - Cited by 3371 (32 self) - Add to MetaCart
infrastructure that provides hash table-like functionality on Internet-like scales. The CAN is scalable, fault-tolerant and completely self-organizing, and we demonstrate its scalability, robustness and low-latency properties through simulation.

Scalable Application Layer Multicast

by Suman Banerjee, Bobby Bhattacharjee, Christopher Kommareddy , 2002
"... We describe a new scalable application-layer multicast protocol, specifically designed for low-bandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the application-layer multicast peers and can support a number of different data deliv ..."
Abstract - Cited by 731 (21 self) - Add to MetaCart
sites. In our experiments, averagegroup members established and maintained low-latency paths and incurred a maximum packet loss rate of less than 1 % as members randomly joined and left the multicast group. The average control overhead during our experiments was less than 1 Kbps for groups of size 100.

Speeding: On Low-Latency Key Exchange

by Britta Hale, Tibor Jager, Jörg Schwenk
"... Abstract. Low-latency key exchange (LLKE) protocols allow for the transmission of cryptographically protected payload data without re-quiring the prior exchange of messages of a cryptographic key exchange protocol, while providing perfect forward secrecy. The LLKE concept was first realized by Googl ..."
Abstract - Add to MetaCart
Abstract. Low-latency key exchange (LLKE) protocols allow for the transmission of cryptographically protected payload data without re-quiring the prior exchange of messages of a cryptographic key exchange protocol, while providing perfect forward secrecy. The LLKE concept was first realized

ASAP: A Low-Latency Transport Layer

by Wenxuan Zhou, Qingxi Li, Matthew Caesar, P. Brighten Godfrey
"... For interactive networked applications like web browsing, every round-trip time (RTT) matters. We introduce ASAP, a new naming and transport protocol that reduces latency by shortcutting DNS requests and eliminating TCP’s three-way handshake, while ensuring the key security property of verifiable pr ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
For interactive networked applications like web browsing, every round-trip time (RTT) matters. We introduce ASAP, a new naming and transport protocol that reduces latency by shortcutting DNS requests and eliminating TCP’s three-way handshake, while ensuring the key security property of verifiable

Low-Latency Synchronous Representations of Asynchronous Processes

by Mohamed N. Menaa, Dan R. Ghica, Alex Smith , 2011
"... We revisit a technique called round abstraction as a solution to the problem of building low-latency synchronous systems from asynchronous specifications. Although in general round abstraction is not compositional, we identify sufficient properties to guarantee correct composition, thereby proposing ..."
Abstract - Add to MetaCart
We revisit a technique called round abstraction as a solution to the problem of building low-latency synchronous systems from asynchronous specifications. Although in general round abstraction is not compositional, we identify sufficient properties to guarantee correct composition, thereby

Low-latency Access to Robust Amnesic Storage

by Dan Dobre, Matthias Majuntke, Neeraj Suri , 2008
"... We address the problem of building a reliable distributed read/write storage from unreliable storage units, e.g. a collection of servers, of which up to one-third can fail by not responding or by undetectably corrupting the data stored on them. Our contribution consists in the development of Byzanti ..."
Abstract - Add to MetaCart
of Byzantine-resilient storage algorithms that for the first time combine strong consistency and liveness guarantees with space-efficiency. Previous solutions featuring equivalent properties resort to storing an unlimited number of data versions in the storage units, thus eventually running into problems

Timing analysis in low-latency mix networks: attacks and defenses

by Vitaly Shmatikov, Ming-Hsiu Wang - IN: PROCEEDINGS OF ESORICS , 2006
"... Mix networks are a popular mechanism for anonymous Internet communications. By routing IP traffic through an overlay chain of mixes, they aim to hide the relationship between its origin and destination. Using a realistic model of interactive Internet traffic, we study the problem of defending low-la ..."
Abstract - Cited by 56 (0 self) - Add to MetaCart
Mix networks are a popular mechanism for anonymous Internet communications. By routing IP traffic through an overlay chain of mixes, they aim to hide the relationship between its origin and destination. Using a realistic model of interactive Internet traffic, we study the problem of defending low-latency

Low-latency hard real-time communication over switched Ethernet

by Jork Loeser, Tu Dresden, Hermann Haertig - the 16 th Euromicro International Conference on Realtime Systems (ECRTS’2004
"... Ethernet, the most widely used commodity network, increasingly moves toward switches as implementation technology thus replacing busses. This allows to use traf£c shaping techniques to implement hard real-time distributed systems on commodity networks. However, because Ethernet switches lack build-i ..."
Abstract - Cited by 35 (1 self) - Add to MetaCart
technology. We make thorough experiments to understand the cost and practical limits of using Fast and Gigabit Ethernet for hard real-time communication. We do measurements to analyze properties of switches and delays that we can achieve using these switches. We further analyze the in¤uences of non real

A Low-Latency Routing Protocol for Wireless Sensor Networks

by Antonio G. Ruzzelli, Richard Tynan, G.M.P. O'Hare, G. M. P. O’hare - In proc. of the Advanced Industrial Conference on Wireless Technologies SENET 2005 , 2005
"... Recent advances in Wireless Sensors Network (WSN) technology have made possible the manufacturing of tiny low-cost, low-power sensors with wireless multi-hop communication and sensing capabilities. Energy conservation for WSNs is a primary objective that needs to be addressed at all layers of the ne ..."
Abstract - Cited by 13 (5 self) - Add to MetaCart
, Routing and Localization INtegrated), an energy-efficient low-latency integrated protocol for WSNs. In particular we contrast the X and V scheduling family schemes with respect to the following properties: network setup time, network lifetime and message latency. We conduct our experiments within the Om

Low-latency guaranteed-rate scheduling using Elastic Round Robin

by Salil S. Kanhere, Harish Sethu - Computer Communication , 2002
"... Packet scheduling algorithms in switches and routers will likely play a critical role in providing the Quality-of-Service (QoS) guarantees required by many real-time multimedia applications. Elastic Round Robin (ERR), a recently proposed fair scheduling discipline designed for best-effort traffic, i ..."
Abstract - Cited by 8 (4 self) - Add to MetaCart
in this paper is tight. Our analysis shows that ERR, in comparison to other scheduling disciplines of equivalent complexity, also has significantly better latency properties. The combination of fairness, efficiency and low-latency makes ERR an attractive scheduling discipline for both best-effort and guaranteed
Results 1 - 10 of 396