We consider the shortest path routing (SPR) of a network with stochastically time varying link metrics under potential adversarial attacks. Due to potential denial of service attacks, the distributions of link states could be stochastic (benign) or adversarial at different temporal and spatial locations. Without any \emph{a priori}, designing an adaptive SPR protocol to cope with all possible situations in practice optimally is a very challenging issue. In this paper, we present the first solution by formulating it as a multi-armed bandit (MAB) problem. By introducing a novel control parameter into the exploration phase for each link, a martingale inequality is applied in the our combinatorial adversarial MAB framework. As such, our proposed algorithms could automatically detect features of the environment within a unified framework and find the optimal SPR strategies with almost optimal learning performance in all possible cases over time. Moreover, we study important issues related to the practical implementation, such as decoupling route selection with multi-path route probing, cooperative learning among multiple sources, the "cold-start" issue and delayed feedback of our algorithm. Nonetheless, the proposed SPR algorithms can be implemented with low complexity and they are proved to scale very well with the network size. Comparing to existing approaches in a typical network scenario under jamming attacks, our algorithm has a 65.3\% improvement of network delay given a learning period and a 81.5\% improvement of learning duration under a specified network delay.
We introduce FatPaths: a simple, generic, and robust routing architecture that enables state-of-the-art low-diameter topologies such as Slim Fly to achieve unprecedented performance. FatPaths targets Ethernet stacks in both HPC supercomputers as well as cloud data centers and clusters. FatPaths exposes and exploits the rich ("fat") diversity of both minimal and non-minimal paths for high-performance multi-pathing. Moreover, FatPaths uses a redesigned "purified" transport layer that removes virtually all TCP performance issues (e.g., the slow start), and incorporates flowlet switching, a techni…
Enhanced Genetic Algorithm approach for Solving Dynamic Shortest Path Routing Problems using Immigrants and Memory Schemes
在因特网路由中，静态最短路径（SP）问题已经使用众所周知的智能优化技术如人工神经网络、遗传算法（GAs）和粒子群优化来解决。随着无线通信技术的发展，移动无线网络越来越多，如移动自组织网络（Mobile Ad Hoc Networks，MANDIX）和无线传感器网络等。网络的动态性是移动自组网的主要特点。因此，移动自组网中的SP路由问题转化为动态优化问题（DOP）。在这里，节点可以意识到环境条件，从而使其智能化，这将作为GA的输入。实现，然后使用遗传算法与移民和内存计划，以解决动态SP路由问题（DSPRP）在MANETS。在本文中，一旦网络拓扑结构发生变化，可以利用新的移民或存储在内存中的有用信息搜索新环境中的最优解。结果表明，采用新移民策略的遗传算法比采用记忆策略的遗传算法具有更好的收敛性。
Service Function Chain Routing in LEO Networks Using Shortest-Path Delay Statistical Stability
School of Information Science and Technology, ShanghaiTech University（上海科技大学信息科学与技术学院）；Dept. of Electronic and Computer Engineering, The Hong Kong University of Science and Technology（香港科技大学电子与计算机工程系）
We consider the adaptive routing problem in multihop wireless networks. The link states are assumed to be random variables drawn from unknown distributions, independent and identically distributed across links and time. This model has attracted a growing interest recently in cognitive radio networks and adaptive communication systems. In such networks, devices are cognitive in the sense of learning the link states and updating the transmission parameters to allow efficient resource utilization. This model contrasts sharply with the vast literature on routing algorithms that assumed complete kn…
The Jellyfish network has recently be proposed as an alternate to the fat-tree network as the interconnect for data centers and high performance computing clusters. Jellyfish adopts a random regular graph as its topology and has been showed to be more cost-effective than fat-trees. Effective routing on Jellyfish is challenging. It is known that shortest path routing and equal-cost multi-path routing (ECMP) do not work well on Jellyfish. Existing schemes use variations of k-shortest path routing (KSP). In this work, we study two routing components for Jellyfish: path selection that decides the …
The design and launch of large-scale satellite networks create an imminent demand for efficient and delay-minimising routing methods. With the rising number of satellites in such constellations, pre-computing all shortest routes between all satellites and for all times becomes more and more infeasible due to space and time limitations. Even though distributed on-demand routing methods were developed for specific LEO satellite network configurations, they are not suited for increasingly popular mega-constellations based on Walker Delta formations. The contributions of this paper are twofold. Fi…
The recent line of research into topology design focuses on lowering network diameter. Many low-diameter topologies such as Slim Fly or Jellyfish that substantially reduce cost, power consumption, and latency have been proposed. A key challenge in realizing the benefits of these topologies is routing. On one hand, these networks provide shorter path lengths than established topologies such as Clos or torus, leading to performance improvements. On the other hand, the number of shortest paths between each pair of endpoints is much smaller than in Clos, but there is a large number of non-minimal …
Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
多播是通信网络从应用程序接受单个消息并将消息的副本传递给不同位置的多个接收者的能力。随着Internet的发展，组播被广泛应用于各种多媒体实时应用中：分布式多媒体系统、协同计算、视频会议、远程教育等。为了构造时延约束的组播路由树，首先分析了平均距离启发式算法（ADH）。在此基础上，提出了一种时延约束算法DCADH（delay-constrained average distance heuristic）。利用ADH可以构造出一棵最小代价的组播路由树，如果路径时延不满足时延上界，则将Dijkstra算法计算出的一条最短时延路径合并到现有的组播路由树中，以满足时延上界。仿真实验表明，DCADH在实现低代价组播路由树方面具有良好的性能。
Relying on multi-hop communication techniques, aeronautical ad hoc networks (AANETs) seamlessly integrate ground base stations (BSs) and satellites into aircraft communications for enhancing the on-demand connectivity of planes in the air. In this integrated AANET context we investigate the shortest-path routing problem with the objective of minimizing the total delay of the in-flight connection from the ground BS subject to certain minimum-rate constraints for all selected links in support of low-latency and high-speed services. Inspired by the best-first search and priority queue concepts, w…
Most of the real world networks are complex as well as evolving. Therefore, it is important to study the effect of network topology on the dynamics of traffic and congestion in the network. To account this problem, we have designed a time-varying network model where a new node will join a node in the existing network with probability proportional to its degree and disassortativity with its neighbors. Betweenness centrality (BC) plays an important role to find the influential node and user's shortest route in the network. As shortest route comprised of hub nodes and chances of congestion is mor…
