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

Robust and risk-averse routing algorithms in road networks

IFAC Proceedings Volumes 2011年第1期44卷 9512-9517页

作者： E. Crisostomi S. Kirkland R. Shorten Department of Energy and Systems Engineering University of Pisa Largo Lucio Lazzarino 1 56127 Pisa Italy Hamilton Institute National University of Ireland – Maynooth (NUIM) Co. Kildare Ireland

Abstract Recent works have shown that Markov chain theory can be used to model and realistically describe road network dynamics. Properties of the Markov transition matrix such as the Perron eigenvector, the second eigenvalue, and the Kemeny constant have nice corresponding interpretations in the road network counterparts. Our objective in this paper is to use this modelling paradigm to develop new traffic management applications. In particular, our framework is particularly suited to routing algorithm development, offering new approaches to this old problem. This is the focus of the present paper.

关键词： Markov Chains routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Using the linking model to understand the performance of DHT routing algorithms

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2004年 3358卷 544-549页

作者： Zou, Futai Cheng, Shudong Ma, Fanyuan Zhang, Liang Tang, Junjun Department of Computer Science and Engineering Shanghai Jiao Tong University 200030 Shanghai China

The various proposed DHT routing algorithms embody different underlying routing geometries such as ring, hypercube etc. The routing performance depends on the geometry. In this paper, we anatomize the construction of the geometry and propose the linking model for the geometry to understand the performance of DHT routing algorithms. The effect of the different types of links on the performance is analyzed. Especially, randomized long link is considered as a new approach to optimize the performance. Our experiments show that the routing performance is greatly affected by the links, and the performance of CAN is improved with additional links. © Springer-Verlag Berlin Heidelberg 2004.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Evaluating the Quality of Service of Opportunistic Mobile Ad Hoc Network routing algorithms on Real Devices: A Software-Driven Approach

SSRN

引用

SSRN 2024年

作者： Jesús-Azabal, Manuel García-Alonso, José Galán-Jiménez, Jaime Departamento de Ingeniería Sistemas Informáticos y Telemáticos Universidad de Extremadura Avenida de Elvas S/N Badajoz Extremadura06006 Spain

Opportunistic Mobile Ad Hoc Networks (MANETs) offer a versatile solution in contexts where the Internet is unavailable. These networks facilitate transmissions between endpoints using a store-carry-forward strategy, allowing information to be stored during periods of disconnection. Consequently, selecting the next hop in the routing process becomes a significant challenge for nodes, particularly due to its impact on Quality of Service (QoS). routing strategies are therefore crucial in opportunistic MANETs, but their deployment and evaluation in real scenarios can be challenging. In response to this context, this paper introduces a monitoring software-driven tool designed to evaluate the QoS of routing algorithms in physical opportunistic MANETs. The implementation and its components are detailed, along with a case study and the outcomes provided by an implementation of the proposed solution. The results demonstrate the effectiveness of the proposed tool in enabling the analysis of routing protocols in real scenarios, highlighting significant differences with simulation results: mobility patterns in simulations tend to be inaccurate and overly optimistic, leading to a higher delivery probability and lower latency than what is observed in the real testbed. © 2024, The Authors. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Novel Localized QoS routing algorithms

Novel Localized QoS Routing Algorithms

引用

IEEE Malaysia International Conference on Communications

作者： Turki A. Al Ghamdi Michel E. Woodward Department of Computing University of Bradford

ISBN: (纸本)9781424455317;9781424455324

Quality of service routing has recently been improved by using localized routing rather than global state information. The traditional global method is associated with many problems which are avoided by using the Localized Quality of Service (QoS) routing, where the source nodes using statistics which is collected locally. Three new localized routing algorithms called Highest Minimum Bandwidth routing (HMB), Best Reserved Bandwidth routing (BRB) and Highest Link Average Bandwidth History (HLABH) are introduced in this paper. The selection of disjoint paths and recalculation of the set of candidate paths were used in our new algorithms and also applied on the existing algorithm Credit Based routing (CBR). The new algorithms are compared under different traffic loads and network topologies to the existing localized QoS routing algorithm CBR, and show better performance without undue increase in complexity. Novel algorithms act perfectly using residual bandwidth as a path selection metric, were found to decrease the blocking probability.

关键词： algorithms Localized routing Quality of Service Quality of service routing algorithms Transportation load Network routing algorithms recalculation Network topology Bandwidth Blocking probability

来源：评论

学校读者我要写书评

暂无评论

Efficient Distributed Decomposition and routing algorithms in Minor-Free Networks and Their Applications

arXiv

引用

arXiv 2023年

作者： Chang, Yi-Jun National University of Singapore Singapore

In the LOCAL model of distributed computing, low-diameter decomposition is an extremely useful tool in designing algorithms, as it allows us to shift from the general graph setting to the low-diameter graph setting, where brute-force information gathering can be done efficiently. Chang and Su [PODC 2022] showed that any high-conductance network excluding a fixed minor contains a high-degree vertex v*, so the entire graph topology can be gathered to v* efficiently in the CONGEST model using expander routing. Therefore, in networks excluding a fixed minor, many problems that can be solved efficiently in LOCAL via low-diameter decomposition can also be solved efficiently in CONGEST via expander decomposition. In this work, we show improved decomposition and routing algorithms for networks excluding a fixed minor. We define an (ǫ, D, T)-decomposition of G = (V, E) as a partition of V into clusters of diameter at most D with at most ǫ|E| inter-cluster edges such that information gathering in each cluster can be done in T rounds in parallel. We show that an (ǫ, D, T)-decomposition with D = O(ǫ−1) and T = min n 2O(log2 1 ǫ) · O (log ∆), poly(ǫ−1, log ∆) o can be computed deterministically in O(ǫ−1 log∗ n) + min n 2O(log2 1 ǫ) · O (log ∆), poly(ǫ−1, log ∆) o rounds in networks excluding a fixed minor in the CONGEST model. Our algorithm has a wide range of applications, including the following results in CONGEST. • A (1 − ǫ)-approximate maximum independent set in a network excluding a fixed minor can be computed deterministically in O(ǫ−1 log∗ n) + poly(ǫ−1) rounds, nearly matching the Ω(ǫ−1 log∗ n) lower bound of Lenzen and Wattenhofer [DISC 2008]. • Property testing of any additive minor-closed property can be done deterministically in O(log n) rounds if ǫ is a constant or O(ǫ−1 log n) + poly(ǫ−1) rounds if ∆ is a constant, nearly matching the Ω(ǫ−1 log n) lower bound of Levi, Medina, and Ron [PODC 2018]. Copyright © 2023, The Authors. All rights reserved.

关键词： routing algorithms

来源：评论

学校读者我要写书评

暂无评论

An Ant Colony System Based Energy Prediction routing algorithms for Wireless Sensor Networks

An Ant Colony System Based Energy Prediction Routing Algorit...

引用

The 4th International Conference on Wireless Communications, Networking and Mobile Computing(第四届IEEE无线通信、网络技术及移动计算国际会议)

作者： Zhen-wei Shen Yi-hua Zhu Xian-zhong Tian Yi-ping Tang College of Information Engineering Zhejiang University of Technology Hangzhou Zhejiang China 310032

routing algorithms play important roles in wireless sensor networks (WSNs). Usually, nodes in a WSN run on battery with limited power. Hence, routing with efficient power consumption is becoming a critical issue for WSNs. In this paper, a routing algorithm, referred to as Energy Prediction and Ant Colony Optimization routing (EPACOR), is proposed. In the EPACOR, when a node needs to deliver data to the sink, ant colony systems are used to establish the route with optimal or sub-optimal power consumption, and meanwhile, learning mechanism is embedded to predict the energy consumption of neighboring nodes when the node chooses a neighboring node added to the route. The EPACOR is compared both with the MST (Minimal Spanning Tree)-based routing algorithm following the Prim algorithm and with the Least Energy Tree (LET)-based routing algorithm following the Dijkstra algorithm. Numeric experiment shows that the EPACOR has the best network lifetime among the three while keeping energy consumption in low level.

关键词： Wireless Sensor Networks network lifetime power saving routing algorithms ant colony algorithms

来源：评论

学校读者我要写书评

暂无评论

Survey on routing algorithms in opportunistic networks

Survey on routing algorithms in opportunistic networks

引用

International Conference on Computer Communication and Informatics (ICCCI)

作者： B. Poonguzharselvi V. Vetriselvi Department of Computer Science and Engineering Anna University Chennai India

ISBN: (纸本)9781467329064

Opportunistic network are one of the most interesting evolutions of MANETs. In opportunistic network, mobile nodes are enabled to communicate with each other even if a route connecting to them never exists. Therefore, in this network, message delivery relies on opportunistic routing where nodes use store-carry-and-forward paradigm to route the messages. Routes are built dynamically, while messages are routed between the sender and the destination. Any possible node can opportunistically be used as a next hop, if it can bring the message closer to the final destination. These requirements make opportunistic network a challenging research field. In this paper we survey the existing routing algorithms in opportunistic network. The routing algorithms are classified based on their routing behaviour and comparisons among these algorithms are also presented in this paper.

关键词： Opportunistic network routing store-carryforward flooding prediction context. routing algorithms Network routing Flood Network Messages Mobile ad hoc networks Routes destination

来源：评论

学校读者我要写书评

暂无评论

A study on thermal impacts of routing algorithms for 3D mesh-based network-on-chip

A study on thermal impacts of routing algorithms for 3D mesh...

引用

IET International Conference on Information Science and Control Engineering 2012 (ICISCE 2012)

作者： Menwang Xie Min Yin Sha Li Yao Li University of Science and Technology of China Hefei China

ISBN: (纸本)9781629939254

Three-dimensional networks-on-chip (NoC) is proposed to achieve better communication performance, higher device density and lower power consumption. However, thermal issues resulted by stacked high power density architecture are significant challenges for design of 3D NoC architectural systems. In this paper, we explore the thermal impacts of routing algorithms for 3D mesh-based NoC architecture. The thermal impacts of routing algorithms are analyzed, and distinct temperature distributions caused by routing algorithms are discussed. The 3D Odd-Even routing algorithm with random selection scheme is compared with 3D Odd-Even routing algorithm with thermal-aware selection scheme. The experimental results show that 3D Odd-Even routing algorithm with thermal-aware selection scheme achieves higher throughput by 19% under 95°C temperature limits.

关键词： Thermal impact 3D network-on-chip Mesh routing algorithm routing algorithms Mesh Mesh Thermal Network routing algorithms Randomisation Three Dimensions

来源：评论

学校读者我要写书评

暂无评论

Effective routing algorithms Based on Node Usage Probability from a Complex Network Perspective

Effective Routing Algorithms Based on Node Usage Probability...

引用

IEEE International Symposium on Circuits and Systems

作者： Jiajing Wu Chi K. Tse Francis C. M. Lau Department of Electronic and Information Engineering The Hong Kong Polytechnic University Kowloon Hong Kong

ISBN: (纸本)9781479934331

In this paper, we study the traffic performance in communication networks from a complex network perspective. The node usage probability is an effective metric for characterizing the traffic load distribution and how frequently a node is chosen to relay packets in a network. Based on the concept of node usage probability, we propose an effective routing strategy to maintain balanced traffic loads in the network nodes by avoiding overuse of certain nodes. Simulation results show that routing algorithms based on the proposed strategy can effectively balance traffic loads and improve the overall traffic performance.

关键词： routing algorithms Transportation load complex networks Line of nodes network node networks(communications) Perspective

来源：评论

学校读者我要写书评

暂无评论

A Distributed Community-based routing algorithms for Opportunistic Networks

A Distributed Community-based Routing Algorithms for Opportu...

引用

2017 2nd International Conference on Automation,Mechanical Control and Computational Engineering(AMCCE 2017)

作者： Ren Zhi Cao HongWei Zhang Yong Zhao YaNan School of Chongqing University of Posts and Telecommunications

According to the problem that there are redundant control overheads in community partitioning phase and the large transmission delay and the low success rate in transmission phase in the community-based opportunistic network,we propose EDCRA(Efficient Distributed Community-based routing algorithms for opportunistic networks).By distinguishing the community of the encounter node is single-node community or multi-node community,EDCRA simplify the interaction flow of the encounter node merging into other community in the community partitioning *** through the efficient cross-layer listening mechanism,the node carrying message find eligible forwarding nodes in its neighbor nodes in the data transmission phase,so that the message can be forwarded to the destination community more *** results show that the performance of EDCRA algorithm is higher than that of CR and Bubble Rap in terms of control overhead,average end-to-end delay and transmission success rate.

关键词： Opportunistic networks routing algorithms distributed communities message transmission cross-layer listening mechanism

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：