Efficient routing algorithms on optoelectronic networks

  • Authors:
  • J. Al-Sadi;Ahmad M. Awwad

  • Affiliations:
  • Computer Science Department, Arab Open University, Amman, Jordan;Computer Science Department, Zarka Private University, Zarka, Jordan

  • Venue:
  • TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes an efficient fault tolerant routing algorithm for the class of optoelectronic networks. Extended Optoelectronic Cube interconnection network; EOC for short; is introduced as a new member of this family. EOC is constructed from multiplying the hypercube as a factor network by it self. In this paper we utilize the features of optoelectronic networks which use both of electronic and optical networks. The EOC utilizes the good features of the Hypercube network due to its attractive features in terms of connectivity, semantic, low diameter, and multiple alternative paths in addition to the extended Optoelectronic capabilities of using both electronic and optical technologies. In this new proposed algorithm, each node A starts by computing the first level unsafety set, S1A, composed of the set of unreachable direct neighbours. It then performs m-1 exchanges with its neighbours to determine the k-level unsafety sets SkA for all 1 ≤ k ≤ m, where m is an adjustable parameter between 1 and 2n. The k-level unsafety set at node A represents the set of all faulty nodes at Hamming distance k from A which either faulty or unreachable from A due to faulty nodes or links.