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

Rate-adaptive multipath routing: distributed, centralized, and hybrid architectures

NETWORKS 2015年第2期66卷 118-135页

作者： Nemeth, Gabor Retvari, Gabor Inter Univ Ctr Telecommun & Informat Debrecen Hungary Budapest Univ Technol & Econ Dept Telecommun & Media Informat H-1117 Budapest Hungary

With the increasing volume and volatility of Internet traffic, the need for adaptive routing algorithms has become compelling lately. An adaptive routing algorithm controls the rate at which traffic is placed on forwarding paths in concert with the actual user demands, making it possible to avoid congestion even when no information on expected traffic is available. In this article, we present a new model for rate-adaptive multipath routing, which allows one to analyze distributed, centralized, and hybrid routing architectures within a single framework, and to develop quantitative as well as qualitative arguments regarding their optimality, stability, and realizability. By a novel generalization of oblivious routing, we present a centralized algorithm with provable optimality, and we arrive at the conclusion that congestion can be completely eliminated even if routing decisions are completely precomputed. We find, although, that the complexity of the centralized scheme can become exponential. Therefore, we develop a hybrid distributed-centralized algorithm that combines the simplicity of distributed algorithms with the efficiency of centralized ones, and we provide numerical studies demonstrating that the hybrid scheme performs well in a broad selection of realistic scenarios. (c) 2015 Wiley Periodicals, Inc.

关键词： rate-adaptive routing multipath routing traffic engineering convex geometry centralized routing distributed routing hybrid architecture

来源：评论

学校读者我要写书评

暂无评论

distributed Tactical TE With Segment routing

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2024年第5期21卷 4974-4987页

作者： Medagliani, Paolo Martin, Sebastien Magnouche, Youcef Leguay, Jeremie Decraene, Bruno Huawei Technol Ltd Paris Res Ctr F-92100 Boulogne Billancourt France Orange Innovat Routing Dept F-92320 Chatillon France

Tactical Traffic Engineering (TE) solutions are a must to adapt traffic steering when unexpected congestions occur. While already available, centralized solutions to locally optimizes congested tunnels and links suffer from a slow reaction time of several minutes. To address this issue, we propose a distributed Congestion Mitigation (CM) mechanism that leverages Segment routing (SR) to offload traffic away from congested links using Unequal Cost Multi Paths (UCMP) over alternative paths. In this paper, we introduce an efficient algorithm for alternative paths' computation, and two methods to compute UCMP weights, depending on whether remote link loads are available or not. We show that the proposed path computation method is faster than a modified K-shortest path algorithm. For traffic splitting, we show that the knowledge of remote link loads and per-destination traffic is a key to mitigate congestions in loaded scenarios, approaching the results obtained with an optimal solution. However, when not available, a local solution can already mitigate congestions in lightly loaded scenarios.

关键词： Prevention and mitigation routing Load management Servers Costs Quality of service Optimization Segment routing congestion mitigation traffic engineering distributed routing

来源：评论

学校读者我要写书评

暂无评论

distributed Mobile Sink routing for Wireless Sensor Networks: A Survey

引用

IEEE COMMUNICATIONS SURVEYS AND TUTORIALS 2014年第2期16卷 877-897页

作者： Tunca, Can Isik, Sinan Donmez, M. Yunus Ersoy, Cem Bogazici Univ Comp Networks Res Lab Netlab Dept Comp Engn TR-34342 Istanbul Turkey

The concentration of data traffic towards the sink in a wireless sensor network causes the nearby nodes to deplete their batteries quicker than other nodes, which leaves the sink stranded and disrupts the sensor data reporting. To mitigate this problem the usage of mobile sinks is proposed. Mobile sinks implicitly provide load-balancing and help achieving uniform energy-consumption across the network. However, the mechanisms to support the sink mobility (e.g., advertising the location of the mobile sink to the network) introduce an overhead in terms of energy consumption and packet delays. With these properties mobile sink routing constitutes an interesting research field with unique requirements. In this paper, we present a survey of the existing distributed mobile sink routing protocols. In order to provide an insight to the rationale and the concerns of a mobile sink routing protocol, design requirements and challenges associated with the problem of mobile sink routing are determined and explained. A definitive and detailed categorization is made and the protocols' advantages and drawbacks are determined with respect to their target applications.

关键词： Mobile Sinks distributed routing Wireless Sensor Networks

来源：评论

学校读者我要写书评

暂无评论

Pre-computation based selective probing (PCSP) scheme for distributed quality of service (QoS) routing with imprecise state information

引用

JOURNAL OF COMMUNICATIONS AND NETWORKS 2006年第1期8卷 70-84页

作者： Lee, WI Lee, BG Seoul Natl Univ Sch Elect Engn Seoul 151742 South Korea

We propose a new distributed QoS routing scheme called pre-computation based selective probing (PCSP). The PCSP scheme is designed to provide an exact solution to the constrained optimization problem with moderate overhead, considering the practical environment where the state information available for the routing decision is not exact. It does not limit the number of probe messages, instead, employs a qualitative (or conditional) selective probing approach. It considers both the cost and QoS metrics of the least-cost and the best-QoS paths to calculate the end-to-end cost of the found feasible paths and find QoS-satisfying least-cost paths. It defines strict probing condition that excludes not only the non-feasible paths but also the non-optimal paths. It additionally pre-computes the QoS variation taking into account the impreciseness of the state information and applies two modified QoS-satisfying conditions to the selection rules. This strict probing condition and carefully designed probing approaches enable to strictly limit the set of neighbor nodes involved in the probing process, thereby reducing the message overhead without sacrificing the optimal properties. However, the PCSP scheme may suffer from high message overhead due to its conservative search process in the worst case. In order to bound such message overhead, we extend the PCSP algorithm by applying additional quantitative heuristics. Computer simulations reveal that the PCSP scheme reduces message overhead and possesses ideal success ratio with guaranteed optimal search. In addition, the quantitative extensions of the PCSP scheme turn out to bound the worst-case message overhead with slight performance degradation.

关键词： distributed routing quality of service (QoS) routing

来源：评论

学校读者我要写书评

暂无评论

Cluster based routing Scheme for distributed Regression in Wireless Sensor Networks: Gaussian Eliminations

引用

NEW GENERATION COMPUTING 2010年第2期28卷 121-128页

作者： Hou, Chaojun Guo, Xuemei Wang, Guoli Sun Yat Sen Univ Sch Informat Sci & Technol Guangzhou 510275 Guangdong Peoples R China

This paper addresses the issue of the in-network implementation of data regression in wireless sensor networks (WSNs). In particular, a cluster based routing scheme is proposed for achieving the distributed Gaussian elimination in solving the regression algebraic equation. In doing this, the tree structure is incorporated to coordinate the clusters so as to decouple the intersections with each other via a new message passing protocol. The cluster based routing scheme proposed here contributes not only to ease network topology management, but also to speed the convergence of distributed computation. Experimental results are reported to illustrate the validation of the proposed approach.

关键词： Clustering Data Modelling distributed routing Wireless Sensor Networks

来源：评论

学校读者我要写书评

暂无评论

DeepHop on Edge: Hop-by-hop routing by distributed Learning with Semantic Attention 20

DeepHop on Edge: Hop-by-hop Routing by Distributed Learning ...

引用

49th International Conference on Parallel Processing (ICPP)

作者： He, Bo Wang, Jingyu Qi, Qi Sun, Haifeng Zhuang, Zirui Liu, Cong Liao, Jianxin Beijing Univ Posts & Telecommun Beijing Peoples R China China Mobile Res Inst Beijing Peoples R China

ISBN: (纸本)9781450388160

Multi-access Edge Computing (MEC) and ubiquitous smart devices help serve end-users efficiently and optimally through providing emerging edge-deployed services. Meanwhile, heavy and time-varying traffic loads are produced in the edge network, so that an efficient traffic forwarding mechanism is required. In this paper, we propose a parallel and distributed learning approach, DeepHop, to adapt to the volatile environments and realize hop-by-hop routing. The Multi-Agent Deep Reinforcement Learning (MADRL) is used to alleviate the edge network congestion and maximize the utilization of network resources. DeepHop determines the routing among edge network nodes for heterogeneous types of traffic according to the current workload and capability. By joining with an attention mechanism, DeepHop obtains the semantics from the elements of the network state to help the agents learn the importance of each element on routing. Experiment results show that DeepHop achieves the increase of successfully transmitted packets by 15% compared with the state-of-the-art algorithms. Besides, DeepHop with an attention mechanism reduces convergence time by nearly half compared with the common-used structures of neural networks.

关键词： distributed routing wireless edge networks multi-agent reinforcement learning self-attention

来源：评论

学校读者我要写书评

暂无评论

A distributed Delay-Constraint routing Algorithm for satellite networks

A Distributed Delay-Constraint Routing Algorithm for satelli...

引用

4th International Conference on Microwave and Millimeter Wave Technology

作者： Wu, WJ Wang, ZY Guo, Q Harbin Inst Technol Commun Res Ctr Harbin 150001 Peoples R China

ISBN: (纸本)0780384016

With considering satellite networks' characteristic of few network nodes, limited on-board storage and processing ability etc., a distributed Delay-Constrained routing Algorithm (DDCRA) with mechanism of probe packet is proposed. Based upon strategy of distributed routing and Quality of Service (QoS), DDCRA reduces the complexity of algorithm so as to lower requirements for the on-board processing equipments. Comparing with the Minimum Delay routing Algorithm, better performances of DDCRA can be achieved.

关键词： distributed routing QoS satellite networks

来源：评论

学校读者我要写书评

暂无评论

routing and Scheduling in distributed Advance Reservation Networks

Routing and Scheduling in Distributed Advance Reservation Ne...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Xie, Chongyang Alazemi, Hamad Ghani, Nasir Univ New Mexico Albuquerque NM 87131 USA Kuwait Univ Safat 13060 Kuwait

ISBN: (纸本)9781424456383

Advance reservation of connection requests is a growing focus area and a range of solutions have been proposed. However, most efforts here have focused on scheduling algorithm design and have not addressed related implementation concerns in distributed settings. As a result, most schemes imply the use of a centralized controller, posing many scalability and reliability challenges. In order to address these concerns, this paper proposes a distributed routing solution for advance reservation. Namely, new link-state data structures are defined to summarize timeline-bandwidth state without the "time-slot" constraint along with novel routing update triggering policies for timely state dissemination. A refined distributed path-computation scheme is then developed to use this propagated state. The proposed solution is analyzed using discrete event simulation.

关键词： connection request discrete event simulation discrete event simulation distributed advance reservation network distributed path-computation scheme distributed processing distributed routing link-state data structure network routing routing update triggeri

来源：评论

学校读者我要写书评

暂无评论

An Agent-based distributed QoS Multicast routing Algorithm

引用

Physics Procedia 2012年 24卷 1951-1958页

作者： Gu Shen-jun Chen Jie Tian Hao-cheng Xu Ping Yang Yun Department of Compute Science Information and Engineering College Yangzhou University Yangzhou Jiangsu China

In accordance with multiple constrained QoS multicast routing problem, a new algorithm AQRAA (Agent-based distributed QoS Multicast routing Algorithm in Ad Hoc networks) is proposed based on Agent. AQRA takes advantage of the cooperation of different Agent groups to find the optimum multicast routing that satisfies the QoS constraint. AQRA exchanges and transmits routing information to obtain local optimum route and avoid cycle during the Agent meeting. The flexible routing switching and locking guarantees a successful routing connection. The experimental results indicate the feasibility and efficiency of AQRAA.

关键词： agent distributed routing multicast routing QoS constraint

来源：评论

学校读者我要写书评

暂无评论

Novel optimized routing algorithm for LEO satellite IP networks

引用

Journal of Systems Engineering and Electronics 2011年第6期22卷 917-925页

作者： Zihe Gao Qing Guo Zhenyu Na Communication Research Center Harbin Institute of Technology Harbin 150001 E R. China School of Information Science and Technology Dalian Maritime University Dalian 116026 E R. China

A lot of routing algorithms have been proposed for low earth orbit（LEO） satellite IP networks in recent years,but most of them cannot achieve global *** dynamic characters of LEO satellite networks are reflected in two aspects：topology and traffic *** algorithms mentioned above are ＂hard routing＂ which only realize local optimization.A distributed soft routing algorithm combined with multi-agent system（MASSR） is *** MASSR,mobile agents are used to gather routing information actively,and blackboard is introduced to achieve direct information exchange between *** provides traffic adaptive routing and tracks the change of LEO satellite network *** performance of ant colony optimization（ACO） and MASSR are compared in Iridium constellation,and MASSR presents better end-to-end delay as well as enhanced robustness.

关键词： distributed routing multi-agent system(MAS) satellite IP networks.

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：