A routing algorithm defines a route which packet traverses to get to destination. In this research we study some kind of routingalgorithms that are used in internal connections networks of multi-processor and multi-c...
详细信息
ISBN:
(纸本)9781424417513
A routing algorithm defines a route which packet traverses to get to destination. In this research we study some kind of routingalgorithms that are used in internal connections networks of multi-processor and multi-computers systems. Then we discuss about some routingalgorithms which have been implemented network on chip architecture. First, we present a group of routingalgorithms based on various criterions, and review so-called category. Afterwards, we study adaptive and deterministic routingalgorithms and express circular model applying in internal connections networks and its governing rules in order to prevent dead lock. Then we survey adaptivealgorithms such as Deflection routing, Odd-Even, negative-first, north-last, west-first and finally we study and review routingalgorithms like Backtracking Protocols, and Deflection routing.
A routing algorithm defines a route which packet traverses to get to destination. In this research we study some kind of routingalgorithms that are used in internal connections networks of multi-processor and multi-c...
详细信息
A routing algorithm defines a route which packet traverses to get to destination. In this research we study some kind of routingalgorithms that are used in internal connections networks of multi-processor and multi-computers systems. Then we discuss about some routingalgorithms which have been implemented network on chip architecture. First, we present a group of routingalgorithms based on various criterions, and review so-called category. Afterwards, we study adaptive and deterministic routingalgorithms and express circular model applying in internal connections networks and its governing rules in order to prevent dead lock. Then we survey adaptivealgorithms such as Deflection routing, Odd-Even, negative-first, north-last, west-first and finally we study and review routingalgorithms like Backtracking Protocols, and Deflection routing.
It is important to analyse blocking probability in the WDM networks. In this paper, we present an analytical model for supporting multi-class service with the blocking probability analysis and adaptiverouting algorit...
详细信息
ISBN:
(纸本)9780819469465
It is important to analyse blocking probability in the WDM networks. In this paper, we present an analytical model for supporting multi-class service with the blocking probability analysis and adaptiverouting algorithm to solve the potential shortcomings in the real network. We make the use of the idea of segmented routes according to the finite wavelength conversion resources. We then combine the each segment to get the whole blocking probability. The results show that, by adopting the adaptive routing algorithms, the network can calculate the blocking probability for all the candidate routes, and the request which takes the highest priority will choose the minimum blocking probability route. There are two features in our paper. First, a method of segmented route is designed. Second, use k-shortest routing algorithm to get the minimum blocking probability routing between source node and destination node.
This paper uses the idea of dynamic channel selection to balance traffic in a mesh network. The key point is to maintain the history of channel utilisation in each node. Based on the recorded information, the node rou...
详细信息
This paper uses the idea of dynamic channel selection to balance traffic in a mesh network. The key point is to maintain the history of channel utilisation in each node. Based on the recorded information, the node router can predict the current load distribution and route packets through less trafficked channels to avoid congestion. To fit different routing characteristics, three dynamic channel selection policies, DCS-I, DCS-II and DCS-III, are presented. Experimental results show that when network traffic gets heavy, DCS-II and DCS-III yield constantly better throughput, lower communication latency and more even buffer utilisation - pinpointing the important link between balanced network traffic and desirable performance.
adaptiverouting and virtual channels are used to increase routing adaptivity in wormhole-routed two-dimensional meshes. But increasing channel buffer utilization without considering even distribution of the traffic l...
详细信息
adaptiverouting and virtual channels are used to increase routing adaptivity in wormhole-routed two-dimensional meshes. But increasing channel buffer utilization without considering even distribution of the traffic loads tends to cause congestion in the most adaptiverouting area. To avoid such traffic congestion, a concept of the restricted area is proposed in this paper. The proposed restricted area, defined to be a part of the network where message transmission concentrates, can be located following the region of adaptivity. By properly guiding message routing inside and outside the area, we are able to achieve more balanced buffer utilization and to reduce traffic congestion accordingly. The performance of several routingalgorithms with or without using the restricted area is simulated and evaluated under various traffic loads and distribution patterns. The results indicate that routingalgorithms with the restricted areas yield constantly larger throughput and smaller latency than routingalgorithms without using the concept.
In this paper, a survey of some packet-switched routing methods for massively parallel computers is presented. Some of the techniques are applicable to both shared-memory and message-passing architectures. These routi...
详细信息
In this paper, a survey of some packet-switched routing methods for massively parallel computers is presented. Some of the techniques are applicable to both shared-memory and message-passing architectures. These routing methods are compared in terms of their efficiency in mapping to parallel machines, network delays and interconnection topologies, deadlock and livelock freedom, and adaptivity to network congestion.
暂无评论