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

21st International Conference on Transparent Optical Networks, ICTON 2019

作者： Panahi, Nogol Careglio, Davide Pareta, Josep Solé Advanced Broadband Communications Centre Universitat Politècnica de Catalunya Barcelona08034 Spain

ISBN: (纸本)9781728127798

The aim of this paper is to move away from today's multi-tier, manually operated, and performance limited Data Centre Network (DCN) towards more scalable, flexible, and optimized architecture of tomorrow. We propose a new hybrid optical DCN architecture capable of providing a fully optical interconnection path from server to server within and between racks utilizing fast packet switching at the aggregation layer and high-capacity and low latency circuit switching at the core layer. We have built the DCN control plane upon the Software Defined Networks (SDN) paradigm to leverage the added value of emerging optical technologies for providing flexible and programmable heterogeneous IT and network services. Dynamicity, flexibility, and resiliency are combined in the proposed infrastructure to offer advanced services to the data centre providers in order to fulfil the requirements of the upcoming applications. © 2019 IEEE.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Influence of Node Reliability on Data Exchange Efficiency in Distributed Monitoring Systems with Dynamic Topology

Influence of Node Reliability on Data Exchange Efficiency in...

引用

Systems of Signals Generating and Processing in the Field of on Board Communications

作者： V. V. Borodin A. M. Petrakov V. A. Shevtsov Moscow Aviation Institute (National Research University) Moscowy Russia

ISBN: (数字)9781728147727

ISBN: (纸本)9781728147734

Dynamic routing protocols transmit routing information in a finite time, resulting in errors in determining the optimal packet route. As a consequence, the efficiency of data exchange may deteriorate, for example, increasing the time spent on the network packets. The aim of the work is to study the behavior of the network in the case of unpredictable topology changes caused by sudden multiple failures of network equipment. The solution is carried out with the help of a specialized simulation model that allows you to track the change in network parameters in the process of its operation. Simulation showed that equipment failures lead to a qualitatively new network behavior, for the characteristics of which, along with the traditional indicator “packet delivery time”, two characteristics are additionally defined: “the proportion of lost packets” and “the probability of packet looping”. A comparative analysis of several variants of the implementation of routing algorithms using multi-step and one-step metrics is performed and the conditions for choosing the optimal parameters of routing process control are determined. The results of the research allow us to determine the requirements for the speed of transmission of route information, characteristics of route labels and access control parameters depending on the network topology.

关键词： mobile communication networks routing algorithms networks with dynamic topology reliability of network nodes network fault tolerance routing algorithms Mobile communications networks data exchange Packet Fault tolerance transmission speed Network topology Equipment Failure network parameters optimal parameter topology

来源：评论

学校读者我要写书评

暂无评论

A Novel routing Scheme for Creating Opportunistic Context-Virtual Networks in IoT Scenarios

引用

SENSORS 2019年第8期19卷 1875.-1875.页

作者： Galan-Jimenez, Jaime Berrocal, Javier Garcia-Alonso, Jose Jesus Azabal, Manuel Univ Extremadura Dept Comp & Telemat Syst Engn Sch Technol Avda Univ S-N Caceres 10003 Spain

The massive amount of traffic required by the emerging Internet of Things (IoT) paradigm can be supported by the imminent arrival of 5G next-generation networks. However, the limited capacity of resources in IoT nodes, e.g., battery lifetime or buffer space, opens a challenge to be taken into account when proposing new routing solutions on IoT scenarios with intermittent connectivity. In this paper, we propose the concept of Opportunistic Context-Virtual Networks (OCVNs). The novelty of this approach is to create virtual groups of nodes that share interests in common for routing purposes. Therefore, only the nodes that are interested in the content of the messages that are flowing throughout the network are used as relaying nodes, providing their own resources for the sake of the communication. By leveraging the use of store-carry-and-forward mechanisms, a novel routing algorithm is proposed and evaluated over two realistic scenarios. Experimental results reveal that our solution outperforms other well-known opportunistic routing algorithms in terms of delivery probability and overhead ratio, while resource usage of relaying nodes is significantly reduced.

关键词： opportunistic networks Internet of Things routing algorithms contextual information

来源：评论

学校读者我要写书评

暂无评论

Surrogate-assisted microscopic traffic simulation-based optimisation of routing parameters

引用

International Journal of Simulation and Process Modelling 2019年第3期14卷 223-233页

作者： Werth, Bernhard Pitzer, Erik Backfrieder, Christian Ostermayer, Gerald Affenzeller, Michael Heuristic and Evolutionary Algorithms Laboratory University of Applied Sciences Upper Austria Hagenberg Austria Institute for Formal Models and Verification Johannes Kepler University Linz Austria Research Group Networks and Mobility University of Applied Sciences Upper Austria Hagenberg Austria

Reactive and predictive routing algorithms have to work fast and reliably for a large number of traffic participants. Therefore, simple rules and thresholds guide the routing decisions rather than extensive data collection and machine learning. In this paper, we optimise some of the thresholds governing the behaviour of a reactive and predictive routing algorithm by using the microscopic traffic simulator TraffSim. Microscopic traffic simulation is more exact than its macroscopic counterpart and very well suited to test the efficiency of a reactive and predictive routing algorithm. Unfortunately, it is also tremendously more computationally expensive, impairing the applicability of 'conventional' heuristic optimisation techniques like genetic algorithms or evolution strategies. Extensive use of surrogate models in an optimisation procedure is a promising alternative. Several variations of the efficient global optimisation (EGO) algorithm are tested and compared. Furthermore, a new type of surrogate model geared towards the parameter optimisation is presented. Copyright © 2019 Inderscience Enterprises Ltd.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Pfara: A platoon forming and routing algorithm for same-day deliveries

arXiv

引用

arXiv 2019年

作者： Sebe, Sînziana-Maria Müller, Jörg P. Institute of Informatics Clausthal University of Technology Clausthal-Zellerfeld Germany

Platoons, vehicles that travel very close together acting as one, promise to improve road usage on freeways and city roads alike. We study platoon formation in the context of same-day delivery in urban environments. Multiple self-interested logistic service providers (LSP) carry out same-day deliveries by deploying autonomous electric vehicles that are capable of forming and traveling in platoons. The novel aspect that we consider in our research is heterogeneity of platoons in the sense that vehicles are equipped with different capabilities and constraints, and belong to different providers. Our aim is to examine how these platoons can form and their potential properties and benefits. We present a platoon forming and routing algorithm, called PFARA, that finds longest common routes for multiple vehicles, while also respecting vehicle preferences and constraints. PFARA consists of two parts, a speed clustering step and a linear optimisation step. To test the approach, a simulation was used, working with realistic urban network data and background traffic models. Our results showed that the performance of our approach is comparable to a simple route-matching one, but it leads to better utility values for vehicles and by extension the LSPs. We show that the grouping provided is viable and provides benefits to all vehicles participating in the platoon. © 2019, CC BY-NC-SA.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Probability Prediction routing Scheme in Urban DTNs

An Adaptive Probability Prediction Routing Scheme in Urban D...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Zhan Wen Xianghong Tang Xiaoyan Huang Tingwei Fu Jianwei Liu Wenzao Li School of Communication Engineering Chengdu University of Information Technology China Mobile Packet Core Department AT&T Inc USA School of Control Engineering Chengdu University of Information Technology China Date Center Chengdu Xingshu Reconnaissance Infrastructure Engineering Company China School of Computing Science Simon Fraser University Canada

ISBN: (纸本)9781728125848

Most existing DTN routing algorithms can't show efficient network performance. Prophet is a routing protocol widely used for DTNs. The delivery predictability of active nodes will obviously reduce with the same speed as less active nodes. In this paper, we propose an Adaptive Probability Prediction routing (APPR) approach, which can dynamically adjust the aging factor based on the active degree of nodes. Leveraging the APPR approach, the delivery predictability of each node can be reduced in different speed if the node does not encounter the other node. Furthermore, when two nodes encounter, the forward decision depends on the distance between each node to the destination node, if the delivery predictabilities of encountered nodes are similar. Compared with the traditional Prophet, simulation results demonstrate the proposed APPR approach can significantly improve successful delivery ratio, reduce overhead ratio and the average latency.

关键词： Probability prediction Adaptive probability routing algorithm Delay tolerant network routing algorithms Line of nodes active nodes Ganglia Obstetric Delivery Network routing Self tuning

来源：评论

学校读者我要写书评

暂无评论

A Cluster-Based Adaptive routing Algorithm for Underwater Acoustic Sensor Networks

A Cluster-Based Adaptive Routing Algorithm for Underwater Ac...

引用

International Conference on Intelligent Computing, Automation and Systems (ICICAS)

作者： Zhiqiang Zou Xiangyu Lin Jian Sun Nanjing University of Posts and Telecommunications Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing

ISBN: (数字)9781728161068

ISBN: (纸本)9781728161075

Underwater acoustic sensor networks (UASNs) have attracted much attention in both the academic and industrial fields. routing design of a UASN is an important part of the research, yet routing algorithms with low energy consumption and high data delivery ratios are not established completely. This paper proposed the Cluster-Based Adaptive routing Algorithm (CBAR) to fulfill the demands of large-scale underwater sensor networks. It optimized the network architecture by introducing the concept of a cluster in cellular wireless communication. Inspired by Focus Beam routing and Hop-By-Hop Dynamic Addressing routing protocol, the CBAR algorithm is designed to achieve better performance in large-scale UASNs. In CBAR, the format of transmitting data packets is simplified to suit the clustered network architecture and two adaptive methods are included: dynamic routing updates to adapt to the characteristics of the underwater environment, and power control to reduce energy consumption in the routing process. The result of simulation shows that the CBAR performs better than Focus Beam routing and Distributed Underwater Clustering Scheme in terms of energy consumption and data delivery ratio, because CBAR can significantly reduce the energy consumption of the network and improve the life cycle of nodes with an optimal data delivery ratio.

关键词： cellular radio routing protocols telecommunication power management underwater acoustic communication wireless sensor networks routing protocols underwater acoustic communication Wireless sensor networks energy consumption routing algorithms cellular radio NETWORK STRUCTURE acoustic transducers Underwater Simulation results Wet underwater environment data packets Dynamic routing

来源：评论

学校读者我要写书评

暂无评论

Capsule networks need an improved routing algorithm

arXiv

引用

arXiv 2019年

作者： Paik, Inyoung Kwak, Taeyeong Kim, Injung Deep Bio Inc. Seoul Korea Republic of Handong Global University Pohang Korea Republic of

In capsule networks, the routing algorithm connects capsules in consecutive layers, enabling the upper-level capsules to learn higher-level concepts by combining the concepts of the lower-level capsules. Capsule networks are known to have a few advantages over conventional neural networks, including robustness to 3D viewpoint changes and generalization capability. However, some studies have reported negative experimental results. Nevertheless, the reason for this phenomenon has not been analyzed yet. We empirically analyzed the effect of five different routing algorithms. The experimental results show that the routing algorithms do not behave as expected and often produce results that are worse than simple baseline algorithms that assign the connection strengths uniformly or randomly. We also show that, in most cases, the routing algorithms do not change the classification result but polarize the link strengths, and the polarization can be extreme when they continue to repeat without stopping. In order to realize the true potential of the capsule network, it is essential to develop an improved routing algorithm. Copyright © 2019, The Authors. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Local routing in sparse and lightweight geometric graphs

arXiv

引用

arXiv 2019年

作者： Ashvinkumar, Vikrant Gudmundsson, Joachim Levcopoulos, Christos Nilsson, Bengt J. Van Renssen, André University of Sydney Australia Lund University Sweden Malmö University Sweden

Online routing in a planar embedded graph is central to a number of fields and has been studied extensively in the literature. For most planar graphs no O(1)-competitive online routing algorithm exists. A notable exception is the Delaunay triangulation for which Bose and Morin [11] showed that there exists an online routing algorithm that is O(1)-competitive. However, a Delaunay triangulation can have Ω(n) vertex degree and a total weight that is a linear factor greater than the weight of a minimum spanning tree. We show a simple construction, given a set V of n points in the Euclidean plane, of a planar geometric graph on V that has small weight (within a constant factor of the weight of a minimum spanning tree on V ), constant degree, and that admits a local routing strategy that is O(1)-competitive. Moreover, the technique used to bound the weight works generally for any planar geometric graph whilst preserving the admission of an O(1)-competitive routing strategy. Copyright © 2019, The Authors. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An energy efficient multiple mobile sinks based routing algorithm for wireless sensor networks 1

An energy efficient multiple mobile sinks based routing algo...

引用

1st International Conference on Functional Materials and Chemical Engineering (ICFMCE)

作者： Zhong, Peijun Ruan, Feng ZTEsoft Technol Co Ltd Nanjing 210012 Jiangsu Peoples R China Nanjing Univ Informat Sci & Technol Sch Informat & Control Nanjing 210044 Jiangsu Peoples R China

With the fast development of wireless sensor networks (WSNs), more and more energy efficient routing algorithms have been proposed. However, one of the research challenges is how to alleviate the hot spot problem since nodes close to static sink (or base station) tend to die earlier than other sensors. The introduction of mobile sink node can effectively alleviate this problem since sink node can move along certain trajectories, causing hot spot nodes more evenly distributed. In this paper, we mainly study the energy efficient routing method with multiple mobile sinks support. We divide the whole network into several clusters and study the influence of mobile sink number on network lifetime. Simulation results show that the best network performance appears when mobile sink number is about 3 under our simulation environment.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：