检索结果-内蒙古大学图书馆

An efficient fault-tolerant routing algorithm in NoCs to tolerate permanent faults

JOURNAL OF SUPERCOMPUTING 2016年第12期72卷 4629-4650页

作者： Akbar, Reza Etedalpour, Ali Asghar Safaei, Farshad Shahid Beheshti Univ Fac Comp Sci & Engn Tehran *** Iran

With the possibility of integrating multiple cores into a single chip, research on the networks-on-chip (NoCs) as a kind of interconnection network has assumed great significance. In such networks, the effort is to provide broadband and extendable infrastructure for multi-core architectures. Communication between processors in an NoC is established using routing algorithms. Meanwhile, NoCs, like any other system, are prone to failure. With the increase in the number of network components on a chip, the probability of failure increases, too. Therefore, considering a fault-tolerant mechanism in NoCs seems to be a necessity. The main challenge of this work is combining performance and fault tolerance while reducing power, complexity and cost. In this paper, a fault-tolerant routing algorithm for tolerating static and dynamic faults in 2D Mesh NoCs and node failure model is presented. It should be taken into consideration that despite many other routing algorithms, the proposed method uses only one Virtual Channel. Results show that this method has lower latency and power consumption than SAVA and segment-based (SB) routing algorithms. It showed 2.91 and 12.74% less power consumption than SAVA and SB, respectively, under SPLASH-2 traffic in an 8 x 8 Mesh network with 8 faulty nodes. Its average latency, under Uniform, Transpose, and SPLASH-2 traffics in a 4 x 4 Mesh with 4 faulty nodes and an 8 x 8 Mesh network with 8 faulty nodes, was reduced by 4.39 and 14.08% compared to SAVA and SB, respectively.

关键词： Fault-tolerant Networks-on-chip Mesh topology routing algorithm Permanent faults Fault region Deadlock Power consumption

来源：评论

学校读者我要写书评

暂无评论

routing algorithm Based on Ant Colony Optimization for Mobile Social Network 18

Routing Algorithm Based on Ant Colony Optimization for Mobil...

引用

18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)

作者： Wu, Yanfei Zhu, Yanqin Yang, Zhe Soochow Univ Sch Comp Sci & Technol Suzhou Peoples R China

ISBN: (纸本)9781509055043

Mobile social network (MSN) is a type of delay tolerant network explicitly considering social characteristics of the terminal nodes. The existing Ad Hoc routing protocols assume that there is at least one complete communication path between the source node and the target node. So they cannot be applied to MSN directly. The key to solve the problem of content distribution in mobile social network is how to transmit the data to the target node in the case of there is no complete communication path between the source node and the target node. As the routing algorithm based on ant colony optimization has great ability to adapt it, it is an effective method to deal with the dynamic topologies of MSN. Based on the social network characteristics of MSN, this paper proposes a new MSN routing algorithm ACOMSN based on ant colony optimization. The algorithm uses the method of processing the node information on the transmission path to get the information list between the node pairs, so as to select the appropriate relay node to provide effective information when forwarding data to other nodes. In addition, ACOMSN designs methodologies for pheromone updating and data forwarding. The simulation experiments on real data sets show that comparing with typical MSN routing algorithms, ACOMSN can effectively improve the critical performance of data transmission with considerable overhead in MSN.

关键词： mobile social network routing algorithm ant colony optimization delay-tolerant network centrality social characteristic

来源：评论

学校读者我要写书评

暂无评论

routing algorithm for Application-Specific Network-on-Chip with Irregular Core Sizes 3

Routing Algorithm for Application-Specific Network-on-Chip w...

引用

3rd IEEE International Symposium on Nanoelectronic and Information Systems (IEEE iNIS)

作者： Anirudh, Grandhi Sai Soumya, J. Birla Inst Technol & Sci Pilani Dept Elect & Elect Engn Hyderabad Campus Hyderabad Andhra Pradesh India

ISBN: (纸本)9781538613566

Routers, physical links and routing algorithms together perform the task of routing a message between different cores on a Network-on-Chip (NoC) architecture, they are among the most important parts of its structure because of their huge power consumption compared to other components of a NoC. In order to minimize the power consumed by these components it is essential to design an efficient routing algorithm. In this paper we propose an application specific routing algorithm for mesh based topologies with irregular core sizes. While there are algorithms already present for this purpose the aim of this study is to develop a more efficient algorithm by reducing the length of the path between the two communicating cores. The algorithm proposed in this paper follows wormhole switching and uses XY routing algorithm as a basis and improves on it. In this algorithm routing is performed in two steps, Mapping in X-direction followed by Y-direction. Efficiency of the proposed algorithm has been tested on different mesh networks with varying sizes and also with different locations of oversized cores in the network. Experimental results show that the proposed algorithm performs better compared to existing algorithms in the literature.

关键词： Network-on-Chip Mesh based topologies routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on optimal intelligent routing algorithm for IoV with machine learning and smart contract

引用

Digital Communications and Networks 2023年第1期9卷 47-55页

作者： Baofeng Ji Mingkun Zhang Ling Xing Xiaoli Li Chunguo Li Congzheng Han Hong Wen Henan University of Science and Technology College of Information EngineeringLuoyang471000China The Institute of Atmospheric Physics Chinese Academy of Sciences(LAGEO)Beijing100029China Longmen Laboratory Luoyang471000China Chinese Academy of Agricultural Mechanization Sciences Beijing100000China University of Bristol BristolBS00UK University of Electronic Science and Technology of China Chengdu610000China

The huge increase in the communication network rate has made the application fields and scenarios for vehicular ad hoc networks more abundant and diversified and proposed more requirements for the efficiency and quality of data *** improve the limited communication distance and poor communication quality of the Internet of Vehicles(IoV),an optimal intelligent routing algorithm is proposed in this *** multiweight decision algorithm with the greedy perimeter stateless routing protocol,designed and evaluated standardized function for link *** additive weighting is used to optimize link stability and distance to improve the packet delivery rate of the *** blockchain system is used as the storage structure for relay data,and the smart contract incentive algorithm based on machine learning is used to encourage relay vehicles to provide more communication bandwidth for data packet *** proposed scheme is simulated and analyzed under different scenarios and different *** experimental results demonstrate that the proposed scheme can effectively reduce the packet loss rate and improve system performance.

关键词： IoV Machine learning Smart contract routing algorithm GPSR Relay transmission

来源：评论

学校读者我要写书评

暂无评论

An oblivious shortest-path routing algorithm for fully connected cubic networks

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2006年第10期66卷 1294-1303页

作者： Yang, Xiaofan Megson, Graham M. Evans, David J. Chongqing Univ Dept Comp Sci & Technol Chongqing 400044 Peoples R China Univ Reading Sch Syst Engn Dept Comp Sci Reading RG6 6AY Berks England Nottingham Trent Univ Sch Comp & Math Nottingham NG1 4BU England

Fully connected cubic networks (FCCNs) are a class of newly proposed hierarchical interconnection networks for multicomputer systems, which enjoy the strengths of constant node degree and good expandability. The shortest path routing in FCCNs is an open problem. In this paper, we present an oblivious routing algorithm for n-level FCCN with N = 8(n) nodes, and prove that this algorithm creates a shortest path from the source to the destination. At the costs of both an O(N)-parallel-step off-line preprocessing phase and a list of size N stored at each node, the proposed algorithm is carried out at each related node in O(n) time. In some cases the proposed algorithm is superior to the one proposed by Chang and Wang in terms of the length of the routing path. This justifies the utility of our routing strategy. (C) 2006 Elsevier Inc. All rights reserved.

关键词： interconnection network hierarchical interconnection network fully connected cubic network routing algorithm shortest path

来源：评论

学校读者我要写书评

暂无评论

SQMCR: Stackelberg Q-Learning-Based Multi-Hop Cooperative routing algorithm for Underwater Wireless Sensor Networks

引用

IEEE ACCESS 2024年 12卷 56179-56195页

作者： Bin, Wang Ben, Kerong Hao, Yixue Zuo, Mingjiu Naval Univ Engn Coll Elect Engn Wuhan 430033 Peoples R China Huazhong Univ Sci & Technol Coll Comp Sci & Technol Wuhan 430074 Peoples R China

The underwater wireless sensor network (UWSNs) is an important communication facility supporting underwater monitoring applications. However, the transmission channel has the characteristics of high bit error rate, strong multipath effect, and many interference factors, and the network node has the characteristics of high energy consumption, difficult energy supply, and the node position vulnerable to change, which makes it extremely difficult for UWSNs to realize the reliable and efficient packet forwarding. To address the problem, we propose the Stackelberg Q-learning based multi-hop cooperative routing algorithm (SQMCR). The SQMCR builds the transmission routes based on the Q-learning algorithm, considering factors such as the delay, the remaining energy, and the network topology, which improves the rationality and adaptability of selecting the next-hop node. By balancing the packet forwarding benefits and the energy consumption costs based on the Stackelberg Q-learning algorithm, the SQMCR establishes the cooperative communication policy to ensure both the reliability and efficiency of underwater communications. It also adopts initializing Q-values and dynamic exploration probabilities optimization methods to further improve the performance of routing algorithms. Experimental results show that the SQMCR can help UWSNs increase the packet forwarding reliability and prolong the network lifetime by 17%. It has a better environment and application adaptability and is more suitable for underwater high-reliability applications.

关键词： Underwater wireless sensor networks (UWSNs) routing algorithm cooperative communication Stackelberg game

来源：评论

学校读者我要写书评

暂无评论

Congestion avoidance routing algorithm for topology-inhomogeneous low earth orbit satellite navigation augmentation network

引用

INTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS AND NETWORKING 2021年第2期39卷 221-235页

作者： Kuang, Yanghongyi Yi, Xianqing Hou, Zhenwei Natl Univ Def Technol Sci & Technol Informat Syst Engn Lab Changsha 410073 Peoples R China Acad Mil Sci Natl Innovat Inst Def Technol Beijing 100070 Peoples R China

This study proposes a routing algorithm to solve the link congestion problem caused by the limited topology in a topology-inhomogeneous low earth orbit (LEO) satellite navigation augmentation network. First, we analyze the characteristics of the latter and describe the navigation augmentation data transmission process in the network. On this basis, we establish a congestion avoidance routing model for the topology-inhomogeneous LEO satellite navigation augmentation network and analyze the reasons for modeling and its advantages in depth. A routing algorithm based on the local load balancing of potentially congested links in the topology-inhomogeneous LEO satellite navigation augmentation network is then proposed based on the need for quickly solving the approximate optimal solution of the above-mentioned model. The theoretical proof of the algorithm's effectiveness in avoiding congestion in the topology-inhomogeneous LEO satellite navigation augmentation network is described. Finally, its effectiveness is verified by a simulation.

关键词： congestion avoidance load balancing navigation augmentation routing algorithm topology-inhomogeneous

来源：评论

学校读者我要写书评

暂无评论

routing algorithm of Smart Grid Data Collection based on Data Balance Measurement Model 16

Routing Algorithm of Smart Grid Data Collection based on Dat...

引用

16th Asia-Pacific Network Operations and Management Symposium (APNOMS)

作者： Jia, Xiaochun Chen, Xingyu Shao, Sujie Qi, Feng Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

ISBN: (纸本)9784885522888

Data collection communications system for electric power communication network is an important entity network in electric power system. It's significant to provide a reasonable routing mechanism for data collection system. The major risk of original routing mechanism is the burst congestion. In the data collection network of smart grid, that some nodes may suffer from more congestion than others even become the bottleneck of network become the new source of risk. In order to overcome these problems, this paper proposes a routing mechanism to realize data balance. This mechanism firstly abstracts a multi-gate network model of data collection system. Then, it proposes a routing measurement model to balance data traffic named data balance measurement model (DBMM). Subsequently it proposes a routing algorithm based on DBMM, named RA-DBMM. The RA-DBMM handles the data traffic to achieve data balance by modifying the routing decision measurement function. So the queue length of queuing data and buffer capacity of every nodes are taken into consideration. Simulation illustrates that the proposed RA-DBMM has biggish enhancement in minishing the congestion, reducing loss ratio, overcoming bottleneck and increasing throughput of network.

关键词： Smart grid Data collection routing algorithm Data balance Available capacity

来源：评论

学校读者我要写书评

暂无评论

routing algorithm Based on ZigBee in Wireless Network

Routing Algorithm Based on ZigBee in Wireless Network

引用

2nd International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)

作者： Zhou, YiWu Dalian Maritime Univ Informat Sci & Technol Coll Dalian Peoples R China

ISBN: (纸本)9780769549354

This paper brings up a succinct way of improving the reliability of network systems and efficiency of data forwarding based on the traditional Cluster-tree routing algorithm. The improved algorithm requires the establishment of neighbor node table, which needs updating regularly. The new algorithm reduces routing hop count and enhances transmission speed and efficiency of network information.

关键词： wireless network routing algorithm neighbor node table hop count

来源：评论

学校读者我要写书评

暂无评论

A survey of routing algorithm for mesh Network-on-Chip

引用

Frontiers of Computer Science 2016年第4期10卷 591-601页

作者： Yue WU Chao LU Yunji CHEN State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing 101408 China Loongson Technology Corporation Limited Beijing 100095 China

With the rapid development of semiconductor in- dustry, the number of cores integrated on chip increases quickly, which brings tough challenges such as bandwidth, scalability and power into on-chip interconnection. Under such background, Network-on-Chip （NoC） is proposed and gradually replacing the traditional on-chip interconnections such as sharing bus and crossbar. For the convenience of physical layout, mesh is the most used topology in NoC design. routing algorithm, which decides the paths of pack- ets, has significant impact on the latency and throughput of network. Thus routing algorithm plays a vital role in a wellperformed network. This study mainly ：focuses on the routing algorithms of mesh NoC. By whether taking network information into consideration in routing decision, routing algorithms of NoC can be roughly classified into oblivious routing and adaptive routing. Oblivious routing costs less without adaptiveness while adaptive routing is on the contrary. To combine the advantages of oblivious and adaptive routing algorithm, half-adaptive algorithms were proposed. In this paper, the concepts, taxonomy and features of routing algorithms of NoC are introduced. Then the importance of routing algorithms in mesh NoC is highlighted, and representative routing algorithms with respective features are reviewed and summarized. Finally, we try to shed light upon the future work of NoC routing algorithms.

关键词： Network-on-Chip mesh topology routing algorithm adaptive routing oblivious routing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：