Skip to main content
Top

2020 | OriginalPaper | Chapter

Improved HyperD Routing Query Algorithm Under Different Strategies

Authors : Xiaoyu Tao, Bo Ning, Haowen Wan, Jianfei Long

Published in: Artificial Intelligence in China

Publisher: Springer Singapore

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

A hypercube labeling model HyperD was introduced to solve the problem of excessive bandwidth consumption and long query time between various nodes. By analyzing and adopting different strategies to improve the routing query algorithm of HyperD, a relatively more efficient routing query algorithm is proposed, which reduces the cost of communication and accelerates the data transmission between nodes. In order to verify the effectiveness of the algorithm, experiments were performed on randomly selected HyperD networks of various sizes. The improved routing algorithm was compared with the known routing algorithms, the results show that the improved algorithm is more efficient, and it can find the optimal solution in valid time.

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

Literature
1.
go back to reference Autry CW et al (2011) The new supply chain agenda: a synopsis and directions for future research. Int J Phys Distrib & Logist Manag 41(10):940–955CrossRef Autry CW et al (2011) The new supply chain agenda: a synopsis and directions for future research. Int J Phys Distrib & Logist Manag 41(10):940–955CrossRef
2.
go back to reference Smoot ME et al (2011) Cytoscape 2.8: new features for data integration and network visualization. Bioinformatics 27(3):431–432CrossRef Smoot ME et al (2011) Cytoscape 2.8: new features for data integration and network visualization. Bioinformatics 27(3):431–432CrossRef
3.
go back to reference Chuang PJ et al (2007) Hypercube-based data gathering in wireless sensor networks. J Inf Sci Eng 23(4):1155–1170 Chuang PJ et al (2007) Hypercube-based data gathering in wireless sensor networks. J Inf Sci Eng 23(4):1155–1170
4.
go back to reference Balakrishnan H et al (2003) Looking up data in P2P systems. Commun ACM 46(2):43–48CrossRef Balakrishnan H et al (2003) Looking up data in P2P systems. Commun ACM 46(2):43–48CrossRef
6.
go back to reference Toce A et al (2012) HyperD: analysis and performance evaluation of a distributed hypercube database. In: Proceedings of the sixth annual conference of ITA, Maryland, USA Toce A et al (2012) HyperD: analysis and performance evaluation of a distributed hypercube database. In: Proceedings of the sixth annual conference of ITA, Maryland, USA
7.
go back to reference Toce A et al (2017) An efficient hypercube labeling schema for dynamic peer-to-peer network. Parallel Distrib Comput 102:186–198CrossRef Toce A et al (2017) An efficient hypercube labeling schema for dynamic peer-to-peer network. Parallel Distrib Comput 102:186–198CrossRef
8.
go back to reference Broumi S et al (2017) Application of Dijkstra algorithm for solving interval valued neutrosophic shortest path problem. In: Computational intelligence Broumi S et al (2017) Application of Dijkstra algorithm for solving interval valued neutrosophic shortest path problem. In: Computational intelligence
9.
go back to reference Chen XB (2009) Some results on topological properties of folded hypercubes information. Process Lett 109(8):395–399MathSciNetCrossRef Chen XB (2009) Some results on topological properties of folded hypercubes information. Process Lett 109(8):395–399MathSciNetCrossRef
10.
go back to reference Qiao Y, Yang W (2017) Edge disjoint paths in hypercubes and folded hypercubes with conditional faults. Appl Math Comput 294:96–101MathSciNetMATH Qiao Y, Yang W (2017) Edge disjoint paths in hypercubes and folded hypercubes with conditional faults. Appl Math Comput 294:96–101MathSciNetMATH
11.
go back to reference Broumi S et al (2016) Shortest path problem under bipolar neutrosphic setting. Appl Mech Mater 859:59–66CrossRef Broumi S et al (2016) Shortest path problem under bipolar neutrosphic setting. Appl Mech Mater 859:59–66CrossRef
Metadata
Title
Improved HyperD Routing Query Algorithm Under Different Strategies
Authors
Xiaoyu Tao
Bo Ning
Haowen Wan
Jianfei Long
Copyright Year
2020
Publisher
Springer Singapore
DOI
https://doi.org/10.1007/978-981-15-0187-6_52