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

A Reliable routing Architecture and Algorithm for NoCs

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2012年第5期31卷 726-739页

作者： DeOrio, Andrew Fick, David Bertacco, Valeria Sylvester, Dennis Blaauw, David Hu, Jin Chen, Gregory Univ Michigan Ann Arbor MI 48109 USA Intel High Performance Circuits Res Grp Hillsboro OR 97124 USA

Aggressive transistor scaling continues to drive increasingly complex digital designs. The large number of transistors available today enables the development of chip multiprocessors that include many cores on one die communicating through an on-chip interconnect. As the number of cores increases, scalable communication platforms, such as networks-on-chip (NoCs), have become more popular. However, as the sole communication medium, these interconnects are a single point of failure so that any permanent fault in the NoC can cause the entire system to fail. Compounding the problem, transistors have become increasingly susceptible to wear-out related failures as their critical dimensions shrink. As a result, the on-chip network has become a critically exposed unit that must be protected. To this end, we present Vicis, a fault-tolerant architecture and companion routing protocol that is robust to a large number of permanent failures, allowing communication to continue in the face of permanent transistor failures. Vicis makes use of a two-level approach. First, it attempts to work around errors within a router by leveraging reconfigurable architectural components. Second, when faults within a router disable a link's connectivity, or even an entire router, Vicis reroutes around the faulty node or link with a novel, distributed routing algorithm for meshes and tori. Tolerating permanent faults in both the router components and the reliability hardware itself, Vicis enables graceful performance degradation of networks-on-chip.

关键词： Fault tolerance hard faults networks-on-chip (NoCs) reconfiguration reliability routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Making path selection faster: a routing algorithm for ONoC

引用

OPTICS EXPRESS 2021年第7期29卷 10221-10235页

作者： Zhu, Lijing Gu, Huaxi Yang, Yintang Chen, Yawen Xidian Univ State Key Lab Integrated Serv Networks CO-710071 Xian Peoples R China Xidian Univ Sch Microelect CO-710071 Xian Peoples R China Univ Otago Dept Comp Sci POB 50 Dunedin 9054 New Zealand

Optical network-on-chip (ONoC) is an effective communication architecture to realize high performance and energy efficiency. Diverse routing algorithms are proposed to avoid the congestion, tolerate the faults, and reduce the insertion loss or energy consumption. However, existing algorithms did not consider the characteristic optical circuit-switching of ONoC, which aggravates the network congestion and degrades the associated performance severely. In this paper, by exploiting congestion prediction technique, we propose a new routing algorithm for ONoC, named loophole-routing, to improve the success rate of path-setup and decrease the latency. We use the congestion prediction technique to analyze the latency and predict the port condition caused by the network congestion. Theoretical analysis and experimental results of different synthetic traffic patterns show that the loophole-routing improves network latency over XY routing and OE-turn routing by 15.56%, 25.71%, 18.92%, 66.67% and 42.86% under uniform, hotspot1, hotspot2, transpose2 and transpose3 traffic patterns while improving the saturation throughput by 31.43%, 34.33%, 35.29%, 67.86% and 99.5% under uniform, hotspot1, hotspot2, transpose2 and transpose3 traffic patterns on average than XY routing. In addition, our proposed loophole-routing has the benefits of high path diversity and adaptive degree and low computing complexity and overhead and the potential to make fault-tolerant path selection. (C) 2021 Optical Society of America under the terms of the OSA Open Access Publishing Agreement

关键词： Optical networks Optical signals Packet switching routing algorithms Signal transmission Space division multiplexing

来源：评论

学校读者我要写书评

暂无评论

A necessary and sufficient condition for deadlock-free wormhole routing

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 1996年第1期32卷 103-117页

作者： Schwiebert, L Jayasimha, DN NASA LEWIS RES CTR CLEVELAND OH 44135 USA

An important open problem in wormhole routing has been to find a necessary and sufficient condition for deadlock-free adaptive routing. Recently, Duato has solved this problem for a restricted class of adaptive routing algorithms. In this paper, a necessary and sufficient condition is proposed that can be used for any adaptive or nonadaptive routing algorithm for wormhole routing, as long as only local information is required for routing. The underlying proof technique introduces a new type of dependency graph, the channel waiting graph, which omits most channel dependencies that cannot be used to create a deadlock configuration. The necessary and sufficient condition can be applied in a straightforward manner to most routing algorithms. This is illustrated by proving deadlock freedom for a partially adaptive nonminimal mesh routing algorithm that does not require virtual channels and a fully adaptive minimal hypercube routing algorithm with two virtual channels per physical channel. Both routing algorithms are more adaptive than any previously proposed routing algorithm with similar virtual channel requirements. (C) 1996 Academic Press, Inc.

关键词： Interconnection networks Interconnection networks Self tuning Sufficient conditions Network routing virtual channels routing algorithms Routeing

来源：评论

学校读者我要写书评

暂无评论

Energy Aware Simple Ant routing Algorithm for Wireless Sensor Networks

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-11页

作者： Jabbar, Sohail Iram, Rabia Imran, Muhammad Ahmad, Awais Paul, Anand Minhas, Abid Ali Iftikhar, Andmohsin Bahria Univ Dept Comp Sci Islamabad 44000 Pakistan COMSATS Inst Informat Technol Dept Comp Sci Sahiwal 57000 Pakistan King Saud Univ Riyadh 11451 Saudi Arabia Kyungpook Natl Univ Sch Comp Sci & Engn Taegu 702701 South Korea Al Yamamah Univ Coll Comp & Informat Syst Riyadh 11512 Saudi Arabia Charles Sturt Univ Sch Comp & Math Wagga Wagga NSW 2678 Australia

Network lifetime is one of the most prominent barriers in deploying wireless sensor networks for large-scale applications because these networks employ sensors with nonrenewable scarce energy resources. Sensor nodes dissipate most of their energy in complex routing mechanisms. To cope with limited energy problem, we present EASARA, an energy aware simple ant routing algorithm based on ant colony optimization. Unlike most algorithms, EASARA strives to avoid low energy routes and optimizes the routing process through selection of least hop count path with more energy. It consists of three phases, that is, route discovery, forwarding node, and route selection. We have improved the route discovery procedure and mainly concentrate on energy efficient forwarding node and route selection, so that the network lifetime can be prolonged. The four possible cases of forwarding node and route selection are presented. The performance of EASARA is validated through simulation. Simulation results demonstrate the performance supremacy of EASARA over contemporary scheme in terms of various metrics.

关键词： routing algorithms WIRELESS sensor networks SIMULATION methods & models WIRELESS sensor nodes COMPUTER networks

来源：评论

学校读者我要写书评

暂无评论

MERA: A Micro-Economic routing Algorithm for Wireless Sensor Networks

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2012年第8期E95B卷 2642-2645页

作者： Esquivel-Gomez, Jesus Balderas-Navarro, Raul E. Stevens-Navarro, Enrique Acosta-Elias, Jesus Univ Autonoma San Luis Potosi San Luis Potosi Mexico UASLP Inst Invest Comunicac Opt San Luis Potosi Mexico

One of the most important constraints in wireless sensor networks (WSN) is that their nodes, in most of the cases, are powered by batteries, which cannot be replaced or recharged easily. In these types of networks, data transmission is one of the processes that consume a lot of energy, and therefore the embedded routing algorithm should consider this issue by establishing optimal routes in order to avoid premature death and eventually having partitioned nodes network. This paper proposes a new routing algorithm for WSN called Micro-Economic routing Algorithm (MERA), which is based on the microeconomic model of supply-demand. In such algorithm each node comprising the network fixes a cost for relay messages according to their residual battery energy;and before sending information to the base station, the node searches for the most economical route. In order to test the performance of MERA, we varied the initial conditions of the system such as the network size and the number of defined thresholds. This was done in order to measure the time span for which the first node dies and the number of information messages received by the base station. Using the NS-2 simulator, we compared the performance of MERA against the Conditional Minimum Drain Rate (CMDR) algorithm reported in the literature. An optimal threshold value for the residual battery is estimated to be close to 20%.

关键词： wireless sensor networks routing algorithms energy efficiency pricing

来源：评论

学校读者我要写书评

暂无评论

Centralized Adaptive routing for NoCs

IEEE COMPUTER ARCHITECTURE LETTERS

引用

IEEE COMPUTER ARCHITECTURE LETTERS 2010年第2期9卷 57-60页

作者： Manevich, Ran Cidon, Israel Kolodny, Avinoam Walter, Isask'har Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

As the number of applications and programmable units in CMPs and MPSoCs increases, the Network-on-Chip (NoC) encounters diverse and time dependent traffic loads. This trend motivates the introduction of NoC load-balanced, adaptive routing mechanisms that achieve higher throughput as compared with traditional oblivious routing schemes that are perceived better suited for hardware implementations. However, an efficient adaptive routing scheme should base its decisions on the global state of the system rather than on local or regional congestion signals as is common in current adaptive routing schemes. In this paper we introduce a novel paradigm of NoC centralized adaptive routing, and a specific design for mesh topology. Our scheme continuously monitors the global traffic load in the network and modifies the routing of packets to improve load balancing accordingly. In our specific mesh-based design, XY or YX routes are adaptively selected for each source-destination pair. We show that while our implementation is scalable and lightweight in hardware costs, it outperforms distributed adaptive routing schemes in terms of load balancing and throughput.

关键词： Network-on-Chip routing algorithms adaptive routing load balancing

来源：评论

学校读者我要写书评

暂无评论

Enhancing AODV routing protocol over mobile ad hoc sensor networks

引用

INTERNATIONAL JOURNAL OF SENSOR NETWORKS 2011年第1-2期10卷 36-41页

作者： Soliman, Hamdy Al-Otaibi, Mohammad New Mexico Inst Min & Technol Dept Comp Sci & Engn Socorro NM 87801 USA

In this paper, we efficiently adapt the prominent Ad hoc On-demand Distance Vector (AODV) routing protocol with a reactive Local Link Repair (AODV-LR) for effective deployment in Mobile Ad hoc Sensor Networks (MASNETs) with restricted power and bandwidth. We introduce two replacement mechanisms to the local repair phase of the AODV. Our new approaches are self-repairing AODV algorithms called Reactive Self-repairing AODV (AODV-RSR) and Pre-emptive Self-repairing AODV (AODV-PSR). These two algorithms are able to find an alternative route to a failing link without depending only on broadcasting Route Request (RREQ) packets. Experimental results show that the new algorithms achieve better performance than the AODV-LR and Self-repair Algorithm (SRAODV) by obtaining lower packet delay, higher packet delivery ratio and lower control message overhead.

关键词： routing algorithms computer network performance AODV AODV-RSR AODV-PSR SRAODV

来源：评论

学校读者我要写书评

暂无评论

QoT function and A* routing: an optimized combination for connection search in translucent networks

引用

JOURNAL OF OPTICAL NETWORKING 2008年第1期7卷 42-61页

作者： Morea, Annalisa Brogard, Nicolas Leplingard, Florence Antona, Jean-Christophe Zami, Thierry Lavigne, Bruno Bayart, Dominique Alacatel Lucent Res & Innovat F-91620 Nozay France

We investigate a new routing algorithm able to finely consider signal quality during propagation in an optical WDM meshed network. To evaluate the quality of transmission, we propose an analytical estimator based on experimental measurements, along with an assessment of its accuracy. The proposed algorithm "places" optoelectronic (OEO) regenerators, taking into account the wavelength occupation and the quality of transmission of the selected optical path, so it can optimize the number of required OEO operations for a connection. To validate the interest of the proposed algorithm and the quality of transmission estimator, we present dimensioning results for two different routing strategies and two different estimators of transmission quality. The performance of the proposed methods is particularly relevant compared to works in present literature where system characteristics are not ideal. (C) 2007 Optical Society of America.

关键词： Network topology Optical networks routing algorithms Signal transmission Wavelength assignment Wavelength conversion

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Experimental evaluation of GMPLS enhanced routing for differentiated survivability in all-optical networks

引用

JOURNAL OF OPTICAL NETWORKING 2008年第5期7卷 496-512页

作者： Martinez, Ricardo Casellas, Ramon Munoz, Rauel CTTC Castelldefels 08860 Spain

Future intelligent optical networks (IONs) are devised to support a wide variety of clients, each having their own reliability requirements, such as availability. These networks thus need to support differentiated recovery schemes fulfilling those requirements while achieving efficient network performance ( e. g., resource usage). We specifically focus on dedicated path protection ( DPP) and shared path protection (SPP) recovery within generalized multiprotocol label switching (GMPLS) all-optical networks. In this context, the standard GMPLS open shortest path first-traffic engineering (OSPF-TE) protocol does not convey the required routing information in order to achieve a desirable network performance. The novelty of this work is twofold. First, to present enhanced GMPLS routing approaches for both SPP and DPP recovery schemes that, besides maximizing resource usage, also address connection blocking mostly due to the wavelength continuity constraint. Second, to evaluate these implemented schemes in a real experimental ION named ADRENALINE test-bed. A detailed description of the routing approaches along with their required extensions to current GMPLS OSPF-TE is provided. The experimental performance comparison is conducted considering three figures of merit: connection blocking probability, restoration overbuild, and connection setup delay. The evaluation of the aforementioned schemes may help network operators to select a survivability scheme for a given client. (C) 2008 Optical Society of America.

关键词： All optical networks Network topology Optical add drop multiplexers Optical networks routing algorithms Wavelength assignment

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：