Font Size: a A A

Research Of Networks Routing Protocols Based On Dynamic Aggregation Tree Models

Posted on:2007-09-22Degree:MasterType:Thesis
Country:ChinaCandidate:N N HanFull Text:PDF
GTID:2178360182460911Subject:Computer software and theory
Abstract/Summary:PDF Full Text Request
This paper focuses on the problem of the urgent extending routing system structure in Next Generation Internet (NGI). Based on the development current of NGI, its routing model need have the characteristics of more than one dimensionality and can be extended to different networks. This thesis designs novel routing models as well as the related routing protocols based on them. The performance evaluations are achieved by simulations.First, for the large scale character of NGI, the thesis presents the Aggregation-Tree Routing Model and the theorem of routing optimization. The routing protocol based on Aggregation-Tree Routing Model includes the aggregation-tree clustering algorithm, the aggregation-tree routing algorithm and the aggregation scheme for routing control information. It is proved in theory that Aggregation-Tree routing model has a high routing accuracy and the low communication complexity.Second, for the dynamic character of NGI, the solution is the Incremental Routing Model. This model use the novel Increment Algorithm, which is based on the understanding of the dynamic topology update procedure applicable in large scale networks to avoid the disadvantages (e.g. redundant computation) caused by existing update algorithms. The efficiency of our algorithm is improved because it only pays attention to the links really count for the update process.Third, two models mentioned in the former section are united to generate the combination model-Dynamic Aggregation-Tree Model. This model has extended the large space scale dimension for networks, and also can reflect the dynamic changes of network states in good time, so it provides a multidimensional model that can consider both the space character and time character of NGI.Last, the novel Dynamic Aggregation-Tree Model is applied to Internet and Wireless Ad hoc Networks, and is simulated under NS2 platform. Based on the results of simulation, the Dynamic Aggregation-Tree Model is analyzed in the time, communication complexity and throughput, and is separately compared in several performances with the existing protocols. As a result, the problem and prospect of the combination model is analyzed and evaluated.
Keywords/Search Tags:Dynamic Topology Changes, Aggregation Tree Protocol, Incremental Routing Algorithm, Dynamic Aggregation Tree Model
PDF Full Text Request
Related items