Dissertation > Excellent graduate degree dissertation topics show

high -dimensional k-ary n switch fabric and multicast research

Author: YaoQing
Tutor: XuDu
School: University of Electronic Science and Technology
Course: Communication and Information System
Keywords: k-ary n exchange structure High-dimensional Multicast KMPAMR algorithm
CLC: TN915
Type: Master's thesis
Year: 2008
Downloads: 33
Quote: 0
Read: Download Dissertation

Abstract

In the rapid development of Internet, broadband video, multimedia and business-to-router technology put forward higher requirements, the rapid growth of network traffic exchange capacity also requires escalating. k-ary n exchange structure due to its flexible scalability, and has become a popular choice for building large-capacity scalable routers. On the one hand, large capacity switching network using multidimensional the exchange structure built distributed packet switching technology trends. Comparing the same type of topology, the different dimensions of multidimensional exchange structure, under normal circumstances, the high-dimensional structure in throughput, exchange delay performance indicators have a natural advantage. If the total number of switching nodes (i.e. exchange structure scale) fixed, high dimension means fewer nodes per dimension, a high degree of node connection, so that the exchange structure is smaller in diameter, on the fractional bandwidth greater. Small diameter, will help reduce the delay of exchange of sub-bandwidth greatly help to improve the throughput, because the exchange capacity of the multidimensional exchange structure theoretically can reach their bisection bandwidth is proportional to. However, the high dimensions also bring the cost and technical problems. High dimension means that a high degree of connectivity for each node, and thus need more interconnect channel and node cache. This directly increases the cost of the realization of the exchange structure, while increasing the switching nodes cache management, scheduling, control the difficulty of information transmission and processing module, and not conducive to the node implementations. And because the number of interconnection channels increases rapidly with the number of nodes increases, so that its scalability is restricted. Restrictions limited to complex interconnect can achieve, so one of the direction of future research is to use optical media to connect multi-dimensional switching fabric. On the other hand, in the face of the rapid growth of new businesses such as video conferencing, Computer Supported Cooperative Work, multicast communication applications more and more widespread, relatively traditional point-to-point communication, multicast is not only able to save a lot of network bandwidth, and can improve work efficiency. With the increasing performance requirements multicast, multicast applications gradually extends from the application layer to the lower layer of the network structure, switching and routing layer multicast has become the hot spot of the current domestic and international research. k-ary n prescription multicast either through software, can also rely on hardware support can be achieved. Hardware overhead will increase the cost of system design and implementation complexity, and reduce the speed of the routing hardware. The same time, the existing system mostly only support point-to-point unicast routing in k-ary n. Therefore, the use of the existing unicast to multicast software level for a long time within the current and future good choice. To solve the above problem, the existing software multicast algorithms to make improvements; design based unicast routing, multicast routing algorithms: KMPAMR (K-Mesh Partition-based Adaptive Multicast Routing) algorithm; build a k-ary n generic simulation model of the structure of the party exchange, strategy-oriented design patterns provide a common access interface for different routing algorithms, and performance of the algorithm are analyzed and discussed. The experiments indicate that the two algorithms proposed in this paper can achieve better performance. First, the exchange from the k-ary n exchange structure, the deadlock problem wormhole routing algorithms and virtual channel flow control several perspective describes the background of this study. Goes on to describe the problems that need attention build a multi-dimensional switching fabric and multicast prospects. Secondly, multidimensional exchange structure background, and simulation of the topology of different dimension. The analysis of the changes caused by the dimension of the torus switch fabric performance and complexity. Again, on the basis of analysis of existing software multicast algorithm proposed multicast routing algorithm designed by a concurrent multicast traffic: KMPAMR algorithm. KMPAMR algorithm has a more flexible way to partition to improve performance of multicast through increased parallelism multicast routing flexibility. Simulation results show that in the case of low load KMPAMR algorithm can obtain higher throughput and lower latency, but will accelerate the exchange structure \Once \Finally, in order to investigate the performance of multidimensional exchange structure and KMPAMR algorithm in OPNET platform to build generic simulation model based on k-ary n exchange wormhole switching and virtual channel flow control structure, strategy-oriented design patterns for the different routing algorithms provide a common access interface. In addition, the combination of a discussion of the simulation results, the proposed reference proposals to carry out further research.

Related Dissertations

CLC: > Industrial Technology > Radio electronics, telecommunications technology > Communicate > Communication network
© 2012 www.DissertationTopic.Net Mobile