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

LAXY: A Location-Based Aging-Resilient Xy-Yx routing algorithm for Network on Chip

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2017年第10期36卷 1725-1738页

作者： Rohbani, Nezam Shirmohammadi, Zahra Zare, Maryam Miremadi, Seyed-Ghassem Sharif Univ Technol Dept Comp Engn Tehran *** Iran

Network on chip (NoC) is a scalable interconnection architecture for ever increasing communication demand between processing cores. However, in nanoscale technology size, NoC lifetime is limited due to aging processes of negative bias temperature instability, hot carrier injection, and electromigration. Usually, because of unbalanced utilization of NoC resources, some parts of the network experience more thermal stress and duty cycle in comparison with other parts, which may accelerate chip failure. To slow down the aging rate of NoC, this paper proposes an oblivious routing algorithm called location-based aging-resilient Xy-Yx (LAXY) to distribute packet flow over entire network. LAXY is based on the fact that dimension-ordered routing algorithms imposes the highest traffic load on the central nodes in mesh topologies. To balance the traffic over the network, certain routers at the east and the west of NoC, with dimension-order XY routing, statically are configured as YX. Various configurations have been explored for LAXY and the simulations show a specific configuration, called Fishtail, increases mean time to failure of the routers and interconnects by about 42% and 56%, respectively. Moreover, by balancing the load over the network, LAXY improves overall packet latency by about 7% in average, with negligible area overhead.

关键词： Electromigration hot carrier injection (HCI) negative bias temperature instability (NBTI) network on chip (NoC) routing algorithm traffic balancing

来源：评论

学校读者我要写书评

暂无评论

A social activity and physical contact-based routing algorithm in mobile opportunistic networks for emergency response to sudden disasters

引用

ENTERPRISE INFORMATION SYSTEMS 2017年第5期11卷 597-626页

作者： Wang, Xiaoming Lin, Yaguang Zhang, Shanshan Cai, Zhipeng Shaanxi Normal Univ Sch Comp Sci Xian Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

Sudden disasters such as earthquake, flood and hurricane necessitate the employment of communication networks to carry out emergency response activities. routing has a significant impact on the functionality, performance and flexibility of communication networks. In this article, the routing problem is studied considering the delivery ratio of messages, the overhead ratio of messages and the average delay of messages in mobile opportunistic networks (MONs) for enterprise-level emergency response communications in sudden disaster scenarios. Unlike the traditional routing methods for MONS, this article presents a new two-stage spreading and forwarding dynamic routing algorithm based on the proposed social activity degree and physical contact factor for mobile customers. A new modelling method for describing a dynamic evolving process of the topology structure of a MON is first proposed. Then a multi-copy spreading strategy based on the social activity degree of nodes and a single-copy forwarding strategy based on the physical contact factor between nodes are designed. Compared with the most relevant routing algorithms such as Epidemic, Prophet, Labelled-sim, Dlife-comm and Distribute-sim, the proposed routing algorithm can significantly increase the delivery ratio of messages, and decrease the overhead ratio and average delay of messages.

关键词： Mobile opportunistic networks message transmission time-evolving graph social activity degree physical contact factor routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Virtual channel load-balanced routing algorithm for Torus networks

引用

The Journal of China Universities of Posts and Telecommunications 2011年第1期18卷 70-76页

作者： WANG Ya-gang DU Hui-min SHEN Xu-bang School of Computer Xidian University Xi'an 710071 China School of Computer Xi'an University of Posts and Telecommunications Xi'an 710121 China School of Electronic Engineering Xi'an University of Posts and Telecommunications Xi'an 710121 China

In order to improve the network performance furthermore, a routing algorithm for 2D-Torus is investigated from the standpoint of load balance for virtual channels. The 2D-Torus network is divided into two virtual networks and each physical channel is split into three virtual channels. A novel virtual channel allocation policy and a routing algorithm are proposed, in which traffic load is distributed to those three virtual channels in a more load-balanced manner by introducing a random parameter. Simulations of the proposed algorithm are developed with a SystemC-based test bench. The results show that compared with the negative first for Torus networks （NF-T） algorithm, the proposed algorithm can achieve better performance in terms of network latency and throughput under different traffic patterns. It also shows that a routing algorithm with load balance for virtual channels can significantly improve the network performance furthermore.

关键词： interconnection network Torus networks routing algorithm virtual channel load balance

来源：评论

学校读者我要写书评

暂无评论

A routing algorithm based on simulated annealing algorithm for maximising wireless sensor networks lifetime with a sink node

引用

INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION 2020年第4期15卷 264-275页

作者： Wang, Hui Li, Kangshun Pedrycz, Witold Shenzhen Inst Informat Technol Shenzhen 518029 Peoples R China South China Agr Univ Coll Math & Informat Guangzhou Peoples R China Guangdong Key Lab Big Data Anal & Proc Guangzhou Peoples R China Univ Alberta Dept Elect & Comp Engn Edmonton AB Canada

Energy saving becomes a central issue in the design of wireless sensor network routing algorithms. In the wireless sensor networks (WSNs), when intra-network communication is ensured, the lifetime of node can be extended by reducing data transmission or data volume as much as possible. However, the problem is that energy of the nodes around the sink node becomes exhausted quickly due to excessive communication overhead. To handle this problem, in this study, we propose a routing algorithm based on the sink node path optimisation. The study uses the energy consumption model as a constraint, transforms the time optimisation problem into an optimisation model, optimises the sink node path with the aid of simulated annealing (SA) algorithm, and uses data fusion to reduce the intra-network redundant data in the time domain. The proposed algorithm innovatively self-adjusts the path of sink node that is optimised by SA using new fitness function. Comprehensive simulation results show that the proposed algorithm can reduce the node energy consumption of waiting of sink node at the address of sink node, balance the network load and improve survival time of WSNs by 30% in comparison with results produced with the state-of-the art algorithms REAC-IN and DALMDT.

关键词： routing algorithm sink node wireless sensor network WSNs simulated annealing SA optimal path

来源：评论

学校读者我要写书评

暂无评论

Q-Learning-Based Fuzzy Logic for Multi-objective routing algorithm in Flying Ad Hoc Networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2020年第1期113卷 115-138页

作者： Yang, Qin Jang, Sung-Jeen Yoo, Sang-Jo Inha Univ Dept Informat & Commun Engn 253 YongHyun Dong Incheon South Korea

Flying ad hoc networks (FANETs) that consist of multiple unmanned aerial vehicles (UAVs) have developed owing to the rapid technological evolution of electronics, sensors, and communication technologies. In this paper, we propose a multi-objective routing algorithm for FANETs. In addition to the basic transmission performance in the construction of the routing path, the network impact according to the mobility of the UAV nodes and the energy state of each node should be considered because of the characteristics of the FANET, and the overall efficiency and safety of the network should be satisfied. We therefore propose the use of Q-learning-based fuzzy logic for the FANET routing protocol. The proposed algorithm facilitates the selection of the routing paths to be processed in terms of link and overall path performances. The optimal routing path to the destination is determined by each UAV using a fuzzy system with link- and path-level parameters. The link-level parameters include the transmission rate, energy state, and flight status between neighbor UAVs, while the path-level parameters include the hop count and successful packet delivery time. The path-level parameters are dynamically updated by the reinforcement learning method. In the simulation results, we compared the proposal with the conventional fuzzy logic and Q-value-based ad hoc on-demand distance vector. The results show that the proposed method can maintain low hop count and energy consumption and prolong the network lifetime.

关键词： routing algorithm Flying ad hoc networks Multi-objective Fuzzy logic Q-learning

来源：评论

学校读者我要写书评

暂无评论

A Resilient routing algorithm with Formal Reliability Analysis for Partially Connected 3D-NoCs

引用

IEEE TRANSACTIONS ON COMPUTERS 2016年第11期65卷 3265-3279页

作者： Salamat, Ronak Khayambashi, Misagh Ebrahimi, Masoumeh Bagherzadeh, Nader Univ Calif Irvine Dept Elect Engn & Comp Sci Irvine CA 92697 USA Univ Turku Turku Finland KTH Royal Inst Technol Stockholm Sweden

3D ICs can take advantage of a scalable communication platform, commonly referred to as the Networks-on-Chip (NoC). In the basic form of 3D-NoC, all routers are vertically connected. Partially connected 3D-NoC has emerged because of physical limitations of using vertical links. routing is of great importance in such partially connected architectures. A high-performance, fault-tolerant and adaptive routing strategy with respect to the communication flow among the cores is crucial while freedom from livelock and deadlock has to be guaranteed. In this paper we introduce a new routing algorithm for partially connected 3D-NoCs. The routing algorithm is adaptive and tolerates the faults on vertical links as compared to the predesigned routing algorithms. Our results show a 40 - 50% improvement in the fraction of intact inter-level communications when the fault tolerant algorithm is used. This routing algorithm is lightweight and has only one virtual channel along the Y dimension.

关键词： 3D network-on-chip routing algorithm deadlock-free reliability formal analysis fault tolerance

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT routing algorithm FOR REALIZING LINEAR PERMUTATIONS ON PT-SHUFFLE-EXCHANGE NETWORKS

引用

IEEE TRANSACTIONS ON COMPUTERS 1991年第11期40卷 1292-1298页

作者： HUANG, ST TRIPATHI, SK CHEN, NS TSENG, YC UNIV MARYLAND DEPT COMP SCISYST DESIGN & ANAL GRPCOLLEGE PKMD 20742 UNIV MARYLAND INST ADV COMP STUDIESCOLLEGE PKMD 20742

This paper presents an efficient routing algorithm for realizing any permutation in LIN (linear-permutation-class) on single stage shuffle-exchange networks with k x k switching elements, where k = p is a prime number. For any positive integer number n there are N = k(n) processors connected by the network. The proposed algorithm can realize LIN in 2n - 1 passes;it can be implemented by using Nn processors in O(n) time. It can also be extended to the shuffle-exchange networks with (p(t) x p(t)) switching elements, where t is a positive integer number. In addition, the routing of any arbitrary permutations on the networks with any integer k > 2 is discussed. Further, by using the techniques developed in this paper, we present an optimal O(log n) parallel algorithm for solving a set of linear equations with a nonsingular coefficient matrix when the arithmetic is over the finite field GF(p(t)).

关键词： PERMUTATION MATRIX PERMUTATIONS routing algorithm SHUFFLE-EXCHANGE NETWORK

来源：评论

学校读者我要写书评

暂无评论

A pattern-based routing algorithm for a novel electronic system prototyping platform

引用

INTEGRATION-THE VLSI JOURNAL 2018年 62卷 224-237页

作者： Lepercq, Etienne Blaquiere, Yves Savaria, Yvon Polytech Montreal Elect Engn Dept CP 6079Succ Ctr Ville Montreal PQ H3C 3A7 Canada Ecole Technol Super Elect Engn Dept 1100 Notre Dame Ouest St Montreal PQ H3C 1K3 Canada

A recently proposed wafer-sized active integrated circuit capable of programmably interconnecting integrated circuits deposited on its surface needs a routing tool with computation time in the order of minutes. In this paper, a first algorithm computes the shortest route in O(n), n being the number of edges between source and destination. The second algorithm performs a parallelized random search to resolve conflicting routes. Our algorithm can route high density PCB-like netlists (25% vertices occupancy) on an 80,000 vertices regular interconnection network in about 9 min, while typical density netlists (5-15%) are routed in times ranging from 0.4 to 11 s.

关键词： routing algorithm Interconnection network Rapid prototyping Wafer-sized integrated circuit

来源：评论

学校读者我要写书评

暂无评论

A novel segmented routing algorithm based on the markov decision process in mobile opportunistic networks

引用

IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING 2019年第4期14卷 605-614页

作者： Zhang, Yang Wang, Xiaoming Lin, Yaguang Zhang, Lichen Wang, Liang Minist Educ Key Lab Modern Teaching Technol Xian 710016 Shaanxi Peoples R China Shaanxi Normal Univ Sch Comp Sci Xian 710119 Shaanxi Peoples R China

The purposes of research of routing algorithms in the mobile opportunistic networks are to improve the message delivery ratio, control overhead, and reduce the end-to-end delay. Now the performance of routing algorithms is very low because the opportunistic network structure is sparse and the network topology is variable. In this article, we use the Markov random process to propose a new segmented routing algorithm with a higher efficiency in opportunistic networks. In the stage of multicopy, we propose a forwarding strategy with the Markov decision process (MPD) to forward messages to multiple relay nodes quickly. In the stage of singe copy, we establish a precise delivery model to forward messages to the destination node with less relay nodes by combining the MPD with historical encountering information of nodes. The two-stage segmented routing algorithm not only balances the relationship between the delivery ratio and the network overhead, but also saves network resources. Compared with other routing algorithms, our proposed segmented routing algorithm is superior to the existing routing algorithms in the message delivery ratio, message delay, and network overhead. (c) 2018 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

关键词： mobile opportunistic network Markov decision message transmission routing algorithm delivery rate

来源：评论

学校读者我要写书评

暂无评论

A NOVEL APPROACH OF ADAPTIVE SOCIALLY AWARE routing algorithm IN DELAY TOLERANT NETWORKS

引用

TEHNICKI VJESNIK-TECHNICAL GAZETTE 2015年第1期22卷 61-70页

作者： Cho, Ying-Chiang Natl Chung Cheng Univ Dept Elect Engn Chiayi 62102 Taiwan

Under the delay tolerant network, high mobility of the node and the transmission distance make it impossible to keep a durable and regular data routing path between two nodes. As a result, such failure affects the function of packet routing mechanism. Therefore, in order to improve the efficacy of data transmission, conventional delay tolerant routing adopts more packet replication, or makes opportunistic on-line with encountered nodes and selects advantageous ones to increase packet arrival rate or reduce transmission delay rate. However, excessive increase of packet replication or excessive records for selected transmission nodes may result in internet traffic or a waste of resources. It may also lead to a lower level of the routing protocol or a complicated operation. Thus, conventional delay tolerant routing is not satisfying. This research intends to design an optimized forward strategy on the basis of different routing algorithm. This strategy is based on adaptive socially aware and aims at improving solving problems of delay tolerant networks routing.

关键词： Delay Tolerant Networks routing algorithm forward strategy socially aware

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：