English
Related papers

Related papers: Fast Reroute with Highly Connected Routes Based on…

200 papers

In optical WDM networks, since each lightpath can carry a huge mount of traffic, failures may seriously damage the end user applications. Hence fault tolerance becomes an important issue on these networks. The light path which carries…

Networking and Internet Architecture · Computer Science 2009-12-04 G. Ramesh , S. SundaraVadivelu

This paper proposes a novel admission and routing scheme which takes into account arbitrarily assigned priorities for network flows. The presented approach leverages the centralized Software Defined Networking (SDN) capabilities in order to…

Networking and Internet Architecture · Computer Science 2020-09-24 Jorge López , Maxime Labonne , Claude Poletti , Dallal Belabed

While routing in wireless networks has been studied extensively, existing protocols are typically designed for a specific set of network conditions and so cannot accommodate any drastic changes in those conditions. For instance, protocols…

Networking and Internet Architecture · Computer Science 2021-01-01 Victoria Manfredi , Alicia Wolfe , Bing Wang , Xiaolan Zhang

Due to the rapid growth of heterogeneous wireless networks (HWNs), where devices with diverse communication technologies coexist, there is increasing demand for efficient and adaptive multi-hop routing with multiple data flows. Traditional…

Signal Processing · Electrical Eng. & Systems 2025-11-05 Brian Kim , Justin H. Kong , Terrence J. Moore , Fikadu T. Dagefu

Network latency severely impacts the performance of applications running on supercomputers. Adaptive routing algorithms route packets over different available paths to reduce latency and improve network utilization. However, if a switch…

Networking and Internet Architecture · Computer Science 2025-11-20 Tommaso Bonato , Daniele De Sensi , Salvatore Di Girolamo , Abdulla Bataineh , David Hewson , Duncan Roweth , Torsten Hoefler

The maximum achievable capacity from source to destination in a network is limited by the min-cut max-flow bound; this serves as a converse limit. In practice, link capacities often fluctuate due to dynamic network conditions. In this work,…

Information Theory · Computer Science 2025-07-22 Rivka Gitik , Alejandro Cohen

With the increasing scale of communication networks, the likelihood of failures grows as well. Since these networks form a critical backbone of our digital society, it is important that they rely on robust routing algorithms which ensure…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-12-01 Christoph Lenzen , Moti Medina , Mehrdad Saberi , Stefan Schmid

The existing segment routing (SR) methods need to determine the routing first and then use path segmentation approaches to select swap nodes to form a segment routing path (SRP). They require re-segmentation of the path when the routing…

Artificial Intelligence · Computer Science 2025-03-24 Miao Ye , Jihao Zheng , Qiuxiang Jiang , Yuan Huang , Ziheng Wang , Yong Wang

Traffic routing is vital for the proper functioning of the Internet. As users and network traffic increase, researchers try to develop adaptive and intelligent routing algorithms that can fulfill various QoS requirements. Reinforcement…

Networking and Internet Architecture · Computer Science 2024-09-24 Wang Wumian , Sajal Saha , Anwar Haque , Greg Sidebottom

We present a study of deep learning applied to the domain of network traffic data forecasting. This is a very important ingredient for network traffic engineering, e.g., intelligent routing, which can optimize network performance,…

Machine Learning · Computer Science 2019-09-13 Benedikt Pfülb , Christoph Hardegen , Alexander Gepperth , Sebastian Rieger

Software-defined networking offers numerous benefits against the legacy networking systems through simplifying the process of network management and reducing the cost of network configuration. Currently, the management of failures in the…

Networking and Internet Architecture · Computer Science 2019-04-02 Ali Malik , Benjamin Aziz , Mo Adda , Chih-Heng Ke

Modern communication networks feature local fast failover mechanisms in the data plane, to swiftly respond to link failures with pre-installed rerouting rules. This paper explores resilient routing meant to tolerate $\leq k$ simultaneous…

Networking and Internet Architecture · Computer Science 2024-10-04 Wenkai Dai , Klaus-Tycho Foerster , Stefan Schmid

Estimating the shortest travel time and providing route recommendation between different locations in a city or region can quantitatively measure the conditions of the transportation network during or after extreme events. One common…

Machine Learning · Computer Science 2025-01-20 Tong Liu , Hadi Meidani

A reliable network infrastructure must be able to sustain traffic flows, even when a failure occurs and changes the network topology. During the occurrence of a failure, routing protocols, like OSPF, take from hundreds of milliseconds to…

Networking and Internet Architecture · Computer Science 2012-04-12 Fernando Barreto , Emilio C. G. Wille , Luiz Nacamura

This paper introduces NeuRoute, a dynamic routing framework for Software Defined Networks (SDN) entirely based on machine learning, specifically, Neural Networks. Current SDN/OpenFlow controllers use a default routing based on Dijkstra…

Networking and Internet Architecture · Computer Science 2017-09-19 Abdelhadi Azzouni , Raouf Boutaba , Guy Pujolle

We study the traffic dynamics in complex networks where each link is assigned a limited and identical bandwidth. Although the first-in-first-out (FIFO) queuing rule is widely applied in the routing protocol of information packets, here we…

Data Analysis, Statistics and Probability · Physics 2015-05-27 Ming Tang , Tao Zhou

This paper proposes a bidirectional rapidly-exploring random trees (RRT) algorithm to solve the motion planning problem for hybrid systems. The proposed algorithm, called HyRRT-Connect, propagates in both forward and backward directions in…

Robotics · Computer Science 2024-04-02 Nan Wang , Ricardo G. Sanfelice

The past century of telecommunications has shown that failures in networks are prevalent. Although much has been done to prevent failures, network nodes and links are bound to fail eventually. Failure recovery processes are therefore…

Networking and Internet Architecture · Computer Science 2016-05-31 Niels L. M. van Adrichem , Farabi Iqbal , Fernando A. Kuipers

The main challenge in wireless sensor network is to improve the fault tolerance of each node and also provide an energy efficient fast data routing service. In this paper we propose an energy efficient node fault diagnosis and recovery for…

Networking and Internet Architecture · Computer Science 2013-05-31 Prasenjit Chanak , Tuhina Samanta , Indrajit Banerjee

We study journey planning in multimodal networks consisting of public transit plus an unrestricted transfer mode (e.g., walking or cycling). In order to provide good results in practice, algorithms must account for vehicle delays.…

Data Structures and Algorithms · Computer Science 2023-11-07 Dominik Bez , Jonas Sauer