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

A Survey and Evaluation of Topology-Agnostic Deterministic routing algorithms

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2012年第3期23卷 405-425页

作者： Flich, Jose Skeie, Tor Mejia, Andres Lysne, Olav Lopez, Pedro Robles, Antonio Duato, Jose Koibuchi, Michihiro Rokicki, Tomas Carlos Sancho, Jose Univ Politecn Valencia DISCA Valencia 46022 Spain Simula Res Lab N-1325 Lysaker Norway Univ Oslo N-1325 Lysaker Norway Intel Corp Santa Clara CA 95054 USA Res Org Informat & Syst Natl Inst Informat Chiyoda Ku Tokyo 1018430 Japan Instantis Palo Alto CA 94303 USA Barcelona Supercomp Ctr Barcelona 08034 Spain

Most standard cluster interconnect technologies are flexible with respect to network topology. This has spawned a substantial amount of research on topology-agnostic routing algorithms, which make no assumption about the network structure, thus providing the flexibility needed to route on irregular networks. Actually, such an irregularity should be often interpreted as minor modifications of some regular interconnection pattern, such as those induced by faults. In fact, topology-agnostic routing algorithms are also becoming increasingly useful for networks on chip (NoCs), where faults may make the preferred 2D mesh topology irregular. Existing topology-agnostic routing algorithms were developed for varying purposes, giving them different and not always comparable properties. Details are scattered among many papers, each with distinct conditions, making comparison difficult. This paper presents a comprehensive overview of the known topology-agnostic routing algorithms. We classify these algorithms by their most important properties, and evaluate them consistently. This provides significant insight into the algorithms and their appropriateness for different on- and off-chip environments.

关键词： Interconnection networks routing algorithms topology-agnostic routing

来源：评论

学校读者我要写书评

暂无评论

2-ACTION MULTIACTION DISCRETIZED LEARNING routing algorithms IN INTERACTION WITH THRESHOLD-BASED FLOW-CONTROL FOR COMPUTER-NETWORKS

引用

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES 1992年第2期139卷 93-100页

作者： VASILAKOS, AV PAXIMADIS, CT MOSCHONAS, CA Department of Computer Engineering University of Patras Patras Greece

The interactions between adaptive routing algorithms incorporating learning automata and a variable window flow control algorithm are examined. The routing algorithms examined use two new discretised learning automata to choose the minimum delay routes in the network. The first routing algorithm can choose between two possible candidate paths. The second algorithm, using a new fast and accurate multi-action discretised automaton can choose between as many candidate paths as desired. The flow control algorithm is a threshold-based variable window algorithm that decreases the window size when a predefined delay threshold is exceeded and increases it below this threshold. The interactions between the two algorithms are studied. The resulting scheme is compared with similar schemes reported in the literature via simulations. Simulation results are presented which show that the new scheme performs quite well in both normal and abnormal network conditions.

关键词： COMPUTER NETWORKS FLOW CONTROL routing algorithms S-MODEL LEARNING AUTOMATA 2-MULTI-ACTION DISCRETIZED LEARNING algorithms

来源：评论

学校读者我要写书评

暂无评论

Model-based evaluation of the power versus performance of network routing algorithms

引用

COMPUTING 2021年第8期103卷 1723-1746页

作者： Asadi, Ali Naghash Azgomi, Mohammad Abdollahi Entezari-Maleki, Reza Iran Univ Sci & Technol Sch Comp Engn Trustworthy Comp Lab Tehran Iran Iran Univ Sci & Technol Sch Comp Engn Hengam StResalat Sq Tehran *** Iran Iran Univ Sci & Technol Sch Comp Engn Tehran Iran

In order to optimize traffic flows and power consumption of network components, various green routing algorithms and protocols have been proposed. These algorithms and protocols apply different techniques to attain their own goals. One of the most important techniques is the sleep-scheduling technique that switches the status of the network components, nodes or links, into active/inactive modes. There are four characteristics affecting the power and performance of communication networks which distinguish green routing algorithms and protocols, namely the sleep-scheduled component, decision structure, network traffic awareness, and quality of service awareness. In this paper, a method is proposed to model, evaluate, and compare the power and performance of the green routing algorithms that use the sleep-scheduling technique. We apply stochastic activity networks to model and analyze the routing algorithms with respect to the network topology. The results obtained from the comparison of the algorithms, validated with the OMNeT++ simulator, can be used by network administrators to make the right decisions.

关键词： routing algorithms Power-aware networking Performance modeling Stochastic activity network (SANs) OMNeT plus plus simulator

来源：评论

学校读者我要写书评

暂无评论

routing algorithms for all-optical networks with power considerations: The unicast case 8

Routing algorithms for all-optical networks with power consi...

引用

8th International Conference on Computer Communications and Networks, ICCCN 1999

作者： Ali, Maher Ramamurthy, Byrav Deogun, Jitender S. Department of Computer Science and Engg. University of Nebraska-Lincoln LincolnNE68588-0115 United States

ISBN: (纸本)0780357949

In this paper, we investigate the problem of routing connections in ail-optical networks while allowing for degradation of routed signals by different optical components. To overcome the complexity of the problem, we divide it into two parts. First, we solve the pure RWA problem using fixed routes for every connection. Second, power assignment is accomplished by either using the smallest-gain first (SGF) heuristic or using a genetic algorithm. Numerical examples on a wide variety of networks show that: (a) the number of connections established without considering the signal attenuation was most of the time greater than that achievable considering attenuation;and (b) the genetic solution quality was much better than that of SGF, especially when the conflict graph of the connections generated by the linear solver is denser. © 1999 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Energetic sustainability of routing algorithms for energy-harvesting wireless sensor networks

引用

COMPUTER COMMUNICATIONS 2007年第14-15期30卷 2976-2986页

作者： Lattanzi, Ernanuele Regini, Edoardo Acquaviva, Andrea Bogliolo, Alessandro Univ Urbino Informat Sci & Technol Inst I-61029 Urbino Italy

A new class of wireless sensor networks that harvest power from the environment is emerging because of its intrinsic capability of providing unbounded lifetime. While a lot of research has been focused on energy-aware routing schemes tailored to battery-operated networks, the problem of optimal routing for energy harvesting wireless sensor networks (EH-WSNs) has never been explored. The objective of routing optimization in this context is not extending network lifetime, but maximizing the workload that can be autonomously sustained by the network. In this work we present a methodology for assessing the energy efficiency of routing algorithms for networks whose nodes drain power from the environment. We first introduce the energetic sustainability problem, then we define the maximum energetically sustainable workload (MESW) as the objective function to be used to drive the optimization of routing algorithms for EH-WSNs. We propose a methodology that makes use of graph algorithms and network simulations for evaluating the MESW starting from a network topology, a routing algorithm and a distribution of the environmental power available at each node. We present a tool flow implementing the proposed methodology and we show comparative results achieved on several routing algorithms. Experimental results highlight that routing strategies that do not take into account environmental power do not provide optimal results in terms of workload sustainability. Using optimal routing algorithms may lead to sizeable enhancements of the maximum sustainable workload. Moreover, optimality strongly depends on environmental power configurations. Since environmental power sources change over time, our results prompt for a new class of routing algorithms for EH-WSNs that are able to dynamically adapt to time-varying environmental conditions. (C) 2007 Elsevier B.V. All rights reserved.

关键词： wireless sensor networks energy harvesting routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Integrated hybrid optical node using dynamic reconfiguration and routing algorithms for bimodal traffic

引用

JOURNAL OF OPTICAL NETWORKING 2007年第10期6卷 1191-1209页

作者： Okorafor, Ekpe Texas A&M Univ College Stn TX 77845 USA

I propose an integrated hybrid optical node ( i-HON) architecture that is designed to combine both packet-switched and circuit-switched data in an effective manner to maximize link utilization, minimize communication latencies, and improve overall performance. I demonstrate the feasibility of i-HON by proposing a single wavelength optical header encoder and self-routing binary-encoded optical header address processing. I then develop dynamic hybrid routing heuristics and adapt these to the novel dynamic reconfiguration and routing algorithms suited for asynchronous bufferless optical networks that incorporate optical routing logic. I compare the performance of the presented algorithms. I use simulation results to show that i-HON provides overall system throughput performance improvements of up to 40% with similar to 50% reduction in network latency. (c) 2007 Optical Society of America.

关键词： Circuit switched networks Optical network architecture Optical networks Packet switching routing algorithms Wavelength routing

来源：评论

学校读者我要写书评

暂无评论

Oblivious routing algorithms on the mesh of buses

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2000年第2期60卷 137-149页

作者： Iwama, K Miyano, E Kyoto Univ Sch Informat Kyoto 6068501 Japan Kyushu Inst Design Fukuoka 8158540 Japan

An optimal [1.5N(1/2)] lower bound is shown for oblivious routing on the mesh of buses: a two-dimensional parallel model consisting of N-1/2 x N-1/2 processors and N-1/2 TOW and N-1/2 column buses but no local connections between neighboring processors. Many lon er bound proofs for routing on mesh-structured models use a single instance (adversary) which includes difficult packet-movement. This approach does not work in our case, our proof is one of the rare cases which really exploit the fact that the routing algorithm has to cope with many different instances. Note that the two-dimensional mesh of buses includes 2N(1/2) buses and each processor can access two different buses. Apparently the three-dimensional model provides more communication facilities, namely including 3N(2/3) buses, and each processor can access three different buses. Surprisingly, however, the oblivious routing on the three-dimensional mesh of buses needs more time, i.e., Omega(N-2/3) steps, which is another important result of this paper. (C) 2000 Academic Press.

关键词： Bounds PROCESSOR Bound routing algorithms Medical Subject Headings communication equipment Network routing

来源：评论

学校读者我要写书评

暂无评论

Deadlock-free generic routing algorithms for 3-dimensional Networks-on-Chip with reduced vertical link density topologies

引用

JOURNAL OF SYSTEMS ARCHITECTURE 2013年第7期59卷 528-542页

作者： Ying, Haoyuan Jaiswal, Ashok Hollstein, Thomas Hofmann, Klaus Tech Univ Darmstadt D-64283 Darmstadt Germany Tallinn Univ Technol EE-12618 Tallinn Estonia

3-Dimensional Networks-on-Chip (3D NoC) have emerged as the promising solution for scalability, power consumption and performance demands of next generation Systems-on-Chip (SoCs) interconnect. Due to the cost in terms of thermal, yield, chip area and design complexity, minimizing the number of Through-Silicon-Via (TSVs) in 3D ICs has become on the most important design issues. In this paper, we will present several stable, simple and deadlock-free generic routing algorithms for 3D NoCs with different reduced vertical link density topologies, which can maintain the 3D NoCs performance and save the system cost (TSV number, chip area, system power, etc.). The experimental results have been extracted from our cycle-accurate GSNOC simulator and have shown that our routing algorithms can maintain the system performance up to reducing 50% of TSVs number in comparison to the 100% TSVs number with ZXY routing algorithm configuration. (C) 2013 Elsevier B.V. All rights reserved.

关键词： 3D NoC routing algorithms Vertical link density Deadlock-free

来源：评论

学校读者我要写书评

暂无评论

2ND-DERIVATIVE routing algorithms

引用

ELECTRONICS LETTERS 1986年第14期22卷 749-750页

作者： PAVLIDOU, F KOURIS, SS Electrical Engineering Department University of Thessaloniki Thessaloniki Greece

An approximation of Newton's method has been used recently in routing algorithms in computer networks, which is based on the assumption that the matrix of second derivatives of the objective function (Hessian) is diagonal. It is demonstrated that in message-switched networks some specific nondiagonal elements exist and therefore the Hessian is not diagonal. Moreover, it is found that these elements are of the same order as the diagonal ones.

关键词： message-switched networks computer networks objective's function Newton's method routing algorithms message switching Computer networks and techniques Communication system theory Hessian nondiagonal elements

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：