Shay Kutten and David Peleg. Deterministic distributed resource discovery. In Nineteenth Annual ACM SIGACT/SIGOPS Symposium on Principles of Distributed Computing, Portland, Oregon, 16-19 July 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....compare the two communities approaches to problems in four categories and conclude this section with problems that are not shared. 5. 1 Formation Topology formation and peer discovery deals with the problem of how nodes join a system and learn about their neighbors, often in an overlay network [38]. Membership protocols have been explored in both settings [34, 40] While espousing the autonomous ideal, much Grid infrastructure is hardcoded and could benefit from the active formation found in p2p research prototypes. 5.2 Utilization Resource discovery determines how we find interesting ....

Shay Kutten and David Peleg. Deterministic distributed resource discovery. In PODC 2002.

....components define a general resource discovery solution: 1. Membership protocol refers to how new nodes join the network and how nodes learn about each others (we refer to the latter part of the membership problem as to peer discovery , while aware that it has multiple names in the literature [25]) 2. Overlay construction function selects the set of active collaborators from the local membership list. In practice, this set is limited by available bandwidth, message processing load, security or administrative policies, topology specifications, etc. Hence, it may often be the case that the ....

KUTTEN, S., AND PELEG, D. Deterministic distributed resource discovery. In Nineteenth Annual ACM SIGACT/SIGOPS Symposium on Principles of Distributed Computing (Portland, Oregon, 2000).

....subproblems define a general resource discovery solution: 1. Membership protocol refers to how new nodes join the network and how nodes learn about each others (we refer to the latter part of the membership problem as to peer discovery , while aware that it has multiple names in the literature [27]) 2. Overlay construction function selects the set of active collaborators from the local membership list. In practice, this set is limited by available bandwidth, message processing load, security or administrative policies, topology specifications (as in structured P2P networks such as CAN, ....

KUTTEN, S., AND PELEG, D. Deterministic distributed resource discovery. In Nineteenth Annual ACM SIGACT/SIGOPS Symposium on Principles of Distributed Computing (Portland, Oregon, 2000).

....round, each machine picks a neighbor randomly and passes the neighbor all its known pointers. It was shown that the machines can learn about one another in O(log 2 n) time, O(n log 2 n) message complexity, and O(n 2 log 2 n) pointer complexity, all with high probability. Kutten and Peleg [3] recently proposed a deterministic resource discovery algorithm with O(log n log # n) time complexity 1 , O(n log n log # n) message complexity, and O(n 2 log 2 n) pointer complexity. In this paper, we introduce a new randomized algorithm, called Absorption, which assumes a ....

....two variants of the Absorption algorithm. 5. 1 O(n 2 ) Pointers on Weakly Connected Graphs We can see from Table 1 that, on a weakly connected graph, the subroutine of evolving the graph to be Time Messages Pointers Name Dropper [1] O(log 2 n) O(n log 2 n) O(n 2 log 2 n) Kutten Peleg [3] O(log n log # n) O(n log n log # n) O(n 2 log 2 n) Absorption (strong) O(log n) O(n log n) h:O(n 2 log n) e:O(n 2 ) Absorption (weak) O(log n) O(n log n) O(n 2 log n) Table 1: Performance of Name Dropper, Kutten Peleg, and Absorption in terms of the three complexity measures. The ....

Shay Kutten and David Peleg. Deterministic distributed resource discovery. In Nineteenth Annual ACM SIGACT/SIGOPS Symposium on Principles of Distributed Computing, Portland, Oregon, 16-19 July 2000.

....the Grid. This paper focuses on approaches for performing the data dissemination that is necessary to keep the status databases consistent. Recently, data dissemination for resource discovery has been an active research area with applications such as web content management motivating the research [3, 10]. Several research initiatives have examined this issue in the context of Grid computing as well [8, 12] Resource discovery is defined as the process by which a node or machine in a distributed system becomes aware of the attributes or capabilities of the other nodes that are part of the system. ....

S. Kutten and D. Peleg. Deterministic distributed resource discovery. In 19th ACM Symposium on Principles of Distributed Computing, July 2000.

No context found.

Shay Kutten and David Peleg. Deterministic distributed resource discovery. In Nineteenth Annual ACM SIGACT/SIGOPS Symposium on Principles of Distributed Computing, Portland, Oregon, 16-19 July 2000.

No context found.

S. Kutten and D. Peleg. Deterministic distributed resource discovery. In 19th Annual ACM Symposium on Principles of Distributed Computing (PODC'02), 2000.

No context found.

Kutten, S., and Peleg, D. Deterministic distributed resource discovery. In 19th Annual ACM Symposium on Principles of Distributed Computing (PODC'02) (Portland, Oregon, 2000).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC