Dissertation > Excellent graduate degree dissertation topics show

Research and Data Field Theory an Important Node in the Network Addressing Algorithm

Author: LvLe
Tutor: YuHeWei
School: South China University of Technology
Course: Applied Computer Technology
Keywords: Source Routing Middle -class routing Data Field Important node Routing addressing
CLC: TP393.01
Type: Master's thesis
Year: 2011
Downloads: 60
Quote: 0
Read: Download Dissertation

Abstract


How to ensure the rapid development of Internet applications, the network transmission efficiency and improve routing quality, network routing optimization of the hot issues of the scholars. How to effectively manage the network bandwidth to take full advantage of the resources of the network to avoid network congestion and time delay, has become a major challenge faced by the Internet. In this paper, the advantages of source routing technology and intermediate routing technology proposed by the important nodes of the network routing forwarding method used to reduce link recovery time and bandwidth consumption in the network failure occurs, the node routing addressing important optimization of the program. The important node routing addressing the key is how to determine the important nodes in the network. In order to fully and objectively assess the importance of each node in the communication network, starting from the point of view of the data field theory, a comprehensive evaluation of the nodes in the network introduced node topology potential to do some useful attempts to measure the importance of network nodes . This paper first introduces source-routing technology and middle-class routing technology, drawing on the idea of ??hierarchical routing network build hierarchical strategy, through the election of an important node in the network, combined with source routing technology, the use of the middle the important node in the routing forwarding new ideas. When the source node to the destination node to send packets not directly send packets to the destination node, but the first to be sent to an important node in the network, the important node data information is forwarded to the destination node. Therefore, by pre-set an important node in the network, and corresponding increases in processing capacity, to improve the survivability of the network as a whole, to reduce congestion and latency of network failure brought. Routing addressing the key is how to pre-selected important node in the network. Secondly, this paper expounded the principles of data field theory based on the proposed method of the potential of the use of node topology comprehensive assessment of the importance of nodes, denoted by the algorithm based on the importance of the data field theory assessment node (Estimating Network Node Importance Based on Data Field Theory, ENIBDF). The potential of the each node in the topology is based on the shortest path between the length and the degree of the node, the node impact factor to determine. Sort node topological potential, it can be important to find the set of nodes. Then this article experimental example of the introduction of real network to verify ENIBDF algorithm can effectively measure the importance of nodes in the actual network. Finally, expounded the principles of the DV algorithm based on improved important network node addressing algorithm based on data field theory, denoted by an important node in the network routing addressing algorithm (Based on Importance Node Addressing Algorithm in The Network, BINATN). Algorithm and DV algorithm on BINATN then in NS2 network simulation platform, simulation experiments, and the packet loss rate, throughput and time delay of three aspects of network performance comparison analysis. The experimental results indicate that the set in the network node, and through the the important node routing addressing BINATN algorithm, the network failure occurs, it is faster to establish a new path, and improve the throughput of the entire network, effectively improved network communication performance and reduce the network packet loss rate of data transmission.

Related Dissertations

  1. The Research on Routing Protocols and Related Technology of Wireless Mesh Network Based on QoS,TN929.5
  2. Research on Jamming Tactics of WIN-T,TN972.2
  3. Chinese Text Clustering Based on Latent Semantic and Its Applications,TP391.1
  4. CPR and MODIS detection results based cloud top temperature and cloud top height inversion,P426.51
  5. Complex network topology modeling and visualization,TP393.02
  6. Research and Design of Routing Protocol in Military Wireless IP Network,TN929.5
  7. Research of Routing Technology in Mobile Wireless Networks Oriented to High-speed Transportation System,TN929.5
  8. The Research on Fault Propagation Characteristics of Large-scale Analog Circuit,TN710
  9. Research and Implement of Low-Power and Configurable NoC Router,TN47
  10. The Research of QoS Technology in Wireless Mesh Network,TN929.5
  11. Minimum Energy Dynamic Source Routing Based on Energy Aware,TN929.5
  12. Research on Techniques of Automatic Data Record Analysis and Recognition for Accurate Web Information Extraction,TP393.09
  13. Research on the Mobility Handoff Technologies of Hierarchical Mobile IPv6,TN929.5
  14. Cognitive packet network , multi - path routing algorithm,TN929.5
  15. Research on the Space Modeling Based on Data Field,P208
  16. Research and Implementation of the OLSR routing protocol Linux system,TN929.5
  17. Three-dimensional seismic data visualization footprinting studies,TP391.41
  18. Research of Key Technology in IPv6 Networks Topology Discovery,TP393.08
  19. Characterization of Drift Particles’ Density within Search Areas Based on the Cloud Theory and Field Theory,U675
  20. An Experimental Study on Wireless Mesh Networks,TN929.5

CLC: > Industrial Technology > Automation technology,computer technology > Computing technology,computer technology > Computer applications > Computer network > General issues > Theory of computer networks
© 2012 www.DissertationTopic.Net  Mobile