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

Efficient implementation of distributed routing algorithms for NoCs

IET COMPUTERS AND DIGITAL TECHNIQUES 2009年第5期3卷 460-475页

作者： Rodrigo, S. Medardoni, S. Flich, J. Bertozzi, D. Duato, J. Univ Politecn Valencia Parallel Architectures Grp DISCA Valencia Spain Univ Ferrara ENDIF Dept Engn I-44100 Ferrara Italy

Chip multiprocessors (CMPs) are gaining momentum in the high-performance computing domain. Networks-on-chip (NoCs) are key components of CMP architectures, in that they have to deal with the communication scalability challenge while meeting tight power, area and latency constraints. 2D mesh topologies are usually preferred by designers of general purpose NoCs. However, manufacturing faults may break their regularity. Moreover, resource management frameworks may require the segmentation of the network into irregular regions. Under these conditions, efficient routing becomes a challenge. Although the use of routing tables at switches is flexible, it does not scale in terms of latency and area due to its memory requirements. Logic-based distributed routing (LBDR) is proposed as a new routing method that removes the need for routing tables at all. LBDR enables the implementation of many routing algorithms on most of the practical topologies we may find in the near future in a multi-core system. From an initial topology and routing algorithm, a set of three bits per switch/output port is computed. Evaluation results show that, by using a small logic, LBDR mimics the performance of routing algorithms when implemented with routing tables, both in regular and irregular topologies. LBDR implementation in a real NoC switch is also explored, proving its smooth integration in the architecture and its negligible hardware and performance overhead.

关键词： NOCT gene ARCHITECTURE Latency Network routing route list routing algorithms Switches

来源：评论

学校读者我要写书评

暂无评论

Region-Based routing: A Mechanism to Support Efficient routing algorithms in NoCs

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2009年第3期17卷 356-369页

作者： Mejia, Andres Palesi, Maurizio Flich, Jose Kumar, Shashi Lopez, Pedro Holsmark, Rickard Duato, Jose Univ Politecn Valencia Valencia 46022 Spain Univ Catania Fac Ingn Dept Ingn Informat & Telecomunicaz I-95125 Catania Italy Jonkoping Univ SE-55111 Jonkoping Sweden

An efficient routing algorithm is important for large on-chip networks [network-on-chip (NoC)] to provide the required communication performance to applications. Implementing NoC using table-based switches provide many advantages, including possibility of changing routing algorithms and fault tolerance, due to the option of table reconfigurations. However, table-based switches have been considered unsuitable for NoCs due to their perceived high area and power consumption. In this paper, we describe the region-based routing (RBR) mechanism which groups destinations into network regions allowing an efficient implementation with logic blocks. RBR can also be viewed as a mechanism to reduce the number of entries in routing tables. RBR is general and can be used in conjunction with any adaptive routing algorithm. In particular, we have evaluated the proposed scheme in conjunction with a general routing algorithm, namely segment-based routing (SR) and an Application Specific routing Algorithm (APSRA) using regular and irregular mesh topologies. Our study shows that the number of entries in the table is significantly reduced, especially for large networks. Evaluation results show that RBR requires only four regions to support several routing algorithms in a 2-D mesh with no performance degradation. Considering link failures, our results indicate that RBR combined with SR is able to tolerate up to 7 link failures in an 8 x 8 mesh. RBR also reduces area and power dissipation of an equivalent table-based implementation by factors of 8 and 10, respectively. Moreover, the degradation in performance of the network is insignificant when using APSRA combined with RBR.

关键词： Application-specific routing deadlock-free routing networks-on-chip (NoC) region-based router (RBR) routing algorithms router architecture table-based router

来源：评论

学校读者我要写书评

暂无评论

Spatial Design of Physical Network Robust Against Earthquakes

引用

Journal of Lightwave Technology 2014年第2期33卷 443-458页

作者： Hiroshi Saito 443

This paper analyzes the survivability of a physical network against earthquakes and proposes spatial network design rules to make a network robust against earthquakes. The disaster area model used is fairly generic and bounded. The proposed design rules for physical networks include: 1) a shorter zigzag route can reduce the probability that a network intersects a disaster area, 2) an additive performance metric, such as repair cost is independent of the network shape if the route length is fixed, and 3) additional routes within a ring network do not decrease the probability that all the routes between a given pair of nodes will intersect the disaster area, but a wider detour route does decrease it. Formulas for evaluating the probability of disconnecting two given nodes are also derived. An optimal server placement is shown as an application of the theoretical results. These analysis results are validated through empirical earthquake data.

关键词： Network optimization Network survivability Network topology Packet switched networks Ring networks routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Bandwidth-aware routing algorithms for networks-on-chip platforms

引用

IET COMPUTERS AND DIGITAL TECHNIQUES 2009年第5期3卷 413-429页

作者： Palesi, M. Kumar, S. Catania, V. Univ Catania Dipartimento Ingn Informat & Telecomunicaz I-95124 Catania Italy Jonkoping Univ Dept Elect & Comp Engn Sch Engn Jonkoping Sweden

General purpose routing algorithms for a network-on-chip (NoC) platform may not be able to provide sufficient performance for some communication intensive applications. This may be because of low adaptivity offered by a general purpose routing algorithm resulting in some links getting highly congested. In this study the authors demonstrate that it is possible to design highly efficient application-specific routing algorithms which distribute traffic more uniformly by using information regarding applications communication behaviour (communication topology and communication bandwidth). The authors use off-line analysis to estimate expected load on various links in the network. The result of this analysis is used along with the available routing adaptivity in each router to distribute less traffic to links and paths which are expected to be congested. The methodology for application-specific routing algorithms is extended to incorporate these features to design highly adaptive deadlock-free routing algorithms which also distribute traffic more uniformly and reduce network congestion. The authors discuss architectural implications and analyse area and power overheads of the proposed approach on the design of a table-based NoC router.

关键词： analysis of flowline Traffic network-on-chip Network Congestion Platform routing algorithms Writers Communication Research Distribute network links

来源：评论

学校读者我要写书评

暂无评论

Route Prediction Based Vehicular Mobility Management Scheme for VANET

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2014年第7期000卷 1-1页

作者： Lee, DaeWon Kim, Yoon-Ho Lee, HwaMin Seokyeong Univ Div Gen Educ Seoul 136704 South Korea Mokwon Univ Div Comp Engn Taejon 302318 South Korea Soonchunhyang Univ Dept Comp Software & Engn Asan 336745 Chungnam South Korea

Since improvement of wireless communication, IP based mobility management protocols have been studied to provide seamless communication and mobility management. The vehicular ad hoc network (VANET) is one of mobility management protocols, especially providing seamless connection with inter/intra/inner vehicle communication. However, each vehicle moves fast that causes short-lived connections with Access Router (AR). Based on vehicles' characteristic, it is hard to provide the availability of IP services in VANET. The most critical issue of the design of scalable routing algorithm is to provide robustness of frequent path disruption caused by vehicles' mobility. In this paper, we pursue the characteristics of vehicles' mobility and analyze them. With the navigation information which is one of vehicles' mobility characteristics, we classify the mobility into intrahighway mobility and global mobility management. Furthermore, we propose mobility management scheme based on route prediction in VANET. Handoffs with intrahighway mobility are managed locally and transparency is provided to CHs, while global mobility is managed with Mobile IPv6. Finally, through the numerical analysis, we show that proposed mobility management protocol reduces handoff latency, signaling costs, and packet loss.

关键词： VEHICULAR ad hoc networks (Computer networks) WIRELESS communication systems routing algorithms INTERNET protocol version 6 NUMERICAL analysis

来源：评论

学校读者我要写书评

暂无评论

A Flexible Transport Service for Passengers

引用

Transportation Research Procedia 2014年 3卷 442-451页

作者： Pasquale Carotenuto Leonardo Paradisi Giovanni Storchi Istituto per le Applicazioni del Calcolo “M. Picone” National Research Council via dei Taurini 19 Roma - 00185 Italy Dipartimento di Ingegneria dell’Impresa University of Rome “Tor Vergata” via del Politecnico 1 Roma - 00133 Italy Dipartimento di Scienze Statistiche University of Rome “Sapienza” piazzale Aldo Moro 5 Roma - 00185 Italy

The realization of innovative passengers transport services requires more and more often a greater flexibility and inexpensiveness of the service. To answer this request in many cases the physical solution is to realize a demand responsive transportation system (DRTS). A DRTS require the planning of travel paths (routing) and customers pick-up and drop-off times (scheduling) according to received requests, respecting the limited capacity of the fleet and time constraints (hard time windows) for each network's node, and the service time of the system. By the modelling point of view a DRTS can be effectively represented with a Dial-a-ride problem (DaRP). A DaRP derives from the Pick-up and Delivery Problem with Time Windows (PDPTW) and may operate according to a static or to a dynamic mode. In the static setting, all customers’ requests are known beforehand and the DaRP returns the vehicles routing and the passengers pick up and drop off time scheduling. The static setting may be representative of a phase of reservation occurred the day before the execution of the service. But, if the reservation requests must be processed on-line, even during the booking process there may be a certain level ad dynamism. In fact, if the algorithm works online, it manages each and every incoming request separately, and accepts or refuses it immediately, without knowing anything about the following. The operative program is constantly updated after each received request without refusal to carry out previous accepted services. In the dynamic mode, customers’ requests arrive when the service is already running and, consequently, the solution may change whilst the vehicle is already travelling. In this mode it is necessary that the schedule is updated when each new request arrives and that this is done in a short time to ensure that the potential customer will not leave the system before a possible answer. In this work, we describe a flexible people transport system capable of managing inc

关键词： Dial a ride Heuristics routing algorithms Transportation planning.

来源：评论

学校读者我要写书评

暂无评论

Wireless Sensor Network Architecture for Monitoring Large Physical System in Cyclic Mobility

引用

IFAC Proceedings Volumes 2014年第3期47卷 7170-7175页

作者： Abdellatif Chafik Vincent Lecuire Francis Lepage Université de Lorraine CRAN UMR 7039 Campus Sciences BP 70239 Vandoeuvre-lès-Nancy Cedex 54506 France CNRS CRAN UMR 7039 France

This paper addresses a sensor system dedicated to monitor a large mechanical machine. This sensor system is based on a wireless sensor network whose special feature is the mobility of one or more nodes following an invariant path traveled repeatedly. In the study described here the path is a circle. The topology chosen is that of locating relays on the mobile system that has appropriate geometric characteristics. A new dynamic routing algorithm is proposed. It uses the location and moving speed of mobile nodes to choose the optimal route of the packets forwarded to the fixed sink. Network performance is evaluated in terms of delivery time and packet loss rate and compared to this obtained by using flooding routing protocol. The results show that the proposed architecture and mechanisms deliver the appropriate quality of service for the monitoring of large physical systems.

关键词： monitoring mobile wireless sensor network routing algorithms cyber-physical system measuring transmitters

来源：评论

学校读者我要写书评

暂无评论

ACO-Based routing Algorithm for Cognitive Radio Networks

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2013年第1期2013卷 1-8页

作者： Huang, Peng Lin, Feng Zhou, Jiliu Sichuan Univ Coll Elect & Informat Engn Chengdu 610065 Peoples R China Xichang Coll Sch Automot & Elect Engn Xichang 615000 Peoples R China Sichuan Univ Sch Comp Sci Chengdu 610065 Peoples R China

Cognitive Radio Networks (CRNs) are an outstanding solution to improve efficiency of spectrum usage. Secondary users in cognitive networks may select from a set of available channels to use provided that the occupancy does not affect the prioritized licensed users. However, CRNs produce unique routing challenges due to the high fluctuation in the available spectrum as well as diverse quality-of-service (QoS) requirements. In CRNs, distributed multihop architecture and time varying spectrum availability are some of the key factors in design of routing algorithms. In this paper, we develop an ant-colony-optimization-(ACO-) based on-demand cognitive routing algorithm (ACO-OCR), jointly consider path and spectrum scheduling, and take advantage of the availability of multiple channels, to improve the delivery latency and packet loss rate. Then, an analytical framework based on M/G/1 queuing theory is introduced to illustrate the relay node queuing model. The performances of ACO-OCR have been evaluated by means of numerical simulations, and the experimental results confirm its effectiveness. Simulation results show that ACO-OCR outperforms other routing approaches in end-to-end path latency and package loss rate.

关键词： COGNITIVE radio (Wireless communication systems) routing algorithms RADIO networks QUALITY of service DISTRIBUTED algorithms ANT algorithms

来源：评论

学校读者我要写书评

暂无评论

A review of routing strategies for optical burst switched networks

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2013年第3期26卷 315-336页

作者： Yahaya, C. Abd Latiff, M. S. Mohamed, A. B. Univ Teknol Malaysia Fac Comp Sci & Informat Syst Skudai 81310 Johor Malaysia Univ Teknol Malaysia Fac Elect Engn Skudai 81310 Johor Malaysia

The exact contribution of this paper is a review of existing state-of-the-art routing strategies for optical burst switched networks developed by researchers to deal with burst contention before it happens. routing schemes are implemented in space domain, which make them simple and cost effective. Additionally, the paper points out the importance of routing as an effective way to deal with burst contention compared to other solutions. It also underlines the main differences between contention avoidance schemes and contention resolution techniques for optical burst switched networks. We believe that this review will help different optical burst switched researchers involved in the development of route optimization algorithms to control burst contention. Copyright (c) 2011 John Wiley & Sons, Ltd.

关键词： optical burst switched burst contention routing strategies routing algorithms AntNet ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Dynamic Openflow-Controlled Optical Packet Switching Network

引用

Journal of Lightwave Technology 2014年第8期33卷 1500-1507页

作者： Xiaoyuan Cao Noboru Yoshikane Takehiro Tsuritani Itsuro Morita Masatoshi Suzuki Takaya Miyazawa Masaki Shiraiwa Naoya Wada Noboru Yoshikane Takehiro Tsuritani Itsuro Morita Masatoshi Suzuki Takaya Miyazawa Masaki Shiraiwa Naoya Wada 1500

This paper presents and experimentally demonstrates the generalized architecture of Openflow-controlled optical packet switching (OPS) network. Openflow control is enabled by introducing the Openflow/OPS agent into the OPS network, which realizes the Openflow protocol translation and message exchange between the Openflow control plane and the underlying OPS nodes. With software-defined networking (SDN) and Openflow technique, the complex control functions of the conventional OPS network can be offloaded into a centralized and flexible control plane, while promoted control and operations can be provided due to centralized coordination of network resources. Furthermore, a contention-aware routing/rerouting strategy as well as a fast network adjustment mechanism is proposed and demonstrated for the first time as advanced Openflow control to route traffic and handle the network dynamics. With centralized SDN/Openflow control, the OPS network has the potential to have better resource utilization and enhanced network resilience at lower cost and less node complexity. Our work will accelerate the development of both OPS and SDN evolution.

关键词： Circuit switching Network topology Optical networks Packet switched networks Packet switching routing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：