1,469 research outputs found
Fast emergency paths schema to overcome transient link failures in ospf routing
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 various seconds in order to converge. During this convergence period,
packets might traverse a longer path or even a loop. An even worse transient
behaviour is that packets are dropped even though destinations are reachable.
In this context, this paper describes a proactive fast rerouting approach,
named Fast Emergency Paths Schema (FEP-S), to overcome problems originating
from transient link failures in OSPF routing. Extensive experiments were done
using several network topologies with different dimensionality degrees. Results
show that the recovery paths, obtained by FEPS, are shorter than those from
other rerouting approaches and can improve the network reliability by reducing
the packet loss rate during the routing protocols convergence caused by a
failure.Comment: 18 page
Segment Routing: a Comprehensive Survey of Research Activities, Standardization Efforts and Implementation Results
Fixed and mobile telecom operators, enterprise network operators and cloud
providers strive to face the challenging demands coming from the evolution of
IP networks (e.g. huge bandwidth requirements, integration of billions of
devices and millions of services in the cloud). Proposed in the early 2010s,
Segment Routing (SR) architecture helps face these challenging demands, and it
is currently being adopted and deployed. SR architecture is based on the
concept of source routing and has interesting scalability properties, as it
dramatically reduces the amount of state information to be configured in the
core nodes to support complex services. SR architecture was first implemented
with the MPLS dataplane and then, quite recently, with the IPv6 dataplane
(SRv6). IPv6 SR architecture (SRv6) has been extended from the simple steering
of packets across nodes to a general network programming approach, making it
very suitable for use cases such as Service Function Chaining and Network
Function Virtualization. In this paper we present a tutorial and a
comprehensive survey on SR technology, analyzing standardization efforts,
patents, research activities and implementation results. We start with an
introduction on the motivations for Segment Routing and an overview of its
evolution and standardization. Then, we provide a tutorial on Segment Routing
technology, with a focus on the novel SRv6 solution. We discuss the
standardization efforts and the patents providing details on the most important
documents and mentioning other ongoing activities. We then thoroughly analyze
research activities according to a taxonomy. We have identified 8 main
categories during our analysis of the current state of play: Monitoring,
Traffic Engineering, Failure Recovery, Centrally Controlled Architectures, Path
Encoding, Network Programming, Performance Evaluation and Miscellaneous...Comment: SUBMITTED TO IEEE COMMUNICATIONS SURVEYS & TUTORIAL
Fluctuation-induced traffic congestion in heterogeneous networks
In studies of complex heterogeneous networks, particularly of the Internet,
significant attention was paid to analyzing network failures caused by hardware
faults or overload, where the network reaction was modeled as rerouting of
traffic away from failed or congested elements. Here we model another type of
the network reaction to congestion -- a sharp reduction of the input traffic
rate through congested routes which occurs on much shorter time scales. We
consider the onset of congestion in the Internet where local mismatch between
demand and capacity results in traffic losses and show that it can be described
as a phase transition characterized by strong non-Gaussian loss fluctuations at
a mesoscopic time scale. The fluctuations, caused by noise in input traffic,
are exacerbated by the heterogeneous nature of the network manifested in a
scale-free load distribution. They result in the network strongly overreacting
to the first signs of congestion by significantly reducing input traffic along
the communication paths where congestion is utterly negligible.Comment: 4 pages, 3 figure
An Efficient Rerouting Approach in Software Defined Networks
This paper illustrates an efficient traffic rerouting solution in Software-Defined Networks (SDN) by monitoring the network status periodically. The proposed approach provides a rerouting solution by first calculating the link utilization for available paths and then rerouting the flow to the least delay path among the available paths. The traffic rerouting solution is considering the network condition to prevent the switch overutilization and congestion while any new flow arrives. The proposed method is implemented by using ONOS controller and Mininet emulator. The proposed algorithm in the controller predicts the utilization and delay on the link to calculate how much load to be rerouted if the average link utilization exceeds the threshold level. Hence, this method will proactively avoid congestion by adding flows, monitoring the parameters and prevent the unbalanced distribution after rerouting as our experimental results show
Enhanced FAST TCP by Solving Rerouting Problem
Delay-based congestion control algorithms inability to recognize increased RTT related to rerouting from increased RTT related to congestion is their most serious problem which has serious effect on their throughput. FAST TCP is one of delay-based TCP variants that although outperforms other TCP variants in high bandwidth-delay product networks, but suffers from several problems that inhere in its procedure to estimate trip delay. The most serious of these problems is rerouting. When rerouting occurs and round-trip time (RTT) of the new path is longer than RTT of the old path, the throughput of FAST TCP decreases sharply. Because FAST misinterprets the increased RTT as result of the network congestion and consequently decreases its own window size. This paper solves this problem by considering the relationship between sending rate and observed RTT. The simulation results show the effectiveness of proposed solution to solve rerouting problem while simultaneously preserves FAST TCP prominent primitive features
Logical topology design for IP rerouting: ASONs versus static OTNs
IP-based backbone networks are gradually moving to a network model consisting of high-speed routers that are flexibly interconnected by a mesh of light paths set up by an optical transport network that consists of wavelength division multiplexing (WDM) links and optical cross-connects. In such a model, the generalized MPLS protocol suite could provide the IP centric control plane component that will be used to deliver rapid and dynamic circuit provisioning of end-to-end optical light paths between the routers. This is called an automatic switched optical (transport) network (ASON). An ASON enables reconfiguration of the logical IP topology by setting up and tearing down light paths. This allows to up- or downgrade link capacities during a router failure to the capacities needed by the new routing of the affected traffic. Such survivability against (single) IP router failures is cost-effective, as capacity to the IP layer can be provided flexibly when necessary. We present and investigate a logical topology optimization problem that minimizes the total amount or cost of the needed resources (interfaces, wavelengths, WDM line-systems, amplifiers, etc.) in both the IP and the optical layer. A novel optimization aspect in this problem is the possibility, as a result of the ASON, to reuse the physical resources (like interface cards and WDM line-systems) over the different network states (the failure-free and all the router failure scenarios). We devised a simple optimization strategy to investigate the cost of the ASON approach and compare it with other schemes that survive single router failures
- …