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

Reliable routing schemes in 3D network on chip

INTERNATIONAL JOURNAL OF EMBEDDED SYSTEMS 2020年第1期12卷 39-61页

作者： Touati, Habib Chawki Boutekkouk, Fateh Larbi Ben Mhidi Univ Res Lab Comp Sci Complex Syst Oum El Bouaghi Algeria

3D network on chip (3D-NoC) is the replacement of traditional infrastructures and the new design paradigm for communication in future very large-scale system on chip (SoC), due to the fact that it provides flexibility, extensibility and low power consumption. One of the most important issues of a 3D-NoC design is the implementation of an efficient and reliable routing algorithm, which has a direct impact on the overall network performance. A routing algorithm aims predominantly at fulfilling three distinct objectives: deadlock freedom, congestion awareness and fault tolerance, which is a highly desired but somewhat a challenging task. In this paper, a non-exhaustive list of the most relevant routing algorithms in 3D-NoC are surveyed and classified based on their objectives, the advantages and drawbacks of each algorithm are also presented, as well as the possible enhancements to improve their reliability.

关键词： 3D network on chip 3D-NoC system on chip SoC reliability routing algorithms congestion awareness fault tolerance deadlock freedom

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Iterative Local Search Algorithm for The Electric Fleet Size and Mix Vehicle routing Problem with Time Windows and Recharging Stations

引用

IFAC-PapersOnLine 2016年第12期49卷 955-960页

作者： Vaz Penna, Puca Huachi Afsar, H. Murat Prins, Christian Prodhon, Caroline Universidade Federal de Ouro Preto Departamento de Computação Campus Morro do Cruzeiro s/n Ouro Preto-MG 35400-000 Brazil ICD-LOSI UMR CNRS 6281 Université de Technologie de Troyes 12 Marie Currie CS 42060 Troyes CEDEX10004 France

As the cities around the world become larger, quality of life of the citizens is more and more threatened due to the traffic congestion, energy consumption, noise disturbance and carbon emissions because of of increasing transport. Electrical vehicles present an opportunity to reduce greenhouse gas emissions. But limited driving range and long recharging times are among the challenges that the research community has to face. This paper proposes an iterative local search algorithm coupled with a set partitioning model to solve The Electric Fleet Size and Mix Vehicle routing Problem with Time Windows and Recharging Stations. Several types of electrical vehicles with varying driving range, capacity and fixed cost should service a set of customers within their time limits and during their tours each vehicle can be recharged in stations. We show the efficiency and the quality of our method by solving benchmark instances of the Heterogeneous Fleet Electric Vehicle Problems with Time Windows. © 2016

关键词： Fleet operations Benchmarking Energy utilization Gas emissions Greenhouse gases Iterative methods Learning algorithms Local search (optimization) routing algorithms Traffic congestion Vehicle routing Vehicles Electrical vehicles Fleet size and mixes Heterogeneous fleet Iterative local searches Metaheuristic Noise disturbance Research communities Vehicle routing problem with time windows

来源：评论

学校读者我要写书评

暂无评论

ALGORITHM-HARDWARE CODESIGN OF A FAST PARALLEL routing ARCHITECTURE FOR CLOS NETWORKS

引用

JOURNAL OF INTERCONNECTION NETWORKS 2010年第3-4期11卷 189-210页

作者： Zheng, S. Q. Gumaste, A. Lu, E. Univ Texas Dallas Dept Comp Sci Richardson TX 75080 USA Indian Inst Technol Dept Comp Sci & Engn Bombay Maharashtra India Salisbury Univ Dept Math & Comp Sci Salisbury MD 21801 USA

Clos networks are an important class of switching networks due to their modular structure and much lower cost compared with crossbars. For routing I/O permutations of Clos networks, sequential routing algorithms are too slow, and all known parallel algorithms are not practical. We present the algorithm-hardware codesign of a unified fast parallel routing architecture called distributed pipeline routing (DPR) architecture for rearrangeable nonblocking and strictly nonblocking Clos networks. The DPR architecture uses a linear interconnection structure and processing elements that performs only shift and logic AND operations. We show that a DPR architecture can route any permutation in rearrangeable nonblocking and strictly nonblocking Clos networks in O(root N) time. The same architecture can be used to carry out control of any group of connection/disconnection requests for strictly nonblocking Clos networks in O(root N) time. Several speeding-up techniques are also presented. This architecture is designed for Clos-based packet and circuit switches of practical sizes.

关键词： Interconnection networks switching networks Clos networks routing algorithms network control network implementation

来源：评论

学校读者我要写书评

暂无评论

A Novel routing and Hybrid Based Clustering Scheme in vehicular adhoc networks

引用

International Journal of Intelligent Networks 2021年 2卷 103-114页

作者： Folsom, Raphael Duval Aravindhan, K. Sikamani, K. Thirunadana Division History and Natural Science The University of Oklahoma NormanOK United States Department of Computer Science and Engineering SNS College of Engineering Coimbatore India Department of Computer Science and Engineering St.Peter's Institute of Higher Education and Research India

The intention of this research is to design a new Novel routing and Hybrid based Clustering Scheme (NRHCS) for VANETs. The vehicle link counts, and vehicle displacement is employed under various concepts like cluster formation, adding and deleting cluster, cluster head election and re-clustering are carried out. During cluster arrangement, the vehicles with comparatively improved extent of linkage preliminarily arrange as support which is chosen as the head. The management then takes part in cluster head selection and effective re-cluster with the aid of combined comparative displacement of vehicles using cluster head. The proposed technique processes the information dissemination in the VANET necessitate smart and vibrant decisions centered on the contexts to operate on dense and sparse instances to ensure that information transfer is possible for motor flexibility. © 2021 The Author(s)

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

A new routing algorithm based on opportunistic networks

引用

International Journal of Information and Communication Technology 2017年第1期11卷 81-93页

作者： Dong, Shi Qi, Yingchun Zhou, Dingding School of Computer Science and Technology Zhoukou Normal University Henan Zhoukou China School of Computer Science and Engineering Huazhong University of Science and Technology Wubei Wuhan China Department of Laboratory and Equipment Management Zhoukou Normal University Henan Zhoukou China

Opportunistic network completes the communication between nodes by 'storage-carry-forward' mode, the traditional routing algorithms can not be applied to the opportunistic network, so this article proposes network routing algorithm MPRA based on an efficient opportunistic network. The algorithm is based on the mobility prediction method to solve routing problems. We use existing mobility prediction method and apply it into the routing algorithm. Compared to existing routing method of opportunity network, MPRA method can handle dynamic route problem, improve the transmission success rate and decrease the transmission delay. Moreover, the algorithm can reduce the routing overhead and short the cache time. © Copyright 2017 Inderscience Enterprises Ltd.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Light-tree routing under optical power budget constraints [Invited]

引用

Journal of Optical Networking 2004年第5期3卷 282-302页

作者： Xin, Yufeng Rouskas, George MCNC-RDI North Carolina State University

Feature Issue on Next-Generation WDM Network Design and routing (WDMN) It has been widely recognized that physical-layer impairments, including power losses, must be taken into account when optical connections are routed in transparent networks. We study the problem of constructing light-trees under optical-layer power budget constraints, with a focus on algorithms that can guarantee a certain level of quality for the signals received by the destination nodes. We define a new constrained light-tree routing problem by introducing a set of constraints on the source-destination paths to account for the power losses at the optical layer. We investigate a number of variants of this problem, we characterize their complexity, and we develop a suite of corresponding routing algorithms;one of the algorithms is appropriate for networks with sparse light splitting and/or limited splitting fanout. We find that, to guarantee an adequate signal quality and to scale to large destination sets, light-trees must be as balanced as possible. Numerical results demonstrate that existing algorithms tend to construct highly unbalanced trees and are thus expected to perform poorly in an optical network setting. Our algorithms, on the other hand, are designed to construct balanced trees that, in addition to having good performance in terms of signal quality, also ensure a certain degree of fairness among destination nodes. Although we consider only power loss here, the algorithms that we develop could be appropriately modified to account for other physical-layer impairments, such as dispersion. © 2003 Optical Society of America.

关键词： Circuit switched networks Multimode interference devices Optical networks Optical signals Optical transceivers routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Reliable and energy-efficient cooperative routing algorithm for wireless monitoring systems

引用

IET WIRELESS SENSOR SYSTEMS 2012年第2期2卷 128-135页

作者： Manfredi, S. Univ Naples Federico II Fac Engn Via Claudio 21 I-80125 Naples Italy

The recent increased interest in distributed and flexible wireless pervasive applications has drawn great attention to Wireless Networked Control Systems (WNCS) architectures based on Wireless Sensor and Actuator Networks (WSANs) and the resulting Quality of Service (QoS) obtained in specific applications. In wireless monitoring systems based on WSANs, providing certain QoS specifications in terms of reliability and energy efficiency is crucial for the sensors/actuators as they perform actions based on the data samples/received with a limited amount of energy to spend. To this aim the paper introduces the cooperative-based routing algorithm to guarantee a good performance trade-off between reliability and energy efficiency of the overall wireless monitoring system. Simulations have been carried out in order to quantify the impact of the proposed algorithm on the overall monitoring system reliability and energy efficiency and a comparison is presented with the existing Ad-hoc On-Distance Vector (AODV), the cooperation along the shortest non-cooperative path (CASNCP) and minimum-power cooperative routing (MPCR) algorithms. Finally it is shown the application of the proposed algorithm to healthcare monitoring system pointing out as the cooperation-based routing algorithms are suitable and rewarding for the management of the future generation of monitoring systems.

关键词： energy capacity Energy efficiency monitoring systems routing algorithms wireless monitoring system wireless Quality of service

来源：评论

学校读者我要写书评

暂无评论

A Multi-Depot Home Care routing Problem with Time Windows and Fuzzy Demands Solving by Particle Swarm Optimization and Genetic Algorithm

引用

IFAC-PapersOnLine 2018年第11期51卷 358-363页

作者： Tohidifard, M. Tavakkoli-Moghaddam, R. Navazi, F. Partovi, M. School of Industrial Engineering College of Engineering University of Tehran Tehran Iran

Providing sanitarian and medical treatments for patients in their location has lots of benefits. Having ordered and on-time medical services cause faster recovery for patients, besides reducing their expenditure. This study presents a new mathematical model for a multi-depot vehicle routing problem (VRP) with time windows for home health care firms. The multi-depot VRP tries to visit some patients and give necessary services to them by several vehicles settled at multiple depots. The endeavor of this problem is raising the satisfaction of patients while minimizing the distance and time of the traveling tour, the number of vehicles, and the transportation cost in a patient's hard time windows. The problem is solved by genetic algorithm (GA) and particle swarm optimization (PSO). The related results are compared with the GAMS outcomes for small-sized problems. © 2018

关键词： Particle swarm optimization (PSO) Genetic algorithms Heuristic algorithms Home health care Patient rehabilitation routing algorithms Vehicle routing Vehicles Medical services Medical treatment Meta heuristic algorithm Multi depot vehicle routing problems New mathematical model Number of vehicles routing problems Transportation cost

来源：评论

学校读者我要写书评

暂无评论

Dealing with dead ends: Efficient routing in darknets

引用

ACM Transactions on Modeling and Performance Evaluation of Computing Systems 2016年第1期1卷 1–30页

作者： Roos, Stefanie Strufe, Thorsten TU Dresden Fakultät Informatik Nöthnitzerstr. 46 Dresden01187 Germany

Darknets,membership-concealing peer-to-peer networks, suffer from highmessage delivery delays due to insufficient routing strategies. They form topologies restricted to a subgraph of the social network of their users by limiting connections to peers with a mutual trust relationship in real life. Whereas centralized, highly successful social networking services entail a privacy loss of their users, Darknets at higher performance represent an optimal private and censorship-resistant communication substrate for social applications. Decentralized routing so far has been analyzed under the assumption that the network resembles a perfect lattice structure. Freenet, currently the only widely used Darknet, attempts to approximate this structure by embedding the social graph into a metric space. Considering the resulting distortion, the common greedy routing algorithm is adapted to account for local optima. Yet the impact of the adaptation has not been adequately analyzed. We thus suggest a model integrating inaccuracies in the embedding. In the context of this model, we show that the Freenet routing algorithm cannot achieve polylog performance. Consequently, we design NextBestOnce, a provable poylog algorithm based only on information about neighbors. Furthermore, we show that the routing length of NextBestOnce is further decreased by more than a constant factor if neighborof- neighbor information is included in the decision process. © 2016 ACM.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

BeesAnts: a new nature- inspired routing algorithm

引用

INTERNATIONAL JOURNAL OF COMMUNICATION NETWORKS AND DISTRIBUTED SYSTEMS 2013年第1期10卷 83-97页

作者： Al Maghayreh, Eslam Abu Al-Haija, Sallam Alkhateeb, Faisal Aljawarneh, Shadi Al-Shawakfa, Emad Yarmouk Univ Fac Informat Technol & Comp Sci Dept Comp Sci Irbid 21163 Jordan Isra Univ Sci & IT Fac Amman 11622 Jordan Yarmouk Univ Fac Informat Technol & Comp Sci Comp Informat Syst Dept Irbid 21163 Jordan

In this paper, we have introduced a new multi-agent nature-inspired routing algorithm. The algorithm is referred to as the BeesAnts algorithm. It is a combination of the ant colony-based routing algorithm (ARA) and the BeeHive-based routing algorithm. The proposed routing algorithm works effectively on networks consisting of two parts;one is a fixed network and the other is a mobile ad hoc network (MANET). It applies the ARA routing algorithm on the mobile part and the BeeHive routing algorithm on the fixed part. The experimental results and the statistical analysis have demonstrated that the BeesAnts routing algorithm outperforms its ancestor, the ARA routing algorithm, in terms of the propagation delay, the queue delay, and the number of hops.

关键词： mobile ad hoc networks MANETs routing algorithms swarm intelligence ant colony-based routing beehive-based routing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：