A Self-Adaptive Routing Algorithm for Layer-Include Routing Problem in Cloud Computing

Channel routing problem is an important, time consuming and difficult problem in VLSI layout design. In this paper, we consider the two-terminal channel routing problem in a new routing model, called knock-knee diagonal model, where the grid consists of right and left tracks displayed at +45° and –45°. An optimum algorithm is presented, which obtains d + 1 as an upper bound to the channel width, where d is the channel density.

Download Full-text

An geographical adaptive routing algorithm based on overlapping area for uranium tailings radionuclide contamination monitoring in WSN

2016 6th International Conference on Electronics Information and Emergency Communication (ICEIEC) ◽

10.1109/iceiec.2016.7589706 ◽

2016 ◽

Author(s):

Xiuwu Yu ◽

Feng Zhang ◽

Feisheng Fan ◽

Lixing Zhou

Keyword(s):

Routing Algorithm ◽

Adaptive Routing ◽

Radionuclide Contamination ◽

Uranium Tailings

Download Full-text

A Splay Tree-Based Approach for Efficient Resource Location in P2P Networks

The Scientific World JOURNAL ◽

10.1155/2014/830682 ◽

2014 ◽

Vol 2014 ◽

pp. 1-11

Author(s):

Wei Zhou ◽

Zilong Tan ◽

Shaowen Yao ◽

Shipu Wang

Keyword(s):

Routing Algorithm ◽

Adaptive Routing ◽

Upper And Lower Bounds ◽

Resource Location ◽

Hop Count ◽

Worst Case ◽

Average Case ◽

Splay Tree ◽

Efficient Resource ◽

P2p System

Resource location in structured P2P system has a critical influence on the system performance. Existing analytical studies of Chord protocol have shown some potential improvements in performance. In this paper a splay tree-based new Chord structure called SChord is proposed to improve the efficiency of locating resources. We consider a novel implementation of the Chord finger table (routing table) based on the splay tree. This approach extends the Chord finger table with additional routing entries. Adaptive routing algorithm is proposed for implementation, and it can be shown that hop count is significantly minimized without introducing any other protocol overheads. We analyze the hop count of the adaptive routing algorithm, as compared to Chord variants, and demonstrate sharp upper and lower bounds for both worst-case and average case settings. In addition, we theoretically analyze the hop reducing in SChord and derive the fact that SChord can significantly reduce the routing hops as compared to Chord. Several simulations are presented to evaluate the performance of the algorithm and support our analytical findings. The simulation results show the efficiency of SChord.

Download Full-text

A Novel Adaptive Routing Algorithm for Network-On-Chip

Key Engineering Materials ◽

10.4028/www.scientific.net/kem.474-476.413 ◽

2011 ◽

Vol 474-476 ◽

pp. 413-416

Author(s):

Jia Jia ◽

Duan Zhou ◽

Jian Xian Zhang

Keyword(s):

Routing Algorithm ◽

Adaptive Routing ◽

Network On Chip ◽

Experimental Results ◽

Average Latency ◽

On Chip

In this paper, we propose a novel adaptive routing algorithm to solve the communication congestion problem for Network-on-Chip (NoC). The strategy competing for output ports in both X and Y directions is employed to utilize the output ports of the router sufficiently, and to reduce the transmission latency and improve the throughput. Experimental results show that the proposed algorithm is very effective in relieving the communication congestion, and a reduction in average latency by 45.7% and an improvement in throughput by 44.4% are achieved compared with the deterministic XY routing algorithm and the simple XY adaptive routing algorithm.

Download Full-text