Font Size: a A A

A Fault-tolerant Routing Scheme: Node Multi-label Interval Routing Strategy

Posted on:2001-01-26Degree:MasterType:Thesis
Country:ChinaCandidate:X S FengFull Text:PDF
GTID:2208360185995602Subject:Computer organization and architecture
Abstract/Summary:PDF Full Text Request
Routing Technique is a key problem in the field of network. How to improve the efficiency and performance of routing method is a vital question, which must to be considered. In this paper, on the base of IRS (Interval Routing Scheme), a novel scheme, MNLIRS (Multi-Node Label Interval Routing Scheme) is introduced. This scheme can provide the ability of fault tolerance, and has the following porperties:1. The scheme assigns at least one label for each node, and can realize fault tolerance. So when certain node (in fact most of the nodes have such porperty) or link is unusable, the routing algorithm still can find the appropriate path to route messages.2. Using for reference of compact routing table in IRS, 0 routing table can be realized in MNLIRS, i.e. only the information of the node labels and the link lables of a node are stored in it. The routing algorithm uses the labels of nodes and links, in stead of routing table, to route message. Such method is called the implicit scheme.3. For each node has at least one node labels, the redundant node labels can provide more paths for routing algorithm. Using the properties of labeling algorithm, the routing algorithm can find the most optimal path or the less optimal one. Such property gives better routing efficiency to MNLIRS.
Keywords/Search Tags:Routing scheme, Fault-tolerant routing, Dynamic networks, Interval routing scheme, Routing table
PDF Full Text Request
Related items