Name
Abstract | ||
|---|---|---|
Emerging challenges in ubiquitous networks and computing include the ability to extract useful information from a vast amount of data which are intrinsically distributed. Epidemic protocols are a bio-inspired approach that provide a communication and computation paradigm for large and extreme-scale networked systems. These protocols are based on randomised communication, which provides robustness, scalability and probabilistic guarantees on convergence speed and accuracy. This work investigates the convergence detection problem in epidemic aggregation, which is critical to minimise the execution time for a given approximation error of the estimated aggregate. Global and local convergence criteria are presented and compared. The experimental analysis shows that a local convergence criterion can be adopted to minimise and adapt the number of cycles in epidemic aggregation protocols. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-54420-0_29 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
epidemic protocols,gossip-based protocols,extreme-scale computing,decentralised algorithms | Convergence (routing),Computer science,Robustness (computer science),Execution time,Local convergence,Probabilistic logic,Approximation error,Computation,Distributed computing,Scalability | Conference |
Volume | ISSN | Citations |
8374 | 0302-9743 | 7 |
PageRank | References | Authors |
0.50 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pasu Poonpakdee | 1 | 17 | 2.76 |
| Neriman Gamze Orhon | 2 | 7 | 0.50 |
| Giuseppe Di Fatta | 3 | 529 | 39.23 |