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

Adaptive routing algorithm for Network Load Balancing

IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING 2011年第5期6卷 441-449页

作者： Une, Hiroyuki Qian, Fei Hirata, Hironori Hiroshima Kokusai Gakuin Univ Fac Informat Design Aki Ku Hiroshima 7390321 Japan Chiba Univ Grad Sch Engn Inage Ku Chiba 2638522 Japan Kanto Gakuin Univ Coll Engn Kanazawa Ku Yokohama Kanagawa 2368501 Japan

This paper introduces a routing algorithm which distributes the network traffic for each feasible route based on the reinforcement learning scheme. The aim of this algorithm is to reduce the transfer delay caused by congestion of the network. Most routing algorithms based on the reinforcement learning scheme could not avoid forwarding traffic toward the source of data packets. This property creates transfer loops and a lot of packet loss. In particular, the transfer loop may cause change in the order of packets, and also retransmit on the TCP connection. Thus, we employ a method that estimates the lower boundary of the probability for valid route to the destination, and this lower boundary can be used to reject the routes which cause the transfer loop. (C) 2011 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

关键词： routing algorithm load balancing ant colony optimization reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A routing algorithm with precomputation for Multiprotocol Label Switching Traffic Engineering

引用

EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS 2011年第6期22卷 315-321页

作者： He, Tao Wang, Suoping Nanjing Univ Posts & Telecommun Nanjing 210003 Peoples R China

The Label Switch Path routing algorithm in Multiprotocol Label Switching (MPLS) has become an important topic in Traffic Engineering. This paper presents a new routing scheme with precomputation, called the Least Maximum Flow Categories routing algorithm. In the MPLS network, different ingress-egress pairs have different maximum flow values on different links. Each link has a vector consisting of the maximum flow values flowing through it. This paper considers these vectors as weights of links and presents a method for calculating them. Simulation results show that the algorithm has the same precision as the other algorithms but has less computational complexity. Copyright (C) 2011 John Wiley & Sons, Ltd.

关键词： Traffic Engineering MPLS routing algorithm maximum flow minimum interference

来源：评论

学校读者我要写书评

暂无评论

Real-time Threshold routing algorithm Based on Wireless Sensor Network

引用

Agricultural Science & Technology 2012年第4期13卷 917-920,F0003页

作者：罗桂兰左国超冯立波大理学院数学与计算机学院物联网实验室云南大理671003

[Objective] This study was to design an intelligent greenhouse real-time monitoring system based on the core technology of Internet of Things in order to meet the needs of agricultural informatization and intellectualization. [Method] Based on the application characteristics of Wireless Sensor Network （WSN）, the intelligent greenhouse monitoring system was designed. And for the incompleteness strategy of load balancing in the Low-Energy Adaptive Clustering Hierarchy （LEACH）, a Real- time Threshold routing algorithm （RTRA） was proposed. [Result] The performance of network lifetime and network delay of RTRA were tested in MATLAB and found that, within the same testing environment, RTRA can save nodes energy consumption, prolong network lifetime, and had better real-time performance than LEACH. The al- gorithm satisfies the crops＇ requirements on real-time and energy efficiency in the greenhouse system. [Conclusion] For the good performance on real-time, the de- signed intelligent greenhouse real-time monitoring system laid the foundation for the research and development of agricultural informatization and intellectualization.

关键词： Internet of Things Wireless sensor network Intelligent greenhouse mon- itoring Real time routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps

引用

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE 2017年第3期19卷

作者： Devismes, Stephane Ilcinkas, David Johnen, Colette Univ Grenoble Alpes Grenoble France Univ Bordeaux F-33400 Talence France CNRS LaBRI UMR 5800 F-33400 Talence France

We deal with the problem of maintaining a shortest-path tree rooted at some process r in a network that may be disconnected after topological changes. The goal is then to maintain a shortest-path tree rooted at r in its connected component, V-r, and make all processes of other components detecting that r is not part of their connected component. We propose, in the composite atomicity model, a silent self-stabilizing algorithm for this problem working in semi-anonymous networks, where edges have strictly positive weights. This algorithm does not require any a priori knowledge about global parameters of the network. We prove its correctness assuming the distributed unfair daemon, the most general daemon. Its stabilization time in rounds is at most 3n(maxCC) + D, where n(maxCC) is the maximum number of non-root processes in a connected component and D is the hop-diameter of V-r. Furthermore, if we additionally assume that edge weights are positive integers, then it stabilizes in a polynomial number of steps: namely, we exhibit a bound in O (W(max)n(maxCC) (3)n), where W-max is the maximum weight of an edge and n is the number of processes.

关键词： distributed algorithm self-stabilization routing algorithm shortest path disconnected network shortest-path tree

来源：评论

学校读者我要写书评

暂无评论

Online Reconfigurable routing Method for Handling Link Failures in NoC-based MPSoCs 11

Online Reconfigurable Routing Method for Handling Link Failu...

引用

11th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC)

作者： Bahrebar, Poona Stroobandt, Dirk Univ Ghent Dept Elect & Informat Syst ELIS iGent Technol Pk Zwijnaarde 15 B-9052 Ghent Belgium

ISBN: (纸本)9781509025206

As silicon features approach the atomic scale, the Networks-on-Chip (NoCs) are becoming more susceptible to faults. Resiliency to device failures is, therefore, a key objective in the design of the Systems-on-Chip (SoCs). This paper seeks to address reliability by presenting a routing algorithm for 2D mesh NoCs. Using the proposed method which is designed based on the Abacus Turn Model (AbTM), the healthy paths can be dynamically configured according to the location of faults and congestion in the network. As a result, not only the functionality of the network is maintained in the vicinity of faults, but also a high performance communication can be provided. The presented technique is an adaptive, distributed, deadlock-free, and congestion-aware routing method which does not require routing tables or virtual channels. The experimental results demonstrate the reliability of NoC against multiple link failures with a small hardware overhead penalty.

关键词： Network-on-Chip (NoC) fault-tolerance routing algorithm reconfiguration deadlock turn model

来源：评论

学校读者我要写书评

暂无评论

A Novel Lookup and routing Protocol Based on CAN for Structured P2P Network 1

A Novel Lookup and Routing Protocol Based on CAN for Structu...

引用

1st IEEE International Conference on Computer Communication and the Internet (ICCCI)

作者： Zeng, Bin Wang, Rui Naval Univ Engn Dept Engn Management Wuhan Peoples R China Naval Univ Engn Lib Training Dept Wuhan Peoples R China

ISBN: (纸本)9781467385152

Distributed Hash Tables (DHTs) have emerged as the most popular scheme in the P2P network, which have drastically changed the way we share resources and gather information. In order to solve the problem of search flexibility In DHT, an improved lookup and routing protocol based on Content Addressable Networks (CANs) is proposed, which not only preserves CANs' simplicity, but also achieves a resilient and efficient greedy DHT routing algorithm. Furthermore, a binary partition tree algorithm is designed to estimate the underlying network topology. Simulation results shows that the proposed approach can gain better performance compared with the traditional CAN method.

关键词： distributed hash tables structured overlay network routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Security Aware routing Approach for NoC-based MPSoCs 29

A Security Aware Routing Approach for NoC-based MPSoCs

引用

29th Symposium on Integrated Circuits and Systems Design (SBCCI)

作者： Fernandes, Ramon Marcon, Cesar Cataldo, Rodrigo Silveira, Jarbas Sigl, Georg Sepulveda, Johanna Pontificia Univ Catolica Rio Grande do Sul PUCRS Porto Alegre RS Brazil Tech Univ Munich Inst Secur Informat Technol D-80290 Munich Germany Fraunhofer Res Inst Appl & Integrated Secur AISEC Munich Germany Univ Fed Ceara LESC DETI Fortaleza Ceara Brazil

ISBN: (纸本)9781509027361

Malicious applications target Multi-Processors System-on-Chip (MPSoCs) to capture sensitive information or disrupt normal operation;therefore, security is now a design requirement for MPSoC design. Network-on-Chip (NoC) is a key communication structure to aid in the overall MPSoC protection. Firewall-based NoC protection allows data exchange monitoring and controlling according to the MPSoC security policy. Secure NoCs enable to detect and prevent a broad range of software-based attacks. However, complex security policies may turn firewalls costly. This paper proposes a protection technique based on the NoC routing algorithm. By manipulating the routing of packets, security zones can be built. Our routing algorithm prioritizes communication among paths deemed secure while guaranteeing deadlock freedom. We evaluate the scalability of the proposed technique using synthetic and real application scenarios, as well as the security of the proposed technique.

关键词： MPSoCs NoCs routing algorithm security

来源：评论

学校读者我要写书评

暂无评论

Cross-layer Information Based routing Protocol for Power Line Communication

Cross-layer Information Based Routing Protocol for Power Lin...

引用

IEEE PES Asia-Pacific Power and Energy Engineering Conference (APPEEC)

作者： Ba, Wei Zheng, Tao Fu, Keyuan Bai, Li Liu, Chang Xi An Jiao Tong Univ Shaanxi Key Lab Smart Grid Xian Peoples R China State Grid Henan Econ Res Inst Zhengzhou Peoples R China

ISBN: (纸本)9781509054183

Smart Grid communications involves various applications with different transmission requirements. Power Line could afford both narrowband and broadband communications to enable the hybrid applications in Smart Grid. In this paper, a routing protocol is explored based on cross-layer channel information and power resource allocation information. A new frequency selected neighborhood relationship is proposed. Employing the local neighbor information, we deal with the commuting problems and least hops problems, which provide superior performance of communication with hybrid applications.

关键词： cross-Iayer information hybrid applications Power Line Communications routing algorithm Smart Grid

来源：评论

学校读者我要写书评

暂无评论

A SVM based routing Scheme in VANETs 16

A SVM based Routing Scheme in VANETs

引用

16th International Symposium on Communications and Information Technologies (ISCIT)

作者： Zhao, Liang Li, Yujie Meng, Chao Gong, Changqing Tang, Xiaochun Shenyang Aerosp Univ 37 Daoyi South Ave Shenyang Peoples R China Minist Transport Res Inst Highway 9 Beitucheng Rd Beijing Peoples R China

ISBN: (纸本)9781509040995

In recent years, VANET as the key communication networking technology has been attracted by academia and industries with remarkable development. However, there is still many shortcomings especially in communication efficiency where routing algorithm is one of them. In the design phase of routing algorithms, only very few features of vehicle nodes are considered manually to improve the classic algorithms e.g. GPSR. This paper studies the features of vehicle nodes and drivers. In addition, we introduce machine learning algorithm in particular Support Vector Machine (SVM) to process the vehicle data and generate routing metric to enhance the effect of these features. This paper studies the methods of analyzing and processing probe car data and also discusses the possibility of applying machine learning algorithms in the generation of VANET routing algorithm. The simulation results show better reliability and communication efficiency is achieved.

关键词： SVM routing algorithm VANETs

来源：评论

学校读者我要写书评

暂无评论

A NOVEL ENERGY EFFICIENCY PROTOCOL FOR WSN BASED ON OPTIMAL CHAIN routing 3

A NOVEL ENERGY EFFICIENCY PROTOCOL FOR WSN BASED ON OPTIMAL ...

引用

3rd International Conference on Computing for Sustainable Global Development (INDIACom)

作者： Agarwal, Arun Gupta, Khushboo Yadav, K. P. GGSIPU New Delhi India UPTU Lucknow Uttar Pradesh India KCCITM Greater Noida India

ISBN: (纸本)9789380544199

Energy Efficiency in Wireless Sensor Network is one of the most significant aspects of routing in these networks. WSN consist of thousands of sensory nodes densely distributed over wide geographical network. As these nodes are deployed in remote areas where recharging is not possible, even, if it is possible it will incur high cost. So there is a need of a protocol which facilitates less energy dissipation and thereby enhances the overall performance of the network. We surveyed several protocols such as LEACH;PEGASIS, ACT etc. and concluded that important performance measures are First Node Die (FAD), Half Node Alive (HNA) and Last Node Alive (LNA). Values for above mentioned parameters vary for different protocols. In this paper we present a new protocol Energy Efficient Optimal Chain Protocol (EEOC) which outperforms all above mentioned protocols. We compared the results of all these protocols with EEOC and found that with respect to END, HNA and LNA EEOC performs way better than others.

关键词： ACT EEOC Energy Efficiency LEACH PEGASIS routing algorithm Simulation WSN

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：