Sciweavers

96 search results - page 14 / 20
» Universal and Robust Distributed Network Codes
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 3 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
WAC
2004
Springer
15 years 5 months ago
A Metabolic Approach to Protocol Resilience
The goal of this research is to create robust execution circuits for communication software which can distribute over a network and which continues to provide its service despite p...
Christian F. Tschudin, Lidia Yamamoto
ICIW
2008
IEEE
15 years 6 months ago
NAT Traversal for Pure P2P e-Learning System
Abstract—In this paper, we present Network Address Translator (NAT) traversal technique suitable for pure P2P applications, such as a distributed asynchronous Web-Based Training ...
Kazuo Kuramochi, Takao Kawamura, Kazunori Sugahara
INFOCOM
2002
IEEE
15 years 4 months ago
SWAN: Service Differentiation in Stateless Wireless Ad Hoc Networks
—We propose SWAN, a stateless network model which uses distributed control algorithms to deliver service differentiation in mobile wireless ad hoc networks in a simple, scalable ...
Gahng-Seop Ahn, Li-Hsiang Sun, Andras Veres, Andre...
EUROCRYPT
2008
Springer
15 years 1 months ago
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
Nishanth Chandran, Vipul Goyal, Amit Sahai