Many different factors, such as topology, routing technique, selection function, flow control policy, complexity of router design, contribute to the performance of networks on chip (NoCs). Among these factors, the cho...
详细信息
Many different factors, such as topology, routing technique, selection function, flow control policy, complexity of router design, contribute to the performance of networks on chip (NoCs). Among these factors, the choice of topology and routing function has a significant effect on the average packet latency and saturation behavior. Torus is popular in many application domains, while the problem of virtual channel misbalance caused by its deadlock avoidance scheme brings lots of performance pathologies. In this paper, we present a novel deadlock avoidance scheme based on draining scheme, and propose a deadlock-free routing scheme for torus networks. We quantify the effects of the proposed routing scheme on the overall network performance by presenting simulation results for 1-D torus and 2-D torus NoCs. Experimental results show that the novel routing algorithm for torus networks could make more efficient use of virtual channel resources, and hence cutting down packet latency and boosting throughput. Note although this paper has considered 1-D and 2-D torus networks in the experimental evaluation, the new scheme is flexible enough to support highradix torus networks.
Today,the power line carrier communication(PLCC) technology has become a research focus in the field of *** is important to study on the PLCC routing algorithms,since the power line carrier channel has the characteris...
详细信息
ISBN:
(纸本)9781510805750
Today,the power line carrier communication(PLCC) technology has become a research focus in the field of *** is important to study on the PLCC routing algorithms,since the power line carrier channel has the characteristics of high time-variation,high noise and high *** PLCC routing algorithms that have been proposed,such as the artificial spider web routing algorithm,ant-colony based routing algorithm,and flooding algorithm etc.,are feasible in principle,but their actual performance is not *** this paper,the method for simulation on a PLCC routing algorithm which is similar to the dynamic source routing algorithm,using OPNET,is *** only the methods for OPNET modelling but also the experimental results are presented in the *** have important reference values for design of a PLCC network.
Chip Multiprocessors (CMPs) leverage multiple processing units to improve computational speed and efficiency. routing algorithms in NoC (Network-on-Chip) architectures ensure efficient data communication between these...
详细信息
This paper proposes a three‐layer channel routing algorithm for a new HVH routing method using the graph‐theoretic technique aiming at the minimization of the routing area. In the proposed method, the total net list...
详细信息
Farmland environment is away from power facilities and its information collection lasts long time. These characteristics make the wireless sensor networks in agriculture face the problem of energy constraint. Efficien...
详细信息
ISBN:
(纸本)9783038350125
Farmland environment is away from power facilities and its information collection lasts long time. These characteristics make the wireless sensor networks in agriculture face the problem of energy constraint. Efficient routing and sleeping algorithm can save energy. Considering the node residual energy and the collection cycle of the destination nodes, this paper improved a WSN routing and sleeping algorithm based on the AODV routing algorithm. This algorithm establishes routing path based on the node residual energy and the node collection cycle. Node sleeping cycle determined after the routing path has been established. By routing path selection and appropriate sleeping cycle this algorithm can reduce overall energy consumption and avoid excessive energy consumption of some individual nodes.
routing has been the most focused area for its nodes' mobility and topology variability. In order to reduce the number of routing reconstruction, the control cost and affording the QoS guarantee, the paper present...
详细信息
routing has been the most focused area for its nodes' mobility and topology variability. In order to reduce the number of routing reconstruction, the control cost and affording the QoS guarantee, the paper presents a stable QoS routing algorithm based on location predicting (QRALP). The proposed algorithm acquires the nodes' location by GPS and confines the scope of routing request. It adopts the motion predicting technology to evaluate the stability of the links and select the most stable QoS routing from source to destination. The simulation results show that the QRALP provides an efficient method of reducing the overload and improving the average data transmission rate in MANET.
Traditional QoS unicast routing algorithm assumes that there exists precise state information in any node within IP networks, but in a practical network, the state information is almost uncertain. In this paper, we de...
详细信息
Traditional QoS unicast routing algorithm assumes that there exists precise state information in any node within IP networks, but in a practical network, the state information is almost uncertain. In this paper, we design an improved QoS unicast routing algorithm based on uncertain information through dynamically determining the value of k in the k_shortest algorithm so as to select a better path than other algorithms. It can effectively decrease the packet loss rate and in crease the probability that the end-to-end delay constraint is met. The simulation results with NS have shown that the designed algorithm is effective.
This paper comprehensively summarizes and deeply analyzes the high performance router architectures and routing algorithms. Based on the analysis, the key problems of the router architectures are deeply discussed. Som...
详细信息
This paper comprehensively summarizes and deeply analyzes the high performance router architectures and routing algorithms. Based on the analysis, the key problems of the router architectures are deeply discussed. Some typical routing algorithm's performances are compared. Finally, the future research work is put forward.
Direct Interconnection Networks (DIN) are considered to build scalable switching fabrics for Internet routers/switches, due to its easy scalability. Furthermore, QoS (Quality of Service) guarantee is very important in...
详细信息
Direct Interconnection Networks (DIN) are considered to build scalable switching fabrics for Internet routers/switches, due to its easy scalability. Furthermore, QoS (Quality of Service) guarantee is very important in switching systems. In this paper, fair bandwidth allocation and priority traffic supporting adaptive algorithm in the DIN is presented. In the switching fabric, there are tight relationships between the schedule scheme and the routing strategy. In order to supporting QoS in the DIN, a new Priority Supporting Adaptive routing algorithm (PSAR) is presented, which considers the scheduling strategy and routing scheme at the same time. Simulation results show the algorithm can fairly allocate the output port bandwidth to each input port, and support priority traffic.
暂无评论