218 search results - page 33 / 44 » Composite Binary Losses |
TON
2002
13 years 7 months ago
2002
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
CONEXT
2006
ACM
14 years 1 months ago
2006
ACM
In the context of a reconfigurable transport protocol, this paper introduces two protocol instances based on the composition and specialisation of the TFRC congestion control and...
ICNP
2003
IEEE
14 years 21 days ago
2003
IEEE
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as ¢¤£¦¥¨§© , which is prohibitive i...
WORDS
2003
IEEE
14 years 20 days ago
2003
IEEE
We present a framework that will enable scalable analysis and design of graceful degradation in distributed embedded systems. We define graceful degradation in terms of utility. A...
PKC
2010
Springer
13 years 11 months ago
2010
Springer
We propose new and improved instantiations of lossy trapdoor functions (Peikert and Waters, STOC ’08), and correlation-secure trapdoor functions (Rosen and Segev, TCC ’09). Ou...