806 search results - page 87 / 162 » Lower Bounds on Correction Networks |
153
click to vote
MST
1998
15 years 5 months ago
1998
We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcher...
166
click to vote
DSN
2000
IEEE
15 years 10 months ago
2000
IEEE
Byzantine quorum systems [13] enhance the availability and efficiency of fault-tolerant replicated services when servers may suffer Byzantine failures. An important limitation of...
132
click to vote
PERCOM
2006
ACM
16 years 5 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
128
click to vote
ICNP
2006
IEEE
16 years 1 days ago
2006
IEEE
We describe a family of ÐÓ Ò protocols for assigning symmetric keys to Ò processes in a network so that each process can use its assigned keys to communicate securely with eve...
161
click to vote
IWQOS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Network operators would like their network to support current and future traffic matrices, even when links and routers fail. Not surprisingly, no backbone network can do ...