Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

21

Voted
PDCAT

2007

Springer

2007

Springer

A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A binomial graph network (BMG) is a circulant graph where jk is the power of 2 that is less than or equal to n. This paper presents an optimal (shortest path) two-terminal routing algorithm for BMG networks. This algorithm uses only the destination address to determine the next hop in order to stay on the shortest path. Unlike the original algorithms, it does not require extra space for routing tables or additional information in the packet. The experimental results show that the new optimal algorithm is signiﬁcantly faster than the original optimal algorithm.

Related Content

Added |
09 Jun 2010 |

Updated |
09 Jun 2010 |

Type |
Conference |

Year |
2007 |

Where |
PDCAT |

Authors |
Thara Angskun, George Bosilca, Bradley T. Vander Zanden, Jack Dongarra |

Comments (0)