The 3-ary n-cube network is widely used in large-scale multi-processor parallel computers. It is an important issue to design high-performance communication technology with fault tolerance. In this paper, we study the...
详细信息
The 3-ary n-cube network is widely used in large-scale multi-processor parallel computers. It is an important issue to design high-performance communication technology with fault tolerance. In this paper, we study the fault-tolerant routing of 3-ary n-cube without desired intersection. Firstly, we propose a fully adaptive routing algorithm for 3-ary n-cube network based on the new virtual network partition technology. The virtual channel allocation of the algorithm is given and its deadlock free property is proved. Secondly, we propose a construction of disjoint paths in 3-ary n-cube networks under the fault model. Finally, we propose a novel fault-tolerant routing algorithm for 3-ary n-cube networks based on the disjoint path with structure faults. The simulation results show that the proposed fault-tolerant routing algorithm outperforms the previous fault-tolerant routing algorithm in many situations, which has a 19-21 percent increase in throughput and the injection rate.
The Label Switch Path routing algorithm in Multiprotocol Label Switching (MPLS) has become an important topic in Traffic Engineering. This paper presents a new routing scheme with precomputation, called the Least Maxi...
详细信息
The Label Switch Path routing algorithm in Multiprotocol Label Switching (MPLS) has become an important topic in Traffic Engineering. This paper presents a new routing scheme with precomputation, called the Least Maximum Flow Categories routing algorithm. In the MPLS network, different ingress-egress pairs have different maximum flow values on different links. Each link has a vector consisting of the maximum flow values flowing through it. This paper considers these vectors as weights of links and presents a method for calculating them. Simulation results show that the algorithm has the same precision as the other algorithms but has less computational complexity. Copyright (C) 2011 John Wiley & Sons, Ltd.
The line expansion algorithm provided by Heynes was a new kind of routing algorithm that took advantage of both Lee's algorithm and linear expansion algorithms, and hence was more efficient. However, it was less e...
详细信息
The line expansion algorithm provided by Heynes was a new kind of routing algorithm that took advantage of both Lee's algorithm and linear expansion algorithms, and hence was more efficient. However, it was less efficient in two layer routing situations. In this paper, this problem is analysed and several ways of solving it are proposed. Three criteria are provided in the paper, and these are used in the development of a modified line expansion algorithm. The modified algorithm is not only fast but also consumes less memory in two layer routing situations. Based on this algorithm, a Fortran printed circuit board routing system is built that can solve two layer routing problems with up to 2600 connection lines on a microcomputer with 64 kbyte RAM.
Hybrid Wireless Optical Broadband Access Networks (WOBAN) are the cost effective solution to overcome the increasing demand of the bandwidth. However, there is significant mismatch in the performance of the wireless a...
详细信息
Hybrid Wireless Optical Broadband Access Networks (WOBAN) are the cost effective solution to overcome the increasing demand of the bandwidth. However, there is significant mismatch in the performance of the wireless and optical part. In the wireless part of WOBAN, a packet has to travel through several hops due to which the data packet has to incur a significant delay. In this paper we propose a Delay Sensitive routing algorithm (DSRA) which significantly reduces the delay in the wireless part. The proposed DSRA treats the data on the basis of delay sensitivity. Simulation results show a significant improvement in the overall performance of WOBAN.
Opportunistic networks are random networks and do not communicate with each other among respective communication *** situation leads to great difficulty in message *** paper proposes a reducing energy consumption opti...
详细信息
Opportunistic networks are random networks and do not communicate with each other among respective communication *** situation leads to great difficulty in message *** paper proposes a reducing energy consumption optimal selection of path transmission(OSPT) routing algorithm in opportunistic *** algorithm designs a dynamic random network topology,creates a dynamic link,and realizes an optimized selected *** algorithm solves a problem that nodes are unable to deliver messages for a long time in opportunistic *** to the simulation experiment,OSPT improves deliver ratio,and reduces energy consumption,cache time and transmission delay compared with the Epidemic algorithm and Spray and Wait algorithm in opportunistic networks.
Continuous technology scaling in semiconductor industry makes the system reliability as a serious concern in the area of nanoscale computing. In this paper, a fully adaptive routing algorithm is proposed to overcome f...
详细信息
Continuous technology scaling in semiconductor industry makes the system reliability as a serious concern in the area of nanoscale computing. In this paper, a fully adaptive routing algorithm is proposed to overcome faults in NoCs (Network-on-Chip). This algorithm called DINRA-NoC (DIstiributed and New routing algorithm for NoC) is distributed, fault tolerant and congestion-aware. First, each node selects the appropriate output to route packets to neighbor routers according to the state of each link and router. Secondly, the proposed routing algorithm takes in account the status of adjacent routers traffic to update the congestion metric. DINRA-NoC does not use any VCs (Virtual Channels) and is deadlock-free. A simulation of the proposed routing algorithm has been carried out using Noxim simulator. The results show that DINRA ensures a good reliability rate despite of the presence of many faulty routers/links. In other hand, the simulation results indicate that the performance of the proposed routing algorithm surpasses the performance of existing algorithms in terms of lowering the congestion, improving average latency and increasing throughput.
Space networking has captured increasing attentions because of its wide application scenarios. Facing to the technical challenges of space networking including topology alteration, non-realtime condition capture and c...
详细信息
Space networking has captured increasing attentions because of its wide application scenarios. Facing to the technical challenges of space networking including topology alteration, non-realtime condition capture and control, and instable communication and control reliability, this article introduce software-defined networking (SDN) into space networking and proposes software-defined space networking, named SDSN. The architecture and the detailed strategy based routing algorithm are designed. SDSN has three key features: the predeterminate rules, strategy based routing algorithm, and redundant space-ground controlling strategy. These features address the three challenges pointedly. The simulation results confirm the advantages.
In this paper, a CAODV-based routing approach is proposed which uses multi-channel and multi-path forwarding techniques to deal with the time-varying activities of PUs. We also benefited from a suitable channel select...
详细信息
In this paper, a CAODV-based routing approach is proposed which uses multi-channel and multi-path forwarding techniques to deal with the time-varying activities of PUs. We also benefited from a suitable channel selection strategy with the goal of increasing throughput. Our method allocates interference-free channels and, if data is entered or activated, each node will select a path. The proposed routing mechanism, in turn, considers the relay loading, and the interference of the common channel in the primary and secondary nodes. We use the Lyapunov optimization queuing model in a multi-channel network. What is clear from the simulation results is that the proposed protocol improves end to end delay, PDR and throughput performance significantly in comparison to another protocols such as SEARCH and CAODV.
In recent years, the idea of wireless three-dimensional network-on-chips (3D NoCs) was promoted in order to design many-core chips with greater performance and lower energy consumption. This technology is the combinat...
详细信息
In recent years, the idea of wireless three-dimensional network-on-chips (3D NoCs) was promoted in order to design many-core chips with greater performance and lower energy consumption. This technology is the combination of different dies that are stacked on each other. Therefore, it is necessary to propose a suitable routing mechanism for irregular wireless 3D NoCs that can support the agnostic topologies. In this paper, we propose a deadlock-free routing algorithm for wireless 3D NoCs, called Floyd-base Inter-chip Traffic distribution (FIT), which is based on Floyd routing algorithm. In FIT algorithm, the number of hops is reduced compared to the already established deterministic algorithms;moreover, the traffic distribution is improved. Evaluation results show that our proposed routing algorithm significantly improves the performance and throughput by reducing the energy consumption, the average hop count and the communication latency.
As a space-based component of space-air-ground integrated networks, low earth orbit (LEO) satellite systems have always been a research hotspot in space explorations thanks to the global coverage, short communication ...
详细信息
As a space-based component of space-air-ground integrated networks, low earth orbit (LEO) satellite systems have always been a research hotspot in space explorations thanks to the global coverage, short communication delay, low launch cost and strong survivability. However, the high dynamics of network topology and the time-varying distribution of link resources would deteriorate the quality of service (QoS) for LEO satellite networks. In order to reduce communication delay and ensure end-to-end (E2E) data transmissions, a joint minimum hop and earliest arrival (MHEA) routing algorithm for LEO satellite networks is proposed in this article. Firstly, based on the networking mode of Walker constellations, a coordinate graph (CG) model is proposed to accurately characterize both the topological structure and link resource distribution of time-varying networks in the two-dimensional Cartesian coordinate system. Afterwards, a CG-based minimum hop (MH) routing model is leveraged to calculate the minimum E2E hop count and determine the region of the minimum hop path. Finally, an earliest arrival (EA) strategy is proposed to determine the next hop node with the shortest delay. Simulation results demonstrate that the proposed MHEA routing algorithm not only reduces the route count, the hop count and the delay of E2E path, but also improves the file delivery ratio.
暂无评论