Matches in SemOpenAlex for { <https://semopenalex.org/work/W2790360669> ?p ?o ?g. }
Showing items 1 to 92 of
92
with 100 items per page.
- W2790360669 abstract "Centrality metrics are a key instrument for graph analysis and play a central role in many problems related to networking such as service placement, robustness analysis and network optimization. Betweenness centrality is one of the most popular and well-studied metric. While distributed algorithms to compute this metric exist, they are either approximated or limited to certain topologies (directed acyclic graphs or trees). Exact distributed algorithms for betweenness centrality are computationally complex, because its calculation requires the knowledge of all possible shortest paths within the graph. In this paper we consider load centrality, a metric that usually converges to betweenness, and we present the first distributed and exact algorithm to compute it. We prove its convergence, we estimate its complexity and we show it is directly applicable-with minimal modifications-to any distance-vector routing protocol based on Bellman-Ford. We finally implement it on top of the Babel routing protocol and we show that, exploiting centrality, we can significantly reduce Babel's convergence time upon node failure without increasing signalling overhead. Our contribution is relevant in the realm of wireless distributed networks, but the algorithm can be adopted in any distributed system where it is not possible, or computationally impractical, to reconstruct the whole network graph at each node and compute betweenness centrality with the classical approach based on Dijkstra's algorithm." @default.
- W2790360669 created "2018-03-29" @default.
- W2790360669 creator A5013354318 @default.
- W2790360669 creator A5041285421 @default.
- W2790360669 creator A5045508421 @default.
- W2790360669 creator A5049020621 @default.
- W2790360669 creator A5077326244 @default.
- W2790360669 date "2018-04-01" @default.
- W2790360669 modified "2023-09-29" @default.
- W2790360669 title "On the Distributed Computation of Load Centrality and its Application to DV Routing" @default.
- W2790360669 cites W1029409534 @default.
- W2790360669 cites W1527104720 @default.
- W2790360669 cites W1556756413 @default.
- W2790360669 cites W1971937094 @default.
- W2790360669 cites W1978850354 @default.
- W2790360669 cites W1996014455 @default.
- W2790360669 cites W2043873340 @default.
- W2790360669 cites W2047576351 @default.
- W2790360669 cites W2058990271 @default.
- W2790360669 cites W2060973893 @default.
- W2790360669 cites W2062215476 @default.
- W2790360669 cites W2065376270 @default.
- W2790360669 cites W2067462271 @default.
- W2790360669 cites W2067927726 @default.
- W2790360669 cites W2076572897 @default.
- W2790360669 cites W2079787486 @default.
- W2790360669 cites W2099970772 @default.
- W2790360669 cites W2107820505 @default.
- W2790360669 cites W2109567727 @default.
- W2790360669 cites W2112556110 @default.
- W2790360669 cites W2117260657 @default.
- W2790360669 cites W2118404561 @default.
- W2790360669 cites W2133503202 @default.
- W2790360669 cites W2171707538 @default.
- W2790360669 cites W2195052264 @default.
- W2790360669 cites W2478919384 @default.
- W2790360669 cites W2583145337 @default.
- W2790360669 cites W2622759477 @default.
- W2790360669 cites W4211173878 @default.
- W2790360669 cites W4249186852 @default.
- W2790360669 doi "https://doi.org/10.1109/infocom.2018.8486345" @default.
- W2790360669 hasPublicationYear "2018" @default.
- W2790360669 type Work @default.
- W2790360669 sameAs 2790360669 @default.
- W2790360669 citedByCount "10" @default.
- W2790360669 countsByYear W27903606692019 @default.
- W2790360669 countsByYear W27903606692020 @default.
- W2790360669 countsByYear W27903606692021 @default.
- W2790360669 countsByYear W27903606692022 @default.
- W2790360669 countsByYear W27903606692023 @default.
- W2790360669 crossrefType "proceedings-article" @default.
- W2790360669 hasAuthorship W2790360669A5013354318 @default.
- W2790360669 hasAuthorship W2790360669A5041285421 @default.
- W2790360669 hasAuthorship W2790360669A5045508421 @default.
- W2790360669 hasAuthorship W2790360669A5049020621 @default.
- W2790360669 hasAuthorship W2790360669A5077326244 @default.
- W2790360669 hasBestOaLocation W27903606692 @default.
- W2790360669 hasConcept C114614502 @default.
- W2790360669 hasConcept C117045392 @default.
- W2790360669 hasConcept C120314980 @default.
- W2790360669 hasConcept C130120984 @default.
- W2790360669 hasConcept C33923547 @default.
- W2790360669 hasConcept C41008148 @default.
- W2790360669 hasConcept C53811970 @default.
- W2790360669 hasConcept C80444323 @default.
- W2790360669 hasConceptScore W2790360669C114614502 @default.
- W2790360669 hasConceptScore W2790360669C117045392 @default.
- W2790360669 hasConceptScore W2790360669C120314980 @default.
- W2790360669 hasConceptScore W2790360669C130120984 @default.
- W2790360669 hasConceptScore W2790360669C33923547 @default.
- W2790360669 hasConceptScore W2790360669C41008148 @default.
- W2790360669 hasConceptScore W2790360669C53811970 @default.
- W2790360669 hasConceptScore W2790360669C80444323 @default.
- W2790360669 hasLocation W27903606691 @default.
- W2790360669 hasLocation W27903606692 @default.
- W2790360669 hasLocation W27903606693 @default.
- W2790360669 hasOpenAccess W2790360669 @default.
- W2790360669 hasPrimaryLocation W27903606691 @default.
- W2790360669 hasRelatedWork W1599539245 @default.
- W2790360669 hasRelatedWork W2081805563 @default.
- W2790360669 hasRelatedWork W2186710387 @default.
- W2790360669 hasRelatedWork W2481254286 @default.
- W2790360669 hasRelatedWork W2486135733 @default.
- W2790360669 hasRelatedWork W2983010557 @default.
- W2790360669 hasRelatedWork W3001056315 @default.
- W2790360669 hasRelatedWork W3099227636 @default.
- W2790360669 hasRelatedWork W87276267 @default.
- W2790360669 hasRelatedWork W992689895 @default.
- W2790360669 isParatext "false" @default.
- W2790360669 isRetracted "false" @default.
- W2790360669 magId "2790360669" @default.
- W2790360669 workType "article" @default.