Bradler, Dirk ; Krumov, Lachezar ; Aitenbichler, Erwin ; Kangasharju, Jussi (2011)
BridgeFinder: Finding communication bottlenecks in distributed environments.
Barcelona, Spain
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
Nodes in mobile networks are usually unevenly distributed over space. Several dense clusters of nodes are interconnected by a few nodes in sparsely occupied areas. Removing vital nodes along such bridges would partition the network and severely reduce the overall connectivity. Consequently, detecting and protecting those few vital nodes is crucial for keeping the network operational. In order to achieve this task, we present our novel approach: BridgeFinder. Most importantly, BridgeFinder allows us to calculate good estimates for global graph measures, while operating as a fully distributed algorithm and causing only very little messaging overhead. It is based on an extension of the Push-Sum gossiping protocol and is significantly faster and more precise than existing mechanisms. We also show how BridgeFinder can be implemented in practice and show that it is very robust against malicious nodes attempting to skew the gossiping protocol.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2011 |
| Autor(en): | Bradler, Dirk ; Krumov, Lachezar ; Aitenbichler, Erwin ; Kangasharju, Jussi |
| Art des Eintrags: | Bibliographie |
| Titel: | BridgeFinder: Finding communication bottlenecks in distributed environments |
| Sprache: | Englisch |
| Publikationsjahr: | März 2011 |
| Verlag: | IEEE Intl. Conf. Information Networking (ICOIN) |
| Veranstaltungsort: | Barcelona, Spain |
| Zugehörige Links: | |
| Kurzbeschreibung (Abstract): | Nodes in mobile networks are usually unevenly distributed over space. Several dense clusters of nodes are interconnected by a few nodes in sparsely occupied areas. Removing vital nodes along such bridges would partition the network and severely reduce the overall connectivity. Consequently, detecting and protecting those few vital nodes is crucial for keeping the network operational. In order to achieve this task, we present our novel approach: BridgeFinder. Most importantly, BridgeFinder allows us to calculate good estimates for global graph measures, while operating as a fully distributed algorithm and causing only very little messaging overhead. It is based on an extension of the Push-Sum gossiping protocol and is significantly faster and more precise than existing mechanisms. We also show how BridgeFinder can be implemented in practice and show that it is very robust against malicious nodes attempting to skew the gossiping protocol. |
| Freie Schlagworte: | - SCS (Smart Civil Security);- SCS: ProTecT;- SCS: SoKNOS (jointly with MDI, SST);- P2P - Area Peer-to-Peer Systems;Mobile Networks, Distributed Algorithm, Detecting Critical Peers |
| ID-Nummer: | TUD-CS-2010-0065 |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik > Telekooperation 20 Fachbereich Informatik > Peer-to-Peer Netzwerke 20 Fachbereich Informatik |
| Hinterlegungsdatum: | 31 Dez 2016 12:59 |
| Letzte Änderung: | 30 Mai 2018 12:43 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum