Sciweavers

625 search results - page 73 / 125
» Latency Insensitive Protocols
Sort
View
CCR
2008
109views more  CCR 2008»
13 years 9 months ago
An independent H-TCP implementation under FreeBSD 7.0: description and observed behaviour
A key requirement for IETF recognition of new TCP algorithms is having an independent, interoperable implementation. This paper describes our BSD-licensed implementation of H-TCP ...
Grenville J. Armitage, Lawrence Stewart, Michael W...
MOBIHOC
2004
ACM
14 years 8 months ago
Using labeled paths for loop-free on-demand routing in ad hoc networks
We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree in...
Hari Rangarajan, J. J. Garcia-Luna-Aceves
EUROSYS
2007
ACM
14 years 6 months ago
Melange: creating a "functional" internet
Most implementations of critical Internet protocols are written in type-unsafe languages such as C or C++ and are regularly vulnerable to serious security and reliability problems...
Anil Madhavapeddy, Alex Ho, Tim Deegan, David Scot...
INFOCOM
2006
IEEE
14 years 3 months ago
Placing Relay Nodes for Intra-Domain Path Diversity
Abstract— To increase reliability and robustness of missioncritical services in the face of routing changes, it is often desirable and beneficial to take advantage of path diver...
Meeyoung Cha, Sue B. Moon, Chong-Dae Park, Aman Sh...
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 29 days 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