Font Size: a A A

Routing Research For The Large Scale And Dynamic Characters Of NGI:Models And Protocols

Posted on:2006-04-08Degree:MasterType:Thesis
Country:ChinaCandidate:D LiFull Text:PDF
GTID:2168360152985449Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
In order to meet rapid development of Next Generation Intertnet (NGI), the revolutionary routing schemes which can finish routing work on more than one dimensionality are in dire need of. This thesis is about the research in routing models and protocols which can support the large scale character of NGI in time dimensionality and the dynamic character of NGI in space dimensionality. This thesis designs three novel routing models and the routing protocols based on them. The performance evaluaion are achieved by simulations.For the dynamic characher of NGI, the routing problem can be divided into two parts: the micro scale dynamic problem and the macro scale dynamic problem.This thesis presents the HTDN routing model for micro scale dynamic problem based on the time dependent theory. The routing protocol HTDRP is designed for HTDN model. The thesis analyses the time and communication complexity of HTDRP and compare the performance of HTDRP and RIP using NS2. The solution for macro scale dynamic problem is the incremental routing model and its routing protocol IARP which compute the route table only according to the changes of the networks.For the large scale characher of NGI, the thesis presents the Network-Tree routing model and the theorem of routing optimization. This model is designed in consideration of the communication capability of links. The routing protocol NTRP based on Network-Tree routing model includes the network-tree clustering algorithm, the network-tree routing algorithm and the aggregation scheme for routing control information. NTRP achieves a high routing accuracy and the low communication complexity. By simulations, NTRP gets high performance in convergence, routing accuracy and average throughput.At last part of the thesis trys to unite the separate models. As a result, two combination models are generated and evaluated.
Keywords/Search Tags:Routing Model, Routing Protocol, Time Dependent, Incremental Algorithm, Network-Tree
PDF Full Text Request
Related items