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

Improved DyAD algorithm for network-on-chip

Journal of Convergence Information Technology 2012年第8期7卷 62-72页

作者： Wang, Kaiyu College of Information Science and Engineering Yanshan University China

The paper introduces the familiar XY dimension order routing algorithm, odd-even turn model and the combination of both of them with DyAD algorithm, brings forward an improved algorithm that is based on the DyAD. The algorithm aims at the phenomena that when the DyAD meets the congestion, the delay increases seriously as a result that choose the non shortest way. Make a waiting period of time, and then detect the direction of the shortest way of XY and judge if it could transfer the dates in the period of the time. Using the limited waiting instead of choosing the longer path can attain to reduce the delay. The simulations results show that the algorithm can get the least delay and jitter, and provide a better service quality.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An Ant Colony System Based Energy Prediction routing algorithms for Wireless Sensor Networks

An Ant Colony System Based Energy Prediction Routing Algorit...

引用

The 4th International Conference on Wireless Communications, Networking and Mobile Computing(第四届IEEE无线通信、网络技术及移动计算国际会议)

作者： Zhen-wei Shen Yi-hua Zhu Xian-zhong Tian Yi-ping Tang College of Information Engineering Zhejiang University of Technology Hangzhou Zhejiang China 310032

routing algorithms play important roles in wireless sensor networks (WSNs). Usually, nodes in a WSN run on battery with limited power. Hence, routing with efficient power consumption is becoming a critical issue for WSNs. In this paper, a routing algorithm, referred to as Energy Prediction and Ant Colony Optimization routing (EPACOR), is proposed. In the EPACOR, when a node needs to deliver data to the sink, ant colony systems are used to establish the route with optimal or sub-optimal power consumption, and meanwhile, learning mechanism is embedded to predict the energy consumption of neighboring nodes when the node chooses a neighboring node added to the route. The EPACOR is compared both with the MST (Minimal Spanning Tree)-based routing algorithm following the Prim algorithm and with the Least Energy Tree (LET)-based routing algorithm following the Dijkstra algorithm. Numeric experiment shows that the EPACOR has the best network lifetime among the three while keeping energy consumption in low level.

关键词： Wireless Sensor Networks network lifetime power saving routing algorithms ant colony algorithms

来源：评论

学校读者我要写书评

暂无评论

A New Efficient and Reliable Dynamically Reconfigurable Network-on-Chip

引用

JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING 2012年第unknown期2012卷 1-16页

作者： Killian, Cedric Tanougast, Camel Monteiro, Fabrice Dandache, Abbas Univ Lorraine Lab Interfaces Sensors & Microelect LICM EA 1776 F-57070 Metz France

We present a new reliable Network-on-Chip (NoC) suitable for Dynamically Reconfigurable Multiprocessors on Chip systems. The proposed NoC is based on routers performing online error detection of routing algorithm and data packet errors. Our work focuses on adaptive routing algorithms which allow to bypass faulty components or processor elements dynamically implemented inside the network. The proposed routing error detection mechanism allows to distinguish routing errors from bypasses of faulty components. The new router architecture is based on additional diagonal state indications and specific logic blocks allowing the reliable operation of the NoC. The main originality in the proposed NoC is that only the permanently faulty parts of the routers are disconnected. Therefore, our approach maintains a high run time throughput in the NoC without data packet loss thanks to a self-loopback mechanism inside each router.

关键词： NETWORKS on a chip RELIABILITY (Engineering) COMPUTER networks MULTIPROCESSORS ROUTERS (Computer networks) DEBUGGING in computer science routing algorithms DATA packets & packeting

来源：评论

学校读者我要写书评

暂无评论

Reality-Check for DTN routing algorithms

Reality-Check for DTN Routing Algorithms

引用

International Conference on Distributed Computing Systems Workshop

作者： Arshad Islam Marcel Waldvogel University of Konstanz Konstanz Germany

ISBN: (纸本)9781424431755

Many applications of ad-hoc networks include intermittent connectivity. Anyone wishing to implement routing into her delay-tolerant network can select from a wide variation of options, but the choice is hard, as there is no strong comparative evidence to the relative performance of the algorithms. Every paper uses a different setting, mostly far from realistic. In our desire to improve the basis for decisions, we simulated a promising selection of DTN routing algorithms in three vastly different scenarios, all based on publicly available real-world traces. Using our open-source DTN simulator, we compare and analyse 11 routing techniques, then provide explanations for the behaviour and give advice for choosing a suitable mechanism. To our own surprise, the results challenge the conventional wisdom gained from synthetic simulations and poses the question whether the world is ready for DTNs.

关键词： DTNA gene routing algorithms Ad hoc networks Network routing

来源：评论

学校读者我要写书评

暂无评论

Span restoration for CO-OFDM-based elastic optical networks under spectrum conversion

Span restoration for CO-OFDM-based elastic optical networks ...

引用

Asia Communications and Photonics Conference and Exhibition (ACP)

作者： Yue Wei Gangxiang Shen Shanhong You Soochow University Suzhou Jiangsu CN School of Electronic and information Engineer ing Soochow University Suzhou Jiangsu China

We consider the span restoration (SR) technique for CO-OFDM-based elastic optical networks under spectrum conversion. We develop a mixed integer linear programming (MILP) model to minimize required spare capacity and ... 详细信息

ISBN: (纸本)9781557529572

关键词： Dense wavelength division multiplexing Fiber networks Network protection Optical networks routing algorithms Wavelength division multiplexing Networks (060.4250) Networks, network survivability (060.4257)

来源：评论

学校读者我要写书评

暂无评论

Link stability analysis in VANETs using topology based protocol

Link stability analysis in VANETs using topology based proto...

引用

Fourth International Conference on Advances in Recent Technologies in Communication and Computing (ARTCom2012)

作者： Sushil Kr. Trisal Ajay Koul Amit Bindal SMVD University School of Computer Science Katra J&K India MM University Department of Computer Science Mullana Haryana India

ISBN: (纸本)9781634396226

routing in VANET is a challenging task as the nodes remain highly mobile and there is frequent disconnection and reconnection of node links. Estimating link time to remain connected with the nodes is therefore an important task in VANETs as various routing algorithms can drastically degrade in performance due to change in link status. Various algorithms proposed earlier provide the link estimation but almost all are dependent on specialized GPS to locate position of nodes. Position based routing protocols are becoming popular due to advancement and availability of GPS devices but they can be less accurate as their accuracy is only up to 5 to 10 meters in outdoor environments. In addition, a GPS is not applicable in locations where no line of sight exists, e.g., in a tunnel. The other drawback of GPS is that it cannot locate a vehicle which is inside big campuses like universities and airports. In this paper we propose a mechanism that estimates the link stability time without making use of GPS. The routing decisions are taken based upon the link time and the direction of the nodes. Our simulation results prove the purpose of using this approach in VANETs.

关键词： Global position system (GPS) VANET (vehicular Ad hoc network) AODV (Ad hoc on Demand Distance Vector) DSR (Dynamic Source routing) V2V protocols Global Positioning Systems Ganglia topology Network routing OUTDOOR ENVIRONMENT routing algorithms line of sight routing protocols indium Dosage Form Not Applicable

来源：评论

学校读者我要写书评

暂无评论

Lifetime enhancement routing algorithm for mobile ad hoc networks

引用

IET COMMUNICATIONS 2011年第1期5卷 119-125页

作者： Varaprasad, G. BMS Coll Engn Dept Comp Sci & Engn Bangalore 560019 Karnataka India

In this study, the author investigates the problem of lifetime enhancement of mobile nodes in mobile ad hoc networks. Here, the author uses two metrics namely, residual battery capacity of the node and non-critical node to route the data packets from the source to the destination. The proposed model uses the non-critical node if all the nodes contain residual battery capacity above the threshold value. The proposed model has been simulated using Qualnet Simulator-4.5. The proposed model has compared against the existing algorithms such as minimum total transmission power routing, conditional max-min battery capacity routing and lifetime prediction routing. From the results, the author concludes that the proposed model has reached at the top position in terms of the number of survived nodes, energy saving and number of nodes with zero remaining energy.

关键词： Line of nodes Mobile ad hoc networks Ad hoc networks non-vital Ganglia Writers routing algorithms data packets Battery Capacity Network routing

来源：评论

学校读者我要写书评

暂无评论

Split-spectrum channel scheme for future dynamic flexible grid optical networks

Split-spectrum channel scheme for future dynamic flexible gr...

引用

Asia Communications and Photonics Conference and Exhibition (ACP)

作者： Zitian Zhang Weiqiang Sun Weisheng Hu State Key Laboratory of Advanced Optical Communication Systems and Networks Shanghai Jiaotong University Shanghai China

To reduce connection blocking caused by spectrum fragmentation in future elastic optical networks, we propose the split-spectrum channel scheme and a spectrum allocation algorithm. Simulations are done to show its rem... 详细信息

ISBN: (纸本)9781557529572

关键词： algorithms Dense wavelength division multiplexing Network topology Optical networks routing algorithms Wavelength conversion Networks (060.4250) Networks, network optimization (060.4256)

来源：评论

学校读者我要写书评

暂无评论

Cray Cascade: a Scalable HPC System based on a Dragonfly Network 12

Cray Cascade: a Scalable HPC System based on a Dragonfly Net...

引用

ACM/IEEE International Conference for High Performance Computing, Networking, Storage, and Analysis

作者： Greg Faanes Abdulla Bataineh Duncan Roweth Tom Court Edwin Froese Bob Alverson Tim Johnson Joe Kopnick Mike Higgins James Reinhard Cray Inc Chippewa Falls Wisconsin USA

ISBN: (纸本)9781467308052

Higher global bandwidth requirement for many applications and lower network cost have motivated the use of the Dragonfly network topology for high performance computing systems. In this paper we present the architecture of the Cray Cascade system, a distributed memory system based on the Dragonfly [1 ] network topology. We describe the structure of the system, its Dragonfly network and the routing algorithms. We describe a set of advanced features supporting both mainstream high performance computing applications and emerging global address space programing models. We present a combination of performance results from prototype systems and simulation data for large systems. We demonstrate the value of the Dragonfly topology and the benefits obtained through extensive use of adaptive routing.

关键词： Interconnect technologies parallel and scalable system architectures performance evaluation and measurement of real systems Anisoptera High Performance Computing Network topology bandwidth requirement address space routing algorithms simulated data Network

来源：评论

学校读者我要写书评

暂无评论

Average Delay SLAs in Cloud Computing

Average Delay SLAs in Cloud Computing

引用

IEEE International Conference on Communications

作者： Boonyarith Saovapakhiran Michael Devetsikiotis George Michailidis Yannis Viniotis Department of Electrical and Computer Engineering North Carolina State University Department of Statistics University of Michigan

ISBN: (纸本)9781457720529

In this paper, we conduct feasibility studies on the average delay space for Cloud computing, and we propose a heuristic method to control the vector of average delays, subject to predefined delay constraints. Our work is strongly motivated by the fact that delay control plays a critical role to improve Service Level Agreements (SLA) between users and Cloud service providers, which is necessary for empowering online business. Specifically, our main contributions are two-fold: First, the feasible regions of various routing algorithms for the system's dispatcher are investigated in depth. Second, a simple heuristic algorithm is designed, to move the average delay point along the feasible direction until achieving the delay constraints. Average delay is dependent on multiple factors such as job size, inter-arrival time, flow rate, and the dispatching rules of the system. Therefore, we vary their distribution, parameters and routing rules to examine how the feasible regions move or change. After establishing the feasible delay space, then by moving along the feasible directions, we show that a simple heuristic algorithm can achieve the delay constraints for a two queue system.

关键词： mean delay Cloud Computing Heuristic algorithms time delay control Dispatching rules routing algorithms distributed parameter

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：