Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

AN ANALYSIS OF PARALLEL ROUTING ALGORITHM OF HYPERCUBE NETWORK BY EMPLOYING COVERING PROBLEM AND ASSIGNMENT PROBLEM

  • Published : 1997.06.01

⟨ Previous Next ⟩

Abstract

The application of Hadamard matrix to the paral-lel routings on the hypercube network was presented by Rabin. In this matrix every two rows differ from each other by exactly n/2 positions. A set of n disjoint paths on n-dimensional hypercube net-work was designed using this peculiar property of Hadamard ma-trix. Then the data is dispersed into n packets and these n packet are transmitted along these n disjoint paths. In this paper Rabin's routing algorithm is analyzed in terms of covering problem and as-signment problem. Finally we conclude that n packets dispersed are placed in well-distributed positions during transmisson and the ran-domly selected paths are almost a set of n edge-disjoint paths with high probability.

Keywords

References

  1. IEEE Trans. Compt. v.37 no.7 Topological Properties of Hypercubes Saad, Y.;Schultz, M.H.
  2. IEEE Trans. Compt. v.38 no.9 Optimum Broadcasting and Personalized Communication in Hypercube Johnsson, S.L.;Ho, C.-T.
  3. IEEE Trans. Compt. v.46 no.2 Reliable Unicasting in Faulty Hypercubes Using Safety Levels Wu, J.
  4. J. ACM v.36 no.2 Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance Rabin, M.O.
  5. Errpr Correcting Coding Theory Rhee, M.Y.
  6. J. Korea Info. Soc. v.23 no.12 The Dseign of Information Dispersal using the FFT Algorithm(IDAF) for Secure and Fault-Tolerant Communications in Distributed Environment Choi, W.;Chung, I.;Lee, S.
  7. Sphere Packings, Lattices, and Groups Conway, J.H.;Sloane, N.J.
  8. Naval Res. Logist. Quart. v.2 The Hungarian Method for the Assignment Problem Kuhn, H.W.
  9. Introduction to Combinatorial Mathematics Liu, C.