Asynchronous resource discovery
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Fast construction of overlay networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Asynchronous resource discovery
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
On the Performance of Flooding-Based Resource Discovery
IEEE Transactions on Parallel and Distributed Systems
A Self-Organized Grouping (SOG) Method for Efficient Grid Resource Discovery
GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing
Confidence-based grid service discovery
International Journal of Web and Grid Services
O(log n)-time overlay network construction from graphs with out-degree 1
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Middleware-level collaborative resource discovery for large clusters
CTS'05 Proceedings of the 2005 international conference on Collaborative technologies and systems
| Hi-index | 0.00 |
The resource discovery problem arises in the context of peer to peer (P2P) networks, where at any point of time a peer may be placed at or removed from any location over a general purpose network (e.g., an Internet site). A vertex (peer) can communicate with another vertex directly if and only if it knows a certain routing information to that other vertex. Hence, a critical task is for the peers to convey this routing information to each other.The problem was formalized by Harchol-Balter, Leighton and Lewin [13]. The routing information needed for a vertex to reach another peer is that peer's identifier (e.g., IP address).A logical directed edge represents the fact that the peer at the tail of the edge knows the IP address of the one at its head. A number of algorithms were developed in [13] for this problem in the model of a synchronous network over a weakly connected directed graph. The best of these algorithms was randomized. Subsequently, a deterministic algorithm for the problem on synchronous networks with improved complexity was presented in [15].The current paper extends the deterministic algorithm of [15] to the environment of asynchronous networks, maintaining similar complexities (translated to the asynchronous model). These are lower than the complexities that would be needed to synchronize the system. The main technical difficulty in a directed, weakly connected system is to ensure thatvertices take consistent steps, even if their knowledge about each other is not symmetric, and even if there is no timeout mechanism (which does exist in synchronous systems) to assist in that. (In particular, as opposed to the case in synchronous systems, here an algorithm cannot first transforming every directed edge to be bidirectional and second, apply an algorithm for bidirectional graph.) Thus our result takes another step towards representing the actual setting in a realistic manner.