Detour paths algorithm using the vectors in Hypercube Networks 


Vol. 34,  No. 12, pp. 1123-1130, Dec.  2009


PDF Full-Text
  Abstract

The advances in networking technology and importance of multimedia communication require real time transaction. In many applications, high reliable real-time communications are required more frequently. In this paper, we propose a reliable communication in cube-based multi -computer using the safety vector. Each node in a cube-based n dimensional multi-computer is associated with a safety vector of n bits, which is an approximated measure of the number and distribution of faults in the neighborhood. We propose an algorithm that can establish detour paths using the safety vector. The established detour paths are disjoint with the primary real-time channel. Therefore, our algorithm is more efficient than earlier proposed algorithms.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. Jin and C. Rhee, "Detour paths algorithm using the vectors in Hypercube Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 12, pp. 1123-1130, 2009. DOI: .

[ACM Style]

MIng-He Jin and Chung-Sei Rhee. 2009. Detour paths algorithm using the vectors in Hypercube Networks. The Journal of Korean Institute of Communications and Information Sciences, 34, 12, (2009), 1123-1130. DOI: .

[KICS Style]

MIng-He Jin and Chung-Sei Rhee, "Detour paths algorithm using the vectors in Hypercube Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 12, pp. 1123-1130, 12. 2009.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880