Dissertation > Excellent graduate degree dissertation topics show

Research on Deadlock and Load Balance in k-ary n-cube Networks

Author: LiuJunHui
Tutor: WangChangShan
School: Xi'an University of Electronic Science and Technology
Course: Computer Software and Theory
Keywords: K-ary n-cube Network Routing algorithm Load balance Deadlock
CLC: TP393.03
Type: Master's thesis
Year: 2008
Downloads: 39
Quote: 0
Read: Download Dissertation


As a popular topology of Interconnection network, k-ary n-cube has faced many problems currently, such as multi-application, multi-business and the imbalance of traffic distribution, which requires the routing algorithms to be load balanced and the deadlock-free algorithms to be adaptive under various traffic modes.Current technologies solve these problems inadequately, such as the imbalance of resource utilizing in load balancing routing algorithms and too high rate of false deadlock detection in previous deadlock detection algorithms. To solve these problems, two new algorithms are presented in this paper.Based on of the analysis of the existing deadlock technologies, CDD (Cycle based Deadlock Detection routing algorithm) is proposed firstly. Different from traditional deadlock detection mechanism of time-out, CDD uses the conditions of cyclic dependency to detect deadlock packets. Based on the features of topology of k-ary n-cube networks, the detection is divided into deadlock detection in the same dimension and deadlock detection in the different dimension. In the same dimension detection, CDD utilizes the strategy of flow control, i.e. the deadlock is detected according to the remained buffers in the channels before the packets come into these channels; While in different dimensions, deadlock is detected by the turning of the packets. Then, CDD uses the interval of busy time of all the output channels these packets applying for the final detection.Secondly, in view of problems of the existing load balancing routing algorithms, a new quadrant crossing routing (QCR) algorithm is proposed. According to source and destination node of each packet, network is divided into several quadrants with various weights. QCR sets quadrant crossing rules and allows packets to cross quadrants based on the network state, which makes traffic distribution more balanced. Network state is determined by the interval between the last two requests to the same output.Finally, performance of the proposed routing algorithms is evaluated by OPNET under various traffic modes and comparisons with the existing algorithms (CDD vs. soft-based, QCR vs. Dimension order routing algorithm, duato, and GAL) are made. The results show that CDD has lower rate of false deadlock detection, less sensitivity of the time-threshold and QCR achieves better performance.

Related Dissertations

  1. The Research and Application of Stochastic Routing in Wireless Sensor Networks,TN929.5
  2. A Study on Basic Legal Issues of the Company Judicial Dissolution Lawsuit,D922.291.91
  3. Improvement and Realization of AODV in Wireless Sensor Networks,TP212.9
  4. A Design of Intelligent Terminal in Internet of Vehicles and Research of Its Routing Algorithm,TP391.44
  5. Research on Routing Protocol of ZigBee Wireless Network,TP212.9
  6. Research on Survivability of Key Technologies in Multi Domain and Multi Layer Optical Network,TN929.1
  7. Research on the Symmetrical Delay Service Path Protection Algorithm of Automatic Switched Optical Network,TN929.1
  8. Reinforcement Learning-based Routing Mechanism for Multi-sink Wireless Sensor Networks,TP212.9
  9. Judicial Dissolution Legal Issues,D922.291.91
  10. Our Company Deadlock, Judicial Remedy the Dilemma That Face and Countemeasure,D922.291.91
  11. Research on Company Dissolution Litigation in the State of Corporation Deadlock,D922.291.91
  12. Research on Protecting the Interests of Minority Shareholders in Company Deadlock,D922.291.91
  13. A Distributed Routing Algorithm for L-PLC Network and the Design of Management Platform Based on LonWorks,TM73
  14. The Design of Petri Nets Controller for Discrete Event Systems,TP301.1
  15. The Research of Topology in Network on Chip,TN47
  16. On the Overview of Share Transferring in Force,D922.291.91
  17. Shareholders request the dissolution of the company the right to study,D922.291.91
  18. Study and Design of Screen Web Server Cluster,TP393.05
  19. On the Prevention and Relief of Company Deadlock,D922.291.91
  20. Judicial Dissolution of the system of legal positivism,D922.291.91
  21. Research on Artificial Spiderweb Routing Algorithms Oriented Smart Grid,TM76

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