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

ECO routing based on network flow method

INTEGRATION-THE VLSI JOURNAL 2022年 86卷 1-8页

作者： Chung, Sehyeon Kim, Taewhan Seoul Natl Univ Sch Elect & Comp Engn Seoul South Korea

In this paper, a new ECO routing approach to the problem of resolving pin inaccessibility on standard cells is presented. The conventional ECO routing approaches conceptually divide the rerouting path search problem for a set of target nets to rip-up and reroute into two interdependent tasks: (i) (Off-cell routing) repairing the routing path between the net terminal outside of the cell and the cell boundary and (ii) (On-cell routing) repairing the routing path between the cell boundary and the pin on the cell where they have conventionally performed tasks (i) and (ii) iteratively for each target net. Yet, there is no easy way to accurately predict the final result of task (ii) for all nets during task (i). In our approach, we place the primary importance on resolving pin inaccessibility on cells. Consequently, we perform on-cell routing for all ripped-up nets simultaneously to resolve the pin inaccessibility first by utilizing flexible cell boundary access points and then to adjust the sub-paths outside of the cell. For a number of benchmark circuits, it is shown that our approach of early consideration of entire on-cell routing is very effective, resolving the pin inaccessibility of 71.09% out of all nets for which a commercial ECO router has failed to find legal routes.

关键词： ECO routing routing algorithms Standard cells Pin accessibility

来源：评论

学校读者我要写书评

暂无评论

EasyGo: Low-cost and robust geographic opportunistic sensing routing in a strip topology wireless sensor network

引用

COMPUTER NETWORKS 2018年 143卷 191-205页

作者： Liu, Chen Fang, Dingyi Hu, Yue Tang, Shensheng Xu, Dan Cui, Wen Chen, Xiaojiang Liu, Baoying Xu, Guangquan Chen, Hao Northwest Univ Sch Informat Sci & Technol Xian Shaanxi Peoples R China Missouri Western State Univ St Joseph MO USA Tianjin Univ Tianjin Peoples R China China Inst Ind Relat Beijing Peoples R China

With the fast increasing popularity of smart device communication technologies, the wireless networks on mobile sensing applications have received much attention. Wireless Sensor Networks (WSNs) with a strip structure are ubiquitous in real world deployments, such as pipeline monitoring, water quality monitoring as well as Great Wall monitoring. However, the existing routing methods will select the next-hop node that deviates from the transmission direction to sink node in strip networks with high curvature, leading to the high communication failure rate and energy consumption. To this end, we propose a new geographic routing sensing opportunistic approach, named EasyGo, to cope with the routing problem, i.e., the transmission success rate decreases in the complicated strip networks. Specifically, by investigating the transmission direction, we propose a new candidate selection algorithm SLS, which introduces the concepts of layer slicing and virtual sinks to improve the transmission success rate in strip WSNs. Theoretical analysis and extensive simulations illustrate the high efficiency and transmission performance of the proposed EasyGo strategy for strip WSNs. Furthermore, we implement the EasyGo on the testbed with Z-Stack (TM) nodes. Compared with the classic algorithms, our EasyGo improves the transmission success rate by up to 10%, reduces the communication overhead and the energy consumption rate by up to 11.8% and 5%, respectively. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Wireless sensor networks routing algorithms Strip network monitoring

来源：评论

学校读者我要写书评

暂无评论

An Optimal Single-Path routing Algorithm in the Datacenter Network DPillar

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2017年第3期28卷 689-703页

作者： Erickson, Alejandro Kiasari, Abbas E. Navaridas, Javier Stewart, Iain A. Univ Durham Sch Engn & Comp Sci South Road Durham DH1 3LE England Univ Manchester Sch Comp Sci Oxford Road Manchester M13 9PL Lancs England

DPillar has recently been proposed as a server-centric datacenter network and is combinatorially related to (but distinct from) the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before proving that the underlying graph of DPillar is a Cayley graph;hence, the datacenter network DPillar is node-symmetric. We use this symmetry property to establish a single-path routing algorithm for DPillar that computes a shortest path and has time complexity O(k), where k parameterizes the dimension of DPillar (we refer to the number of ports in its switches as n). Our analysis also enables us to calculate the diameter of DPillar exactly. Moreover, our algorithm is trivial to implement, being essentially a conditional clause of numeric tests, and improves significantly upon a routing algorithm earlier employed for DPillar. Furthermore, we provide empirical data in order to demonstrate this improvement. In particular, we empirically show that our routing algorithm improves the average length of paths found, the aggregate bottleneck throughput, and the communication latency. A secondary, yet important, effect of our work is that it emphasises that datacenter networks are amenable to a closer combinatorial scrutiny that can significantly improve their computational efficiency and performance.

关键词： Datacenter networks routing algorithms shortest paths symmetry

来源：评论

学校读者我要写书评

暂无评论

Edge-Node Deployed routing Strategies for Load Balancing in Optical Burst Switched Networks

引用

ETRI JOURNAL 2009年第1期31卷 31-41页

作者： Barradas, Alvaro L. Medeiros, Maria do Carmo R. Univ Algarve Fac Sci & Technol Faro Portugal

Optical burst switching is a promising switching paradigm for the next IP-over-optical network backbones. However, its burst loss performance is greatly affected by burst contention. Several methods have been proposed to address this problem, some of them requiring the network to be flooded by frequent state dissemination signaling messages. In this work, we present a traffic engineering approach for path selection with the objective of minimizing contention using only topological information. The main idea is to balance the traffic across the network to reduce congestion without incurring link state dissemination protocol penalties. We propose and evaluate two path selection strategies that clearly outperform shortest path routing. The proposed path selection strategies can be used in combination with other contention resolution methods to achieve higher levels of performance and support the network reaching stability when it is pushed under stringent working conditions. Results show that the network connectivity is an important parameter to consider.

关键词： Optical networks optical burst switching path selection strategies routing algorithms network optimization and topology burst loss

来源：评论

学校读者我要写书评

暂无评论

Geometric approach for optimal routing on a mesh with buses

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 1997年第3期54卷 475-486页

作者： BenAsher, Y Newman, I UNIV HAIFA DEPT MATH & COMP SCI IL-31905 HAIFA ISRAEL

The architecture of ''mesh of buses'' is an important model in parallel computing. Its main advantage is that the additional broadcast capability can be used to overcome the main disadvantage of the mesh, namely its relatively large diameter. We show that the addition of buses indeed accelerates routing times. Furthermore, unlike in the ''store and forward'' model, the routing time becomes proportional to the network load, resulting in decreasing in routing time for a smaller number of packets. We consider 1-1 routing of m packets in a d-dimensional mesh with n(d) processors and d.n(d-1) buses (one per row and column). The two standard models of accessing the buses are considered and compared: CREW, in which only one processor may transmit at any given time on a given bus, and the CRCW model, in which several processors may attempt to transmit at the same time (getting a noise signal as a result). We design a routing algorithm that routes m packets in the CREW model in O(m(1/d)+n(1/(d+1))) steps. This result holds for m less than or equal to n(2d/3) for d greater than or equal to 3 and unconditionally for d=2. A matching lower bound is also proved. In the CRCW case we show an algorithm of O(m(1/d) log n) and a lower bound of Omega(m(1/d)). It is shown that the difference between the models is essentially due to the improved capability of estimating threshold functions in the CRCW case. (C) 1997 Academic Press.

关键词： Connected computers Efficient PROCESSOR concurrency theory Packet routing algorithms Greater than or equal to PARALLEL PROCESSING (COMPUTERS) noise signal Network routing Standard model large diameter

来源：评论

学校读者我要写书评

暂无评论

routing in optical transport networks with deep reinforcement learning

引用

JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING 2019年第11期11卷 547-558页

作者： Suarez-Varela, Jose Mestres, Albert Yu, Junlin Kuang, Li Feng, Haoyu Cabellos-Aparicio, Albert Barlet-Ros, Pere Univ Politecn Cataluna Comp Architecture Dept Barcelona Spain Huawei Technol Co LTD Shenzhen Peoples R China

Deep reinforcement learning (DRL) has recently revolutionized the resolution of decision-making and automated control problems. In the context of networking, there is a growing trend in the research community to apply DRL algorithms to optimization problems such as routing. However, existing proposals fail to achieve good results, often under-performing traditional routing techniques. We argue that the reason behind this poor performance is that they use straightforward representations of networks. In this paper, we propose a DRL-based solution for routing in optical transport networks (OTNs). Contrary to previous works, we propose a more elaborate representation of the network state that reduces the level of knowledge abstraction required for DRL agents and easily captures the singularities of network topologies. Our evaluation results show that using our novel representation, DRL agents achieve better performance and learn how to route traffic in OTNs significantly faster compared to state-of-the-art representations. Additionally, we reverse engineered the routing strategy learned by our DRL agent, and as a result, we found a routing algorithm that outperforms well-known traditional routing heuristics. (C) 2019 Optical Society of America.

关键词： Network optimization Network topology Neural networks Optical networks routing algorithms Stochastic gradient descent

来源：评论

学校读者我要写书评

暂无评论

A new routing algorithm for multirate rearrangeable Clos networks

引用

THEORETICAL COMPUTER SCIENCE 2003年第3期290卷 2157-2167页

作者： Ngo, HQ SUNY Buffalo Dept Comp Sci & Engn NMVL Amherst NY 14260 USA

In this paper, we study the problem of finding routing algorithms on the multirate rearrangeable Clos networks which use as few number of middle-stage switches as possible. We propose a new routing algorithm called the "grouping algorithm". This is a simple algorithm which uses fewer middle-stage switches than all known strategies, given that the number of input-stage switches and output-stage switches are relatively small compared to the size of input and output switches. In particular, the grouping algorithm implies that m = 2n + [(n - 1)/2(k)] is a sufficient number of middle-stage switches for the symmetric three-stage Clos network C(n, m, r) to be multirate rearrangeable, where k is any positive integer and r less than or equal to n/(2(k) - 1). (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： Clos networks routing algorithms multirate networks rearrangeable networks

来源：评论

学校读者我要写书评

暂无评论

Percolation routing in a three-dimensional multicomputer network topology using optical interconnection

引用

JOURNAL OF OPTICAL NETWORKING 2005年第3期4卷 157-175页

作者： Okorafor, E Lu, M Texas A&M Univ Dept Elect Engn College Stn TX 77843 USA

We investigate the network communication behavior of a three-dimensional (3D) multicomputer system using optical interconnection in which faulty nodes are left in place, a concept called "fail-in-place." We call this the percolation problem in which various amounts of missing nodes fixed in position in the network may have a dramatic effect on the network's ability to transport data effectively. As the number of failed nodes increases, data have to be rerouted through intermediate nodes creating potential "hot spots." These hot spots become the bottleneck that degrades performance. The ability to absorb rerouted data without ejecting it from the network is critical in massively parallel computing systems. Optical technology is a promising solution for internode communication with extraordinarily quick response time supporting enormous bandwidth. To adopt it in multiprocessor systems, efficient routing techniques are needed. We adapt self-routing strategies for all-optical packet routing in 3D mesh networks and investigate the percolation properties. To achieve percolation routing, we incorporate the features inherent in optics to achieve decoding and routing capability in real time. The objective is to develop a dynamic communication environment that adapts and evolves with a high density of missing units or nodes, and by employing analytical, experimental, and simulation methods, show that optical interconnection in a dense 3D system reduces considerably this percolation problem. (c) 2005 Optical Society of America.

关键词： Network topology Optical components Optical interconnects Optical networks Packet switching routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An approximate performance model of a partially adaptive routing algorithm in hypercubes

引用

MICROPROCESSORS AND MICROSYSTEMS 1999年第4期23卷 185-190页

作者： Ould-Khaoua, M Univ Strathclyde Dept Comp Sci Glasgow G1 1XH Lanark Scotland

Although several partially adaptive routing algorithms have been proposed in the literature, there has been hardly any study that describes analytical models for these algorithms. This paper proposes an approximate analytical model for obtaining latency measures in the hypercube with partially adaptive routing, based on the direction restriction model proposed by Boura and Das (Y.M. Boura, C.R. Das, A class of partially adaptive routing algorithms for n-dimensional meshes, Proceedings of the 22nd International Conference on Parallel Processing, 1993, pp. 175-182). Simulation experiments reveal that the analytical model yields accurate latency results. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： multicomputers interconnection networks routing algorithms virtual channels message latency performance modelling

来源：评论

学校读者我要写书评

暂无评论

End-to-End Delay and Energy Efficient routing Protocol for Underwater Wireless Sensor Networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2014年第1期79卷 339-361页

作者： Ali, Tariq Jung, Low Tang Faye, Ibrahima Univ Teknol PETRONAS CIS Dept Tronoh Perak Malaysia Univ Teknol PETRONAS FAS Dept Tronoh Perak Malaysia Gordon Coll Dept Comp Sci Rawalpindi Pakistan Univ Teknol PETRONAS Tronoh Perak Malaysia

Providing better communication and maximising the communication performance in a Underwater Wireless Sensor Network (UWSN) is always challenging due to the volatile characteristics of the underwater environment. Radio signals cannot properly propagate underwater, so there is a need for acoustic technology that can support better data rates and reliable underwater wireless communications. Node mobility, 3-D spaces and horizontal communication links are some critical challenges to the researcher in designing new routing protocols for UWSNs. In this paper, we have proposed a novel routing protocol called Layer by layer Angle-Based Flooding (L2-ABF) to address the issues of continuous node movements, end-to-end delays and energy consumption. In L2-ABF, every node can calculate its flooding angle to forward data packets toward the sinks without using any explicit configuration or location information. The simulation results show that L2-ABF has some advantages over some existing flooding-based techniques and also can easily manage quick routing changes where node movements are frequent.

关键词： Propagation delays 3-D spaces routing algorithms UWSN L2-ABF Flooding angle Horizontal communication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：