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

DRTL: A heat-balanced deadlock-free routing algorithm for 3D topology network-on-chip

MICROPROCESSORS AND MICROSYSTEMS 2016年第PartA期45卷 95-104页

作者： Wang, Junhui Gu, Huaxi Wang, Kang Yang, Yintang Wang, Kun Xidian Univ State Key Lab Integrated Serv Networks Xian Peoples R China Xidian Univ Inst Microelect Xian Peoples R China Xidian Univ Sch Comp Sci Xian Peoples R China

Heat balance is of critical importance on the design of network-on-chip (NoC). In a 3D topology NoC, routing algorithm should take considerations of each layer's peak temperature and traffic to prolong chip's service life. In this paper, we propose a heat-balanced, deadlock-free routing algorithm named Direct Ratio Transport Layer (DRTL). DRTL distributes and arranges traffics according to the source layer and destination layer in order to achieve heat balance in the chip. In this algorithm, if a transition layer is needed, the probability of choosing a layer as the transition layer is inversely proportional to the distance between this layer and the heat sink. Simulation results showed that, compared with Traffic Aware Downward routing (TADR), congestion is alleviated and the chip achieves good network performance when DRTL is used. Moreover, DRTL gets almost the same network performance as Transport Layer Assisted routing (TLAR) does while the chip temperature can be lowered by 2K. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Heat balance Deadlock-free routing algorithm 3D topology

来源：评论

学校读者我要写书评

暂无评论

An Improved routing algorithm Based on Social Link Awareness in Delay Tolerant Networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2014年第1期75卷 397-414页

作者： Wang, Kun Guo, Huang Nanjing Univ Posts & Telecommun Minist Educ Key Lab Broadband Wireless Commun & Sensor Networ Nanjing 210003 Peoples R China

The routing efficiency in delay tolerant networks is degraded due to intermittent connection and high latency. Additionally, socially selfish nodes in social networks refuse to provide message forwarding service since there are limited resources. To solve these problems, an improved routing algorithm based on the social link awareness is proposed. In this algorithm, multiple social features of the nodes' behaviors are utilized to quantify the nodes pairs' social links. The social links of the nodes pairs are computed based on their encounter history. These social links can be used to construct the friendship communities of the nodes. The intra-community and inter-community forwarding mechanisms are implemented to raise the successful delivery ratio with low overhead and decrease the transmission delay. Simulation results show that the proposed algorithm shortens the routing delay and increases the successful delivery ratio, thereby improving the routing efficiency.

关键词： Delay tolerant networks Social awareness routing algorithm

来源：评论

学校读者我要写书评

暂无评论

routing Pressure: A Channel-Related and Traffic-Aware Metric of routing algorithm

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2015年第3期26卷 891-901页

作者： Tang, Minghua Lin, Xiaola Palesi, Maurizio GuangDong Univ Finance Dept Comp Sci & Technol Guangzhou 510521 Guangdong Peoples R China Sun Yat Sen Univ Sch Informat Sci & Technol Guangzhou 510275 Guangdong Peoples R China Sun Yat Sen Univ Minist Educ Key Lab Digital Life Guangzhou 510275 Guangdong Peoples R China Kore Univ Enna Italy

How to precisely measure performance of routing algorithm is an important issue when studying routing algorithm of network-on-chip (NoC). The degree of adaptiveness is the most widely used metric in the literature. However, our study shows that the degree of adaptiveness cannot precisely measure performance of routing algorithm. It cannot account for why routing algorithm with high degree of adaptiveness may have poor performance. Simulation has to be carried out to evaluate performance of routing algorithm. In this paper, we propose a new metric of routing pressure for measuring performance of routing algorithm. It has higher precision of measuring routing algorithm performance than the degree of adaptiveness. Performance of routing algorithm can be evaluated through routing pressure without simulation. It can explain why congestion takes place in network. In addition, where and when congestion takes place can be pointed out without simulation.

关键词： routing pressure routing algorithm metric of routing channel pressure network-on-chip

来源：评论

学校读者我要写书评

暂无评论

An Energy Efficient and QoS Aware routing algorithm Based on Data Classification for Industrial Wireless Sensor Networks

引用

IEEE ACCESS 2018年 6卷 46495-46504页

作者： Zhang, Wenbo Liu, Yue Han, Guangjie Feng, Yongxin Zhao, Yuntao Shenyang Ligong Univ Sch Informat Sci & Engn Shenyang 110159 Liaoning Peoples R China Dalian Univ Technol Key Lab Ubiquitous Network & Serv Software Liaoni Sch Software Dalian 116024 Peoples R China

In industrial wireless sensor networks, an energy-efficient quality-of-service (QoS) routing algorithm is very important to ensure that the key sensing data can be forwarded in a reliable path and solve the energy balance problem. In this paper, we classify the industrial sensing data into three data types and set their priority. Furthermore, we give the reliability parameters and timeliness parameters, and we propose and establish the candidate forwarding node set in order to balance the energy consumption. Subsequently, an energy-efficient and QoS aware routing algorithm is designed, and in this routing algorithm, different kinds of data can be forwarded with different strategies. Furthermore, the most important industrial sensing data are guaranteed to be transmitted to the sink node reliably and timely and common data can be transmitted effectively, too. All these data will be forwarded to the optimal relay node under the circumstance of that the data requirements of real time and reliability are satisfied. The simulation results show that the high timeliness event data can be transmitted real time and reliability than the other type of data. And our proposed routing algorithm is effective compared with the similar algorithms.

关键词： Industrial wireless sensor network routing algorithm reliability timeliness EEQA

来源：评论

学校读者我要写书评

暂无评论

An Optimal Clustering routing algorithm for Wireless Sensor Networks with Small-World Property

引用

WIRELESS PERSONAL COMMUNICATIONS 2017年第2期96卷 2983-2998页

作者： Li Chunlin Li Layuan Wang Xiangli Wuhan Univ Technol Sch Comp Sci & Technol Wuhan 430063 Hubei Peoples R China Nanjing Univ Sci & Technol Jiangsu Key Lab Image & Video Understanding Socia Nanjing 210094 Jiangsu Peoples R China

In the wireless sensor networks, deploying a small amount of heterogeneous nodes which directly communicate with the Sink node, can form shortcuts. The shortcuts can make the network to have small-world properties, which can save energy and improve network performance. In the large-scale networks, the optimal deployment of heterogeneous nodes is a NP-hard problem. Considering the total energy consumption of the network and the uniformity of each node energy consumption, this paper presents a clustering heterogeneous network routing algorithm which based on mixed integer programming (CHNMIP). Firstly, the algorithm supposes that the heterogeneous nodes can only be placed in the position of the common nodes and converts the optimal deployment of heterogeneous nodes into a mixed integer programming problem, and finds out the approximate optimal solution using Lagrangian relaxation and Benders decomposition algorithm. Then, it dynamically divides common nodes into clusters, and sets the appropriate transmission. Finally, it theoretically analyzes the performance of CHNMIP routing algorithm, and the simulation results also show that CHNMIP routing algorithm can better improve the network performance in different simulation environment.

关键词： Heterogeneous wireless sensor network Small-world properties Mixed integer programming (MIP) routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A routing algorithm for reducing optical loss in photonic Networks-on-Chip

引用

PHOTONIC NETWORK COMMUNICATIONS 2017年第1期34卷 52-62页

作者： Asadi, Bahareh Reshadi, Midia Khademzadeh, Ahmad Islamic Azad Univ Sci & Res Branch Dept Comp Engn Tehran Iran Sci & Res Branch Tehran *** Iran Iran Telecommun Res Ctr Educ & Int Sci Cooperat Dept Tehran Iran

Photonic Network-on-Chips is a new generation of Network-on-Chips and has been proposed as a novel solution for the communication infrastructure of chip multiprocessors as well as a different solution to eliminate limitations of Network-on-Chips. Photonic Network-on-Chips has important properties such as increasing communication bandwidth, lowering transmission latency, and lowering power consumption. These networks have some challenges such as routing for transfering photonic data over photonic layer. In this paper, we propose a new routing algorithm in which we use turning models, circuit-switching method, different traffic patterns such as Random, Paratec, Madbench, Bitreverse, Cactus, and Tornado to reduce optical loss to photonic layer. To do this, we have also considered non-blocking five-port router and 2-D Mesh topology. The new proposed routing algorithm can choose different source and destination nodes through selecting the path with the lowest optical loss. So to evaluate optical loss in different paths, we have considered best-case loss path, average-case, and worst-case. This was because we can use best-case loss path in order to transfer photonic data over photonic layer. In the end, proposed routing algorithm with turning models and different traffic patterns shows some improvements of optical loss in photonic layer and notably reduce this factor compared to the other XY dimension-order routing algorithm with 5 ports router.

关键词： Microring resonator Non-blocking Optical loss Photonic Network-on-Chip routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Optad-NoC: A Novel Optimized routing algorithm and Intelligent Router for 3D Network-on-Chip

引用

WIRELESS PERSONAL COMMUNICATIONS 2021年第4期121卷 2511-2528页

作者： Balamurugan, K. Rao, B. Subrahmanyeswara Vijayaraj, M. Swarnandhra Coll Engn & Technol Dept ECE Narsapur 534280 Andhra Pradesh India Govt Coll Engn Tirunelveli Dept ECE Tirunelveli 627001 Tamil Nadu India

Nowadays System-on-Chip (SoC) is an emerging technology in the world of Integrated Chip manufacturers. In SoC, many IP cores are integrated inside a chip. The technique for transferring the data in the form of packets from an IP core to another is named as Network-on-Chip (NoC). Today the world is moving towards the miniaturization of commercial electronic devices. To get a miniature device, the Integrated Circuits inside the devices must be very small. Whenever the IC is getting smaller and smaller, many problems such as operating speed and power consumption plays an important role.3D NoCs are the emerging technology for on-chip communication. Novel algorithms of 3D NoC helps to achieve high speed, less power consumption and more functionality. In this work, two important routing techniques such as source and distributed are combined and a new algorithm called as Optimized NoC algorithm (Optad-NoC) is developed to avoid congestion and fault in the router or the channel of 3D NoC. This algorithm is implemented in a newly designed intelligent router named Optad-NoC router to avoid the deadlock and livelock automatically in the network. The router uses the adaptive, multicast routing in Network-on-Chip to achieve high speed and reduces the power consumption in 3D NoC. The latency and the power consumption are obtained for the 8 x 8 (64 nodes) mesh network of each layer of 3D NoC. The average latency of the Optad-NoC router is improved by 36.08% and 28.5% compared to the existing techniques such as EDXY and FADyAD respectively during traffic conditions. The average total power consumption of the Optad-NoC router is reduced by 74.4% compared to EDXY and 66.2% compared to FADyAD during traffic conditions.

关键词： Network on Chip (NoC) System on Chip (SoC) Router routing algorithm

来源：评论

学校读者我要写书评

暂无评论

The Suboptimal routing algorithm for 2D Mesh Network

引用

IEEE TRANSACTIONS ON COMPUTERS 2018年第5期67卷 704-716页

作者： Tang, Minghua Lin, Jing Palesi, Maurizio GuangDong Univ Finance Dept Internet Finance & Engn Informat Guangzhou 510521 Guangdong Peoples R China Shanghai Lixin Univ Accounting & Finance Sch Informat Management Shanghai 200000 Peoples R China Univ Catania Dept Elect Elect & Comp Engn I-95124 Catania Italy

Due to the huge routing algorithm search space for 2D mesh based Network-on-Chip (NoC), Divide-Conquer method is presented to effectively explore the search space. When using Divide-Conquer method, a large number of routing algorithms will be created. In order to get the final results in an acceptable time, a precise metric is needed to measure routing performance and discard the poor performance routings. In this paper, we propose a new routing performance metric, namely, network pressure. Network pressure has the following three advantages: (1) it could measure the whole network congestion state;(2) network pressure of a network and that of its partial component is highly related, under the same routing;(3) it is closely related with routing performance. Based on network pressure and Divide-Conquer method, high performance routing could be achieved. The obtained routing is called suboptimal routing due to the following two reasons: (1) there is only a little gap between its performance and that of the fully adaptive routings under both transpose1 and transpose2 traffics. (2) the search space of routing algorithms is systematically and widely exploited.

关键词： Network-on-Chip routing algorithm routing pressure network pressure

来源：评论

学校读者我要写书评

暂无评论

Directional routing algorithm for Deep Space Optical Network

引用

China Communications 2017年第1期14卷 158-168页

作者： Lei Guo Xiaorui Wang Yejun Liu Pengchao Han Yamin Xie Yuchen Tan Key Laboratory of Medical Image Computing of Northeastern University Ministry of Education School of Computer Science and Engineering Northeastern University Shenyang 110819 China School of Computer and Communication Engineering Zhengzhou University of Light Industry Zhengzhou 450002 China State Key Laboratory of Information Photonics and Optical Communications (BUPT) 100876 China

With the development of science, economy and society, the needs for research and exploration of deep space have entered a rapid and stable development stage. Deep Space Optical Network(DSON) is expected to become an important foundation and inevitable development trend of future deepspace communication. In this paper, we design a deep space node model which is capable of combining the space division multiplexing with frequency division multiplexing. Furthermore, we propose the directional flooding routing algorithm(DFRA) for DSON based on our node model. This scheme selectively forwards the data packets in the routing, so that the energy consumption can be reduced effectively because only a portion of nodes will participate the flooding routing. Simulation results show that, compared with traditional flooding routing algorithm(TFRA), the DFRA can avoid the non-directional and blind transmission. Therefore, the energy consumption in message routing will be reduced and the lifespan of DSON can also be prolonged effectively. Although the complexity of routing implementation is slightly increased compared with TFRA, the energy of nodes can be saved and the transmission rate is obviously improved in DFRA. Thus the overall performance of DSON can be significantly improved.

关键词： deep space optical network routing algorithm directional flooding routing algorithm traditional flooding routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Graph Theory Based Energy routing algorithm in Energy Local Area Network

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2017年第6期13卷 3275-3285页

作者： Wang, Ruichi Wu, Jiande Qian, Zhongnan Lin, Zhengyu He, Xiangning Zhejiang Univ Coll Elect Engn Hangzhou 310027 Zhejiang Peoples R China Aston Univ Birmingham B4 7ET W Midlands England

The energy Internet concept has been considered as a new development stage of the smart grid, which aims to increase the energy transmission efficiency and optimize the energy dispatching in time and space. Energy router is a core device in the energy Internet and it connects all the devices together into a net structure and manages power flows among them. The research work presented in this paper described the energy router's structure and function expectations from the network perspective, and improved the existing energy router design. Open shortest path first (OSPF) protocol and virtual circuit switching mode are referenced from the Internet in the energy local area network (e-LAN) design. This paper proposed a design of an energy routing algorithm based on graph theory in an e-LAN. A lowest cost routing selection algorithm is designed according to the features of power transmission, and a source selection and routing design algorithm is proposed for very heavy load conditions. Both algorithms have been verified by case analyses.

关键词： Energy Internet energy router routing algorithm smart grid

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：