TU Darmstadt / ULB / TUbiblio

BridgeFinder: Finding communication bottlenecks in distributed environments

Bradler, Dirk and Krumov, Lachezar and Aitenbichler, Erwin and Kangasharju, Jussi (2011):
BridgeFinder: Finding communication bottlenecks in distributed environments.
IEEE Intl. Conf. Information Networking (ICOIN), Barcelona, Spain, ISBN 978-1-61284-661-3,
[Conference or Workshop Item]

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.

Item Type: Conference or Workshop Item
Erschienen: 2011
Creators: Bradler, Dirk and Krumov, Lachezar and Aitenbichler, Erwin and Kangasharju, Jussi
Title: BridgeFinder: Finding communication bottlenecks in distributed environments
Language: ["languages_typename_1" not defined]
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.

Publisher: IEEE Intl. Conf. Information Networking (ICOIN)
ISBN: 978-1-61284-661-3
Uncontrolled Keywords: - 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
Divisions: 20 Department of Computer Science > Telecooperation
20 Department of Computer Science > Peer-to-Peer Netzwerke
20 Department of Computer Science
Event Location: Barcelona, Spain
Date Deposited: 31 Dec 2016 12:59
Identification Number: TUD-CS-2010-0065
Related URLs:
Export:

Optionen (nur für Redakteure)

View Item View Item