# Differences

This shows you the differences between two versions of the page.

— |
education:gossip [2007/02/03 00:36] (current) |
||
---|---|---|---|

Line 1: | Line 1: | ||

+ | ====== Gossip-based dissemination ====== | ||

+ | **English version:**\\ | ||

+ | |||

+ | **Semester project** | ||

+ | |||

+ | Implement various types of gossip-based dissemination algorithms in a simulator and provide measurements. | ||

+ | * Fixed topology: The topology of the graph does not change over time | ||

+ | * Constant Fanout: A node //s// always contacts the same set of neighbors and each node has the same number of neighbors. Each node has the same fixed number of neighbors and always communicates with the same set of neighbors. | ||

+ | * Randomly distributed Fanout: A node //s// always contacts the same set of neighbors and always communicates with the same set of neighbors but nodes have different fanouts. | ||

+ | * Uniform Distribution | ||

+ | * Poisson Distribution | ||

+ | * Gaussian Distribution | ||

+ | |||

+ | * Evolving Topology: At each round, a node //s// contacts a randomly chosen set of neighbors, meaning the topology of the graph changes every t time units. | ||

+ | * Fixed Fanout: A node //s// always contacts a constant number of neighbors, randomly chosen. Each node has a fixed number of neighbors. | ||

+ | * Global Fanout: Each node has the same constant fanout and keeps it constant while the topology is evolving (Pay a special attention to the case where the fanout is 1, as proposed in Cornell gossip algorithms). | ||

+ | * Local Fanout: Each node has its own fanout and keeps it constant while the topology is changing. | ||

+ | * Adapting Fanout (out of scope of this project): A node //s// contacts a randomly chosen number of neighbors. | ||

+ | |||

+ | |||

+ | **Language:** Java | ||

+ | |||

+ | **Responsible:** [[http://lpd.epfl.ch/mmonod|Maxime Monod]] | ||

+ | |||

+ | |||

+ | **This project is taken by Antoine Amiguet** |