References
1. 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–955
2. Smoot ME et al (2011) Cytoscape 2.8: new features for data integration and network
visualization. Bioinformatics 27(3):431–432
3. Chuang PJ et al (2007) Hypercube-based data gathering in wireless sensor networks. J Inf
Sci Eng 23(4):1155–1170
4. Balakrishnan H et al (2003) Looking up data in P2P systems. Commun ACM 46(2):43–48
5. Toce A et al (2011) HyperD: a hypercube topology for dynamic distributed federated
databases. In: The fifth annual conference of the international technology alliance, UMD,
College Park, Maryland, USA. https://www.researchgate.net/publication/245535766
6. 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. Toce A et al (2017) An efficient hypercube labeling schema for dynamic peer-to-peer
network. Parallel Distrib Comput 102:186–198
8. Broumi S et al (2017) Application of Dijkstra algorithm for solving interval valued
neutrosophic shortest path problem. In: Computational intelligence
9. Chen XB (2009) Some results on topological properties of folded hypercubes information.
Process Lett 109(8):395–399
10. Qiao Y, Yang W (2017) Edge disjoint paths in hypercubes and folded hypercubes with
conditional faults. Appl Math Comput 294:96–101
11. Broumi S et al (2016) Shortest path problem under bipolar neutrosphic setting. Appl Mech
Mater 859:59–66
Improved HyperD Routing Query Algorithm Under Different …
441
1. 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–955
2. Smoot ME et al (2011) Cytoscape 2.8: new features for data integration and network
visualization. Bioinformatics 27(3):431–432
3. Chuang PJ et al (2007) Hypercube-based data gathering in wireless sensor networks. J Inf
Sci Eng 23(4):1155–1170
4. Balakrishnan H et al (2003) Looking up data in P2P systems. Commun ACM 46(2):43–48
5. Toce A et al (2011) HyperD: a hypercube topology for dynamic distributed federated
databases. In: The fifth annual conference of the international technology alliance, UMD,
College Park, Maryland, USA. https://www.researchgate.net/publication/245535766
6. 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. Toce A et al (2017) An efficient hypercube labeling schema for dynamic peer-to-peer
network. Parallel Distrib Comput 102:186–198
8. Broumi S et al (2017) Application of Dijkstra algorithm for solving interval valued
neutrosophic shortest path problem. In: Computational intelligence
9. Chen XB (2009) Some results on topological properties of folded hypercubes information.
Process Lett 109(8):395–399
10. Qiao Y, Yang W (2017) Edge disjoint paths in hypercubes and folded hypercubes with
conditional faults. Appl Math Comput 294:96–101
11. Broumi S et al (2016) Shortest path problem under bipolar neutrosphic setting. Appl Mech
Mater 859:59–66
Improved HyperD Routing Query Algorithm Under Different …
441