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

European Conference and Exhibition on Optical Communication

作者： Ioan Turus Josva Kleist Anna Manolova Fagertun Lars Dittmann NORDUnet A/S Department of Photonics Engineering Technical University of Denmark

We evaluate OSPF-TE extensions within GMPLS framework in support of flex-grid optical networks. Based on OSPF-TE LSAs, two routing strategies are proposed achieving up to 15% and 70% respectively improved blocking rat... 详细信息

ISBN: (纸本)9781629935935

关键词： GMPLS routing algorithms Dynamic routing Support Fiber optic networks

来源：评论

学校读者我要写书评

暂无评论

Whole Packet Forwarding: Efficient Design of Fully Adaptive routing algorithms for Networks-on-Chip

Whole Packet Forwarding: Efficient Design of Fully Adaptive ...

引用

18th IEEE International Symposium on High-Performance Computer Architecture (HPCA)

作者： Ma, Sheng Jerger, Natalie Enright Wang, Zhiying Natl Univ Def Technol Sch Comp Changsha Hunan Peoples R China Univ Toronto Dept Elect & Comp Engn Toronto ON Canada

ISBN: (纸本)9781467308243;9781467308267

routing algorithms for networks-on-chip (NoCs) typically only have a small number of virtual channels (VCs) at their disposal. Limited VCs pose several challenges to the design of fully adaptive routing algorithms. First, fully adaptive routing algorithms based on previous deadlock-avoidance theories require a conservative VC re-allocation scheme: a VC can only be re-allocated when it is empty, which limits performance. We propose a novel VC reallocation scheme, whole packet forwarding (WPF), which allows a non-empty VC to be re-allocated. WPF leverages the observation that the majority of packets in NoCs are short. We prove that WPF does not induce deadlock if the routing algorithm is deadlock-free using conservative VC re-allocation. WPF is an important extension of previous deadlock-avoidance theories. Second, to efficiently utilize WPF in VC-limited networks, we design a novel fully adaptive routing algorithm which maintains packet adaptivity without significant hardware cost. Compared with conservative VC re-allocation, WPF achieves an average 88.9% saturation throughput improvement in synthetic traffic patterns and an average 21.3% and maximal 37.8% speedup for PARSEC applications with heavy network loads. Our design also offers higher performance than several partially adaptive and deterministic routing algorithms.(1)

关键词： routing algorithms e-bank vital capacity measurement Packet network-on-chip Self tuning traffic patterns

来源：评论

学校读者我要写书评

暂无评论

Improved clustering optimization algorithm for wireless sensor network energy balance

引用

International Journal of Performability Engineering 2019年第5期15卷 1445-1452页

作者： Li, Jinyu Li, Jun School of Electronic and Information Engineering Lanzhou Jiaotong University Lanzhou730070 China

To get over the limited energy of nodes and unbalanced energy consumption in wireless sensor networks (WSN), this paper puts forward a WSN clustering routing algorithm based on weight function timing. The algorithm was applied to build the weight function between node aggregation degree and residual energy. Then, the weight function was based on producing the timing time for all nodes. Both the iteration number and the energy consumption were reduced in cluster head selection. At the same time, the node energy consumption rate and the distance from the node to the sink node were taken into consideration. Next, the reasonable cluster head was chosen according to each node's weight function value and the timing time. In the periodic clustering process, the proposed algorithm removes the aggregation degree exchange between the nodes, thus reducing the network traffic and lowering the network energy consumption. Simulation results show that the algorithm achieves excellent cluster convergence and stable cluster size. © 2019 Totem Publisher, Inc. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Estimating Energy Consumption for routing algorithms

Estimating Energy Consumption for Routing Algorithms

引用

IEEE Intelligent Vehicles Symposium (IV)

作者： Kraschl-Hirschmann, Karin Fellendorf, Martin Graz Univ Technol Inst Highway Engn & Transport Planning A-8010 Graz Austria

ISBN: (纸本)9781467321181

Due to increased public discussion on global climate change and increased awareness of environmental issues in general, a variety of transport related strategies are being developed to reduce the energy consumption of road travel. Pre-trip journey planners and on-trip navigation systems are widely used to identify optimal routes. Travel time, trip distance and travel cost are usually used as criteria to search for the best route and suitable alternatives. However, energy use could also be used as a criterion in these systems to identify energy minimizing routes will be one measure to reduce fuel consumption. In order to identify these "eco-friendly" routes, the energy consumption for each link of a network must be computed quickly and precisely. This paper presents an approach for calculating link energy consumption based on the actual power needed to overcome the driving resistance for each link using link travel speeds and v/c-ratios. The proposed method can be embedded in routing algorithms and be used as one component in the optimization of the route algorithm's generalized cost function.

关键词： energy consumption routing algorithms driving resistance active power travel cost Environmental issues Fuel consumption energy use Routes road travel

来源：评论

学校读者我要写书评

暂无评论

Maze routing algorithms with Exact Matching Constraints for Analog and Mixed Signal Designs 12

Maze Routing Algorithms with Exact Matching Constraints for ...

引用

IEEE/ACM International Conference on Computer-Aided Design (ICCAD)

作者： Ozdal, Muhammet Mustafa Hentschke, Renato Fernandes Intel Corp Strateg CAD Labs Hillsboro OR 97124 USA Intel Corp Core CAD Technol Hillsboro OR 97124 USA

ISBN: (纸本)9781450315739

Design automation for analog and mixed signal designs has become more important, as analog and digital components are integrated on the same system-on-chips (SOCs). Exact route matching is an important constraint for analog and mixed signal designs with non-uniform metal stacks. In this paper, we propose a constrained-path based maze routing algorithm that can handle exact matching constraints for multiple nets. We also propose a scalable framework that utilizes the proposed maze routing algorithm for realistic problem sizes. Compared to the pattern routing algorithms proposed recently [8], our algorithms allow a more thorough exploration of the solution space by allowing bends to be inserted to avoid congested regions. The experimental study demonstrates that the proposed algorithm leads to significant reductions in congestion costs compared to the previous algorithm.

关键词： Signal design Solution space Analog routing algorithms Mazes Computer-Aided Design Analog Exact

来源：评论

学校读者我要写书评

暂无评论

The Evaluation of Multicast routing algorithms with Delay Constraints in Mesh Networks

The Evaluation of Multicast Routing Algorithms with Delay Co...

引用

8th International Symposium on Communication Systems, Networks & Digital Signal Processing (CSNDSP)

作者： Piechowiak, Maciej Zwierzykowski, Piotr Univ Econ Inst Informat & Mechatron Bydgoszcz Poland Poznan Univ Tech Chair Commun & Comp Networks Poznan Poland

ISBN: (纸本)9781457714733

Wireless mesh networks are playing an important role in extending the implementation of traditional wireless infrastructure (cellular networks, wireless LAN, etc). routing design in mesh networks is a challenge because of limited node resources. Thus efficient data transmission techniques like multicasting regarding quality of service requirements are under scrutiny. The article analyzes and explores the performance of multicast heuristic algorithms and quality of multicast trees in mesh networks.

关键词： Mesh networks routing algorithms Multicast Quality of service Wireless mesh networks PASSAGE PLANNING

来源：评论

学校读者我要写书评

暂无评论

An Energy-Efficient routing Algorithm in Green Networks

引用

Jisuanji Xuebao/Chinese Journal of Computers 2018年第11期41卷 2612-2623页

作者： Chen, Ruo-Bin Wang, Xing-Wei Ma, Lian-Bo Huang, Min Department of Software Northeastern University Shenyang110004 China Department of Information Science and Engineering Northeastern University Shenyang110004 China

In recent years, with the rapid development of internet technologies, the increasing demand of customers on the network causes the expanded scale of internet. Current networks are typically over-provisioned to support the maximum number of customers whilst meeting their Quality of Service. This redundant design, however, has led to greenhouse gas emissions, and the increasingly serious problem of energy consumption. Therefore, the concept of the Green Networks is proposed to save energy consumption. Currently, the study on Green Networks has been the focus of domestic and international attention. This paper firstly analyzes the research prospects of the Green Networks. We focus our problem on the routing algorithm in backbone based on bundle links. According to our scenarios, network model, parameters of power consumption and the mathematical model are designed. Through the analysis of the current algorithms, we find that some of current algorithms are easy to trap in local optimum which affects the energy conservation results while others cost lots of time on finding paths. Secondly, an energy-efficient routing algorithm is proposed. The algorithm considers the problem of shutting down a subset of bundled link during the off-peak period, and make part of the ports, line cards and chassis to sleep. The main idea of the algorithm is to route each requirement in order. In the process of finding path, we try to choose the occupied path to integrate the flow. Thirdly, the algorithm is improved by the routing strategy. The improved algorithm is fast while avoiding the shortcoming that the greedy algorithm is easy to trap in local optimum. After that, we analyze the time complexity of algorithm. It shows that the proposed algorithm has low time complexity, and can also be implemented easily. Finally, we evaluate our algorithm based on the CERNET2 network topology and the actual network traffic. The results show that the proposed algorithm can reduce the energy consumption

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

ROTOR-routing algorithms DESCRIBED BY CA-w

ROTOR-ROUTING ALGORITHMS DESCRIBED BY CA-w

引用

Summer Solstice 2011 International Conference on Discrete Model of Complex Systems

作者： Hoffmann, Rolf Tech Univ Darmstadt FG Rechnerarchitektur D-64289 Darmstadt Germany

The GCA-w model (Global Cellular Automata with write access) is an extension of the GCA (Global Cellular Automata) model, which is based on the cellular automata model (CA). Whereas the CA model uses static links to local neighbors, the GCA model uses dynamic links to potentially global neighbors. The GCA-w model is a further extension that allows modifying the neighbors' states. Thereby neighbors can dynamically be activated or deactivated. algorithms can be described more concisely and may execute more efficiently because redundant computations can be avoided. If the neighborhood of the GCA-w model is locally restricted, we will call the model "CA-w" (Cellular Automata with Write-access). Rotor-routing algorithms are good examples showing the usefulness of the CA-w model. The Propp-machine and the Chip-firing problem are first described by CA for comparison, and then by CA-w. It is shown that the CA-w descriptions are more concise, more "natural" compared to the CA descriptions, and more power saving because only the active cells have to be computed.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Call Capacity Model and QoS routing algorithms on Multi-Channel Multi-Radio Wireless Meshes

Call Capacity Model and QoS Routing Algorithms on Multi-Chan...

引用

18th Asia-Pacific Conference on Communications (APCC) - Green and Smart Communications for IT Innovation

作者： Kim, Sunghun Ji, Myungln Ma, Joong Soo Attached Inst ETRI Daejoen South Korea ETRI Daejoen South Korea Korea Adv Inst Sci & Technol Daejoen South Korea

ISBN: (纸本)9781467347280

The capacity of the conventional wireless mesh network (WMN) with single channel single radio is limited due to co-channel interference. To resolve this capacity limitation problem, multichannel multi-radio (MCMR) protocols have been proposed, and hybrid multi-channel protocol (HMCP) is a representative MCMR protocol. However, supporting delay sensitive realtime VoIP applications over high capacity MCMR-WMNs is still challenging problem. To support VoIP service over an MCMR WMN. we need the accurate call capacity model to estimate the feasible capacity region, and route computation algorithms for allocating the routes of voice calls within the feasible region to meet qnality-of-service (QoS) constraints and improve the call capacity. In this paper, we introduce a new voice call capacity model of HMCP on MCMR WMNs. Both experimental and simulation results demonstrate that the proposed call capacity model accurately estimates the voice call capacity for G.711 and G.729 codecs within 5% of the actual call capacity. Also, we propose two QoS routing algorithms for finding feasible routes to meet QoS constraints as well as to improve the call capacity of network by utilizing the proposed call capacity model (i.e., feasibility considerations). By extensive simulations, our proposed QoS routing algorithms effectively protect voice calls and increase the call capacity.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

The Evaluation of Unconstrained Multicast routing algorithms in Ad-Hoc Networks

The Evaluation of Unconstrained Multicast Routing Algorithms...

引用

19th International Conference on Computer Networks

作者： Piechowiak, Maciej Zwierzykowski, Piotr Kazimierz Wielki Univ Bydgoszcz Poland Poznan Univ Tech Poznan Poland

ISBN: (纸本)9783642312168

Wireless ad-hoc networks are playing an important role in extending the implementation of traditional wireless infrastructure (cellular networks, wireless LAN, etc). routing design in ad-hoc networks is a challenge because of limited node resources. Thus efficient data transmission techniques like multicasting are under scrutiny. The article analyzes and explores the performance of multicast heuristic algorithms without constraints and quality of multicast trees in ad-hoc networks and proves the thesis that well-known multicast heuristic algorithms designed for packet networks have a good performance in ad-hoc networks with grid structure.

关键词： ad-hoc networks multicast routing algorithms network topology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：