Network tomography on general topologies
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Optimal retrial and timeout strategies for accessing network resources
IEEE/ACM Transactions on Networking (TON)
Direct measurement vs. indirect inference for determining network-internal delays
Performance Evaluation
An Active Programmable Harness for Measurement of Composite Network States
ICN '01 Proceedings of the First International Conference on Networking-Part 2
Adaptive Timeout Discovery Using the Network Weather Service
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Optimal deterministic timeouts for reliable scalable multicast
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
The use of end-to-end multicast measurements for characterizing internal network behavior
IEEE Communications Magazine
A coalgebraic approach to non-determinism: Applications to multilattices
Information Sciences: an International Journal
Non-deterministic algebraic structures for soft computing
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Cascading multi-way bounded wait timer management for moody and autonomous systems
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II
| Hi-index | 0.24 |
One of the unusual challenges faced by peer-to-peer algorithms as opposed to classical distributed algorithms is that these have to compute with data non-determinism where there is no guarantee that data from a particular node will be delivered in time or delivered at all. Each distributed component not only has to work in such environment, but also has to decide how long to wait for peers to respond. A large wait can inordinately delay entire computation. A smaller wait can reduce the coverage of the algorithm and drastically degenerate the quality of final result produced. In this paper, we investigate a set of wait management schemas which tries to minimize the overall completion time and maximize the quality of solution. We present detail analyses of the schemas for various scenarios including large power law networks and forms of non-responsiveness. The work promises dramatic improvement in peer-to-peer search and other computations.