2084 search results - page 242 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Optimal bandwidth utilisation together with resilience and recovery from failure are two key drivers for Traffic Engineering (TE) which have been widely addressed by the IP co...
RTCSA
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper, we address the problem of guaranteeing end-to-end (ETE) delay of packets in a distributed system where the technique of time division multiplex access (TDMA)is adop...
118
click to vote
NFM
2011
14 years 5 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
SIGMETRICS
2008
ACM
14 years 10 months ago
2008
ACM
Several peer-to-peer systems for live streaming have been recently deployed (e.g. CoolStreaming, PPLive, SopCast). These all rely on distributed, epidemic-style dissemination mech...
VLDB
1997
ACM
15 years 2 months ago
1997
ACM
The cpquantile of an ordered sequenceof data values is the element with rank ‘pn, where n is the total number of values. Accurate estimates of quantiles are required for the sol...