753 research outputs found
Efficient Algorithms to Enhance Recovery Schema in Link State Protocols
With the increasing demands for real-time applications traffic in net- works
such as video and voice a high convergence time for the existing routing
protocols when failure occurred is required. These applications can be very
sensitive to packet loss when link/node goes down. In this paper, we propose
two algorithms schemas for the link state protocol to reroute the traffic in
two states; first, pre-calculated an alternative and disjoint path with the
primary one from the source to the destination by re-routing traffic through
it, regardless of the locations of failure and the number of failed links.
Second, rerouting the traffic via an alternative path from a node whose local
link is down without the need to wait until the source node knows about the
failure. This is achieved by creating a new backup routing table based on the
original routing table which is computed by the dijkstra algorithm. The goal of
these algorithms is to reduce loss of packets, end-to-end delay time, improve
throughput and avoiding local loop when nodes re-converge the topology in case
of failure.Comment: 15 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
Resilient routing in the internet
Although it is widely known that the Internet is not prone to random failures, unplanned failures due to
attacks can be very damaging. This prevents many organisations from deploying beneficial operations
through the Internet. In general, the data is delivered from a source to a destination via a series of
routers (i.e routing path). These routers employ routing protocols to compute best paths based on routing
information they possess. However, when a failure occurs, the routers must re-construct their routing
tables, which may take several seconds to complete. Evidently, most losses occur during this period.
IP Fast Re-Route (IPFRR), Multi-Topology (MT) routing, and overlays are examples of solutions
proposed to handle network failures. These techniques alleviate the packet losses to different extents,
yet none have provided optimal solutions. This thesis focuses on identifying the fundamental routing
problem due to convergence process. It describes the mechanisms of each existing technique as well as
its pros and cons. Furthermore, it presents new techniques for fast re-routing as follows.
Enhanced Loop-Free Alternates (E-LFAs) increase the repair coverage of the existing techniques,
Loop-Free Alternates (LFAs). In addition, two techniques namely, Full Fast Failure Recovery (F3R) and
fast re-route using Alternate Next Hop Counters (ANHC), offer full protection against any single link
failures. Nevertheless, the former technique requires significantly higher computational overheads and
incurs longer backup routes. Both techniques are proved to be complete and correct while ANHC neither
requires any major modifications to the traditional routing paradigm nor incurs significant overheads.
Furthermore, in the presence of failures, ANHC does not jeopardise other operable parts of the network.
As emerging applications require higher reliability, multiple failures scenarios cannot be ignored.
Most existing fast re-route techniques are able to handle only single or dual failures cases. This thesis
provides an insight on a novel approach known as Packet Re-cycling (PR), which is capable of handling
any number of failures in an oriented network. That is, packets can be forwarded successfully as long
as a path between a source and a destination is available. Since the Internet-based services and applications
continue to advance, improving the network resilience will be a challenging research topic for the
decades to come
Reliable Fault Tolerance System for Service Composition in Mobile Ad Hoc Network
A Due to the rapid development of smart processing mobile devices, Mobile applications are exploring the use of web services in MANETs to satisfy the user needs. Complex user needs are satisfied by the service composition where a complex service is created by combining one or more atomic services. Service composition has a significant challenge in MANETs due to its limited bandwidth, constrained energy sources, dynamic node movement and often suffers from node failures. These constraints increase the failure rate of service composition. To overcome these, we propose Reliable Fault Tolerant System for Service Composition in MANETs (RFTSC) which makes use of the checkpointing technique for service composition in MANETs. We propose fault policies for each fault in service composition when the faults occur. Failure of services in the service composition process is recovered locally by making use of Checkpointing system and by using discovered services which satisfies the QoS constraints. A Multi-Service Tree (MST) is proposed to recover failed services with O(1) time complexity. Simulation result shows that the proposed approach is efficient when compared to existing approaches
Pre-Congestion Notification (PCN) Architecture
This document describes a general architecture for flow admission and termination based on pre-congestion information in order to protect the quality of service of established, inelastic flows within a single Diffserv domain.\u
Providing Predictable Performance during Network Contingencies
In IP backbone networks, packets may get dropped due to: i) lack of viable next hops when a link/router fails, ii) forwarding loops during network convergence, and iii) buffer overflows in case of congestion. Similarly, packets may be lost in wireless networks due to variations in signal strength between a pair of mobile nodes. This dissertation explores the possibility of providing a predictable performance during such network contingencies in wired backbone networks and robotic wireless networks.
First, we study the feasibility of developing a combination of local reroute and global update mechanisms that can achieve loop-free convergence, while performing disruption-free forwarding around a failed link/router, without carrying any additional information in the IP datagrams and with out needing any coordination between routers. We show that order of updates rarely matters for loop-free convergence when failure inference based fast reroute (FIFR) scheme with interface-specific forwarding is employed for dealing with link or router failures. In the rare cases where order matters, it can be coupled with progressive link metric increments to ensure loop-freedom with unordered updates of forwarding tables. We also demonstrate that, apart from providing protection against failures, FIFR can also be utilized to mitigate packet drops due to network congestion caused by micro traffic bursts.
Second, we address the problem of constructing a communication map, which encodes information on whether two robots at given locations can communicate using a wireless network. Unlike previous offline approaches that do not utilize data measured by robots, we propose an online method, utilizing Gaussian Processes, to efficiently build a communication map with multiple robots, by exploiting prior communication models that can be derived from the physical map of the environment. Our evaluation, using a team of TurtleBot 2 platforms, confirms that the proposed method requires robots to take fewer signal strength measurements and travel less distance, and yet obtain similar accuracy as methods that consider all the locations in the environment
Packet re-cycling: eliminating packet losses due to network failures.
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or node failures. The technique employs only one bit in the packet header to cover any single link failures, and in the order of log2(d) bits to cover all non-disconnecting failure combinations, where d is the diameter of the network. We show that our routing strategy is effective and that its path length stretch is acceptable for realistic topologies. The packet header overhead incurred by PR is very small, and the extra memory and packet processing time required to implement it at each router are insignificant. This makes PR suitable for loss-sensitive, mission-critical network applications
Overcoming Bandwidth Fluctuations in Hybrid Networks with QoS-Aware Adaptive Routing
With an escalating reliance on sensor-driven scientific endeavors in challenging terrains, the significance of robust hybrid networks, formed by a combination of wireless and wired links, is more noticeable than ever. These networks serve as essential channels for data streaming to centralized data centers, but their efficiency is often degraded by bandwidth fluctuations and network congestion. Especially in bandwidth-sensitive hybrid networks, these issues present demanding challenges to Quality of Service (QoS). Traditional network management solutions fail to provide an adaptive response to these dynamic challenges, thereby underscoring the need for innovative solutions. This thesis introduces a novel approach leveraging the concept of Software-Defined Networking (SDN) to establish a dynamic, congestion-aware routing mechanism. This proposed mechanism stands out by comprising a unique strategy of using bandwidth-based measurements, which help accurately detect and localize network congestion. Unlike traditional methodologies that rely on rigid route management, our approach demonstrates dynamic data flow route adjustment. Experimental data indicate promising outcomes with clear improvements in network utilization and application performance. Furthermore, the proposed algorithm exhibits remarkable scalability, providing quick route-finding solutions for various data flows, without impacting system performance. Thus, this thesis contributes to the ongoing discourse on enhancing hybrid network efficiency in challenging conditions, setting the stage for future explorations in this area
- …