MPPR: A heuristic routing algorithm in dynamic HyperD labeling model

DOI

10.2991/iccia-17.2017.86How to use a DOI?

Keywords

Hypercube network, HyperD, routing algorithm of communication, labeling schema, Peer-to-Peer networks.

Abstract

Hypercube network is one of the most important multiprocessing mechanisms in parallel computing. At present, many network topologies are proposed by using hypercube characteristics. Such as Peer-to-Peer networks. The MPPR algorithm proposes in this paper is an improvement for the routing algorithm of HyperD (a labeling schema Peer-to-Peer networks), and the god is to find a better path in the effective period of time. The algorithm consists of two steps in which querying at all paths that satisfy the conditional probability ratio and then select the optimal path. The algorithm can find better paths in small time fluctuation range, thus it saves overhead of the network.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yu Wang
AU  - Bo Ning
AU  - Xin Zhou
AU  - Yawen Zheng
AU  - Yi Li
PY  - 2016/07
DA  - 2016/07
TI  - MPPR: A heuristic routing algorithm in dynamic HyperD labeling model
BT  - Proceedings of the 2nd International Conference on Computer Engineering, Information Science & Application Technology (ICCIA 2017)
PB  - Atlantis Press
SP  - 506
EP  - 509
SN  - 2352-538X
UR  - https://doi.org/10.2991/iccia-17.2017.86
DO  - 10.2991/iccia-17.2017.86
ID  - Wang2016/07
ER  -