Gossiping in distributed systems /
again sub-divided into two classes: (i) each node knowing the
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1994.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | again sub-divided into two classes: (i) each node knowing the algorithm and (ii) sch emes without an initiator. These are also propose a method for gossiping in an arbitrary graph and implement a gossiping scheme which can compromise message Assuming that each node knows only its neighbors, we propose complexity with the time taken to reach consensus. This different types of network topologies. Two types of distributed network can be useful to utilize the available entire graph of the network and (ii) each node knowing only Exchange of information between various nodes in a gossiping techniques have traditionally been studied and initiates the algorithm and subsequently other nodes in the its neighbors. In the schemes with an initiator, the leader resources effectively. Gossiping algorithms can be used for scheme assumes that one of the nodes is the initiator. We so by a node which already participates in the algorithm. system participate in the algorithm when they are told to do this purpose. used: (i) schemes in which there is an initiator to start the using timeouts. We begin with a survey of various gossiping schemes for without an initiator where nodes communicate asynchronously |
|---|---|
| Item Description: | "Major subject: Electrical Engineering". Vita. |
| Physical Description: | x, 65 leaves : illustrations ; 28 cm. Also available online. |
| Bibliography: | Includes bibliographical references. |