A Unified Framework for Multipath Routing for Unicast and Multicast Traffic

We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the gradient of the network cost function is not available and needs to be estimated. Multiple paths are provided between a source and a destination using application-layer overlay. We propose a novel algorithm that is based on what is known as simultaneous perturbation stochastic approximation and utilizes only noisy measurements collected and reported to the sources, using an overlay architecture.We consider three network models that reflect different sets of assumptions regarding multicast capabilities of the network. Using an analytical model we first prove the almost sure convergence of the algorithm to a corresponding optimal solution under each network model considered in this paper with decreasing step sizes. Then, we establish the weak convergence (or convergence in distribution) with a fixed step size. In addition, we investigate the benefits acquired from implementing additional multicast capabilities by studying the relative performance of our algorithm under the three network models.      

IP网流量工程的一种权值设置方法

提出一种新的基于传统路由协议的流量控制方法。该方法首先在不限制总流量条件下求解最小化最大连接利用率。然后在固定最大连接利用率条件下最小化总流量。由此求得最优流量分配方案并从其对偶问题中求出各连接的权值配置。实验结果显示,文中算法较现有算法明显降低最大连接利用率,并且增加了稳定性。     

A Traffic Delay and Bandwidth Based Multipath Scheduling Approach for Optimal Routing in Underwater Optical Network

Wireless Personal Communications - Optical networks are future networks that will support the vast bandwidth demand for communication in diverse domain and service applications scale to worldwide...     

Traffic Aware Congestion Control Priority Based Efficient Adaptive Multipath Routing in Wired Networks with New Queuing Technique

Wireless Personal Communications - This paper proposes a novel technique for data transmission from source to destination by using adaptive multipath routing with route adaptability. In this...     

Secured and QoS Based Energy-Aware Multipath Routing in MANET

Wireless Personal Communications - In MANET, energy aware multipath routing is major concern for securable transmission which is possible by avoiding the attackers or selfish nodes from the...     

Multipath Routing Algorithms for Congestion Minimization

Unlike traditional routing schemes that route all traffic along a single path, multipath routing strategies split the traffic among several paths in order to ease congestion. It has been widely recognized that multipath routing can be fundamentally more efficient than the traditional approach of routing along single paths. Yet, in contrast to the single-path routing approach, most studies in the context of multipath routing focused on heuristic methods. We demonstrate the significant advantage of optimal (or near optimal) solutions. Hence, we investigate multipath routing adopting a rigorous (theoretical) approach. We formalize problems that incorporate two major requirements of multipath routing. Then, we establish the intractability of these problems in terms of computational complexity. Finally, we establish efficient solutions with proven performance guarantees     

Optimal Multipath Routing for Video Transmission in VANETs

Wireless Personal Communications - The communication among the vehicles in Vehicular Ad Hoc Network (VANET) plays a major role in the improvement of safety in critical situations of road scenario....     

用于Ad Hoc网络的多径混合路由

移动Ad hoc网络是由一组移动节点组成的临时网络,它不需要事先建立的网络基础设施的支持。路由协议对网络性能起着决定性的作用。文中提出了一种基于多路径的Ad hoc网络混合路由策略（MPHR）。在MPHR中,边权值表示节点之间的链路可靠性。与传统的单路径路由策略不同,在一对源节点和目的节点间,使用多条路径来发送分组。仿真结果表明,MPHR的分组投递率远高于DSR路由协议,但路由开销略大于DSR。     

自组织网络中基于负载均衡的多径路由设计

分析了自组织网络中AOMDV多径路由协议的机制和特点,针对其在拥塞控制和负载均衡的缺点,提出了AOMDV＿D协议,在转发RREP消息时根据计算的当前节点负载量适当的延时发送,从而能够自主选择网络中空闲的节点建立主路径。仿真结果表明 AOMDV＿D协议在网络负载较大的情况下,平均时延和分组投递率都比AOMDV协议更优。     

Ad Hoc On-Demand Multipath Distance Vector Based Routing in Ad-Hoc Networks

Wireless Personal Communications - Cognitive performance is associated with learning ability and academic success of a student. Since an individual student may lose attention during class, a study...     

Distributed Algorithms for Secure Multipath Routing in Attack-Resistant Networks

To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple paths so that intruders require much more resources to mount successful attacks. Our work exhibits several important properties that include: (1) routing decisions are made locally by network nodes without the centralized information of the entire network topology; (2) routing decisions minimize throughput loss under a single-link attack with respect to different session models; and (3) routing decisions address multiple link attacks via lexicographic optimization. We devise two algorithms termed the Bound-Control algorithm and the Lex-Control algorithm, both of which provide provably optimal solutions. Experiments show that the Bound-Control algorithm is more effective to prevent the worst-case single-link attack when compared to the single-path approach, and that the Lex-Control algorithm further enhances the Bound-Control algorithm by countering severe single-link attacks and various types of multi-link attacks. Moreover, the Lex-Control algorithm offers prominent protection after only a few execution rounds, implying that we can sacrifice minimal routing protection for significantly improved algorithm performance. Finally, we examine the applicability of our proposed algorithms in a specialized defensive network architecture called the attack-resistant network and analyze how the algorithms address resiliency and security in different network settings.     

Statistical Multipath Queue-Wise Preemption Routing for ZigBee-Based WSN

Nowadays, wireless sensor network (WSN) is an important component in IoT environment, which enables efficient data collection and transmission. Since WSN consists of a large number of sensor nodes, network congestion can easily occur which significantly degrades the performance of entire network. In this paper a novel scheme called SMQP (Statistical Multipath Queue-wise Preemption) routing is proposed to balance the load and avoid the congestion for ZigBee-based WSN. This is achieved by employing statistical path scheduling and queue-wise preemption with multiple paths between any source and destination node. NS2 simulation reveals that the proposed scheme significantly improves the QoS in terms of delivery ratio, end-to-end delay, and packet delivery ratio compared to the representative routing schemes for WSN such as ad hoc on-demand distance vector and ad hoc on-demand multipath distance vector scheme.     

基于终点的用户均衡交通分配模型求解算法

用户均衡分配模型是更接近实际交通状态的分配模型,它是建立在出行者总选择起迄点间交通时间最短的路径作为出行路线的行为假设基础上的。分析基于终点的用户均衡交通分配模型,指出该模型与基于路径均衡配流模型是等价的,在选择美国BPR路阻函数后,模型可以转化为带线性约束的非线性规划问题,并给出模型的矩阵表示。对这类问题,采用简便实用的仿射尺度算法求解,给出算法的基本思想及详细的实现过程。仿真结果显示,所得最优解满足Wardrop第一准则,表明该算法是有效的,可用于大型路网的配流计算。     

一种新的基于ACSA的ad hoc多径QoS选路方法

ad hoc网络中基于蚁群系统算法（Ant Colony System Algorithms,ACSA）的路由协议已经被广泛地研究,但其中的大部分本质上都属于单径路由协议,使得源宿之间最短路径上的主机负担加重。另一方面,由于引入了蚂蚁的正反馈机制,使得协议本身比较差的鲁棒性受到进一步的削弱。多径路由能够更好地支持QoS。将ACSA和链路不相交的多径路由结合起来以解决上述问题,提出的基于ACSA的多径QoS选路方法建立和利用多条链路不相交路径来并发发送数据,并且采用信息素来分散通信流量,因此能够适应网络的动态变化和更好地支持QoS。仿真结果表明该方法要优于其他相关的算法。     

ZBLE: Zone Based Efficient Energy Multipath Protocol for Routing in Mobile Ad Hoc Networks

Wireless Personal Communications - Design of 5G and beyond 5G telecommunication systems relies on utilization of diverse solutions for different envisioned applications and different constituents...     

Ant Colony Based Node Disjoint Local Repair in Multipath Routing in MANET Network

Wireless Personal Communications - Routes discovery that can provide reliable data transmission in Mobile Ad-hoc Networks is challenging due to its wireless channel characteristics and dynamic...     

网络路由基于对策论的资源分配策略

对策论提供对独立参与者之间冲突进行建模的框架,可用以综合考虑路由选择和拥塞控制问题.经典的对策论不一定直接能应用于网络.本文在路由选择的多Agent系统的基础上,给出具有惩恶扬善行为的基于对策论的路由资源分配策略.它奖励避免拥塞、惩罚行为不合要求的用户.在用户都是理性的前提下,系统能稳定在纳什均衡状态.