Sciweavers

71 search results - page 3 / 15
» US National Science Foundation and the Future Internet Desig...
Sort
View
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
13 years 11 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
IMC
2006
ACM
14 years 1 months ago
Quantifying path exploration in the internet
A number of previous measurement studies [10, 12, 17] have shown the existence of path exploration and slow convergence in the global Internet routing system, and a number of prot...
Ricardo V. Oliveira, Beichuan Zhang, Dan Pei, Rafi...
EUROSYS
2008
ACM
14 years 4 months ago
Flicker: an execution infrastructure for tcb minimization
We present Flicker, an infrastructure for executing securitysensitive code in complete isolation while trusting as few as 250 lines of additional code. Flicker can also provide me...
Jonathan M. McCune, Bryan Parno, Adrian Perrig, Mi...
PODC
2012
ACM
11 years 10 months ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
AAMAS
2008
Springer
13 years 7 months ago
Using quantitative models to search for appropriate organizational designs
As the scale and scope of distributed and multi-agent systems grow, it becomes increasingly important to design and manage the participants' interactions. The potential for b...
Bryan Horling, Victor R. Lesser