Skip to main content

2018 | OriginalPaper | Buchkapitel

Critical Link Identification Based on Bridge Detection for Network with Uncertain Connectivity

verfasst von : Kazumi Saito, Kouzou Ohara, Masahiro Kimura, Hiroshi Motoda

Erschienen in: Foundations of Intelligent Systems

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Efficiently identifying critical links that substantially degrade network performance if they fail to function is challenging for a large complex network. In this paper, we tackle this problem under a more realistic situation where each link is probabilistically disconnected as if a road is blocked in a natural disaster than assuming that any road is never blocked in a disaster. To solve this problem, we utilize the bridge detection technique in graph theory and efficiently identify critical links in case the node reachability is taken as the performance measure, which corresponds to the number of people who can reach at least one evacuation facility in a disaster. Using two real-world road networks, we empirically show that the proposed method is much more efficient than the other methods that are based on traditional centrality measures and the links our method detected are substantially more critical than those by the others.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
2
We implemented our programs in C, and conducted our experiments on a computer system with a single thread (Xeon X5690 3.47 GHz CPUs) within a 192GB main memory capacity.
 
Literatur
1.
Zurück zum Zitat Akram, V.K., Dagdeviren, O.: Breadth-first search-based single-phase algorithms for bridge detection in wireless sensor networks. Sensors 13(7), 8786–8813 (2013)CrossRef Akram, V.K., Dagdeviren, O.: Breadth-first search-based single-phase algorithms for bridge detection in wireless sensor networks. Sensors 13(7), 8786–8813 (2013)CrossRef
2.
Zurück zum Zitat Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30, 107–117 (1998)CrossRef Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30, 107–117 (1998)CrossRef
3.
Zurück zum Zitat Crucitti, P., Latora, V., Porta, S.: Centrality measures in spatial networks of urban streets. Phys. Rev. E 73(3), 036125 (2006)CrossRef Crucitti, P., Latora, V., Porta, S.: Centrality measures in spatial networks of urban streets. Phys. Rev. E 73(3), 036125 (2006)CrossRef
4.
Zurück zum Zitat Freeman, L.: Centrality in social networks: conceptual clarification. Soc. Netw. 1, 215–239 (1979)CrossRef Freeman, L.: Centrality in social networks: conceptual clarification. Soc. Netw. 1, 215–239 (1979)CrossRef
5.
Zurück zum Zitat Kimura, M., Saito, K., Motoda, H.: Blocking links to minimize contamination spread in a social network. ACM Trans. Knowl. Discov. Data 3, 9:1–9:23 (2009)CrossRef Kimura, M., Saito, K., Motoda, H.: Blocking links to minimize contamination spread in a social network. ACM Trans. Knowl. Discov. Data 3, 9:1–9:23 (2009)CrossRef
7.
Zurück zum Zitat Ohara, K., Saito, K., Kimura, M., Motoda, H.: Maximizing network performance based on group centrality by creating most effective k-links. In: Proceedings of the 4th IEEE International Conference on Data Science and Advanced Analytics (DSAA 2017), pp. 561–570 (2017) Ohara, K., Saito, K., Kimura, M., Motoda, H.: Maximizing network performance based on group centrality by creating most effective k-links. In: Proceedings of the 4th IEEE International Conference on Data Science and Advanced Analytics (DSAA 2017), pp. 561–570 (2017)
8.
Zurück zum Zitat Oliveira, E.L., Portugal, L.S., Junior, W.P.: Determining critical links in a road network: vulnerability and congestion indicators. Procedia Soc. Behav. Sci. 162, 158–167 (2014)CrossRef Oliveira, E.L., Portugal, L.S., Junior, W.P.: Determining critical links in a road network: vulnerability and congestion indicators. Procedia Soc. Behav. Sci. 162, 158–167 (2014)CrossRef
9.
Zurück zum Zitat Opsahl, T., Agneessens, F., Skvoretz, J.: Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks 32(3), 245–251 (2010)CrossRef Opsahl, T., Agneessens, F., Skvoretz, J.: Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks 32(3), 245–251 (2010)CrossRef
10.
Zurück zum Zitat Saito, K., Kimura, M., Ohara, K., Motoda, H.: Detecting critical links in complex network to maintain information flow/reachability. In: Proceedings of the 14th Pacific Rim International Conference on Artificial Intelligence (PRICAI2016), pp. 419–432 (2016)CrossRef Saito, K., Kimura, M., Ohara, K., Motoda, H.: Detecting critical links in complex network to maintain information flow/reachability. In: Proceedings of the 14th Pacific Rim International Conference on Artificial Intelligence (PRICAI2016), pp. 419–432 (2016)CrossRef
11.
Zurück zum Zitat Saito, K., Kimura, M., Ohara, K., Motoda, H.: An accurate and efficient method to detect critical links to maintain information flow in network. In: Proceedings of the 23th International Symposium on Methodologies for Intelligent Systems (ISMIS2017), pp. 116–126 (2017) Saito, K., Kimura, M., Ohara, K., Motoda, H.: An accurate and efficient method to detect critical links to maintain information flow in network. In: Proceedings of the 23th International Symposium on Methodologies for Intelligent Systems (ISMIS2017), pp. 116–126 (2017)
12.
Zurück zum Zitat Sariyüce, A.E., Kaya, K., Saule, E., Çatalyürek, U.V.: Graph manipulations for fast centrality computation. ACM Trans. Knowl. Discov. Data (TKDD) 11(3), 26 (2017) Sariyüce, A.E., Kaya, K., Saule, E., Çatalyürek, U.V.: Graph manipulations for fast centrality computation. ACM Trans. Knowl. Discov. Data (TKDD) 11(3), 26 (2017)
13.
Zurück zum Zitat Shen, Y., Nguyen, N.P., Xuan, Y., Thai, M.T.: On the discovery of critical links and nodes for assessing network vulnerability. IEEE/ACM Trans. Networking 21(3), 963–973 (2013)CrossRef Shen, Y., Nguyen, N.P., Xuan, Y., Thai, M.T.: On the discovery of critical links and nodes for assessing network vulnerability. IEEE/ACM Trans. Networking 21(3), 963–973 (2013)CrossRef
14.
Metadaten
Titel
Critical Link Identification Based on Bridge Detection for Network with Uncertain Connectivity
verfasst von
Kazumi Saito
Kouzou Ohara
Masahiro Kimura
Hiroshi Motoda
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-030-01851-1_9