论文信息 - MNLIRS routing: a framework for compressed routing table and fault-tolerant routing in networks of clusters

MNLIRS routing: a framework for compressed routing table and fault-tolerant routing in networks of clusters

The Interval Routing Scheme (IRS) is a routing framework which provides a compressed routing table for efficient routing. The Multi-Node-Label Interval Routing Scheme (MNLIRS) is introduced, which extends IRS to support end-to-end fault-tolerant delivery. MNLIRS Routing has several key advantages: compressed routing table, simple routing algorithm, and fault-tolerant routing ability. Such advantages are very vital for clusters with lots of nodes and links.

Xinshan Feng | Chengde Han | Chengde Han | Xinshan Feng

[1] Peter Ruzicka,et al. A Note on the Efficiency of an Interval Routing Algorithm , 1991, Comput. J..

[2] Francis C. M. Lau,et al. A lower bound for interval routing in general networks , 1997 .

[3] Nicola Santoro,et al. Labelling and Implicit Routing in Networks , 1985, Computer/law journal.

[4] Ming-Syan Chen,et al. Adaptive Fault-Tolerant Routing in Hypercube Multicomputers , 1990, IEEE Trans. Computers.