5 research outputs found

    An efficient pre-computed backup path on the IGP network communication

    Get PDF
    Currently, data communication during heavy traffic transmission on the network suffers from node failures. A failure in the network is required to be restored by the routing protocols in the networks. Traditional routing protocols schemes normally compute a routing table which contains all paths between all nodes on the network. Hence, the data packets will be passed via the single shortest path which is the best path between each source and destination. In this paper, a pre-computed alternate path is introduced to assist the congested networks to continue passing the data packets from its source to the final destination once failure occurs. The proposed alternative routing table (ART) algorithm aims to re-route the traffic through a backup route when the primary path has failed. We have evaluated the performance of the proposed scheme with OSPF routing protocol through NS2 simulator. The results show that packet losses, rerouting and end to end delay times of the proposed methods are substantially improved

    Adaptive post-failure load balancing in fast reroute enabled IP networks

    Get PDF
    Fast reroute (FRR) techniques have been designed and standardised in recent years for supporting sub-50-millisecond failure recovery in operational ISP networks. On the other hand, if the provisioning of FRR protection paths does not take into account traffic engineering (TE) requirements, customer traffic may still get disrupted due to post-failure traffic congestion. Such a situation could be more severe in operational networks with highly dynamic traffic patterns. In this paper we propose a distributed technique that enables adaptive control of FRR protection paths against dynamic traffic conditions, resulting in self-optimisation in addition to the self-healing capability. Our approach is based on the Loop-free Alternates (LFA) mechanism that allows non-deterministic provisioning of protection paths. The idea is for repairing routers to periodically re-compute LFA alternative next-hops using a lightweight algorithm for achieving and maintaining optimised post-failure traffic distribution in dynamic network environments. Our experiments based on a real operational network topology and traffic traces across 24 hours have shown that such an approach is able to significantly enhance relevant network performance compared to both TE-agnostic and static TE-aware FRR solutions. © 2011 IEEE

    An automatic restoration scheme for switch-based networks

    Get PDF
    International audienceThis paper presents a fully automated distributed resilient routing scheme for switch-based or new generation router based networks. The failure treatment is done locally and other nodes in the network do not need to undertake special actions. In contrast to conventional IP routing schemes, each node routes the traffic on the basis of the entering arc and of the destination. The resulting constraint is that two flows to the same destination entering in a node by a common arc have to merge after this arc. It is shown that this is sufficient for dealing with all single link failure situations, assuming that the network is symmetric and two-link connected. Two heuristic approaches are proposed to handle the corresponding dimensioning problem for large network instances. The proposed method generalizes some methods of literature [6], [8] and provides more cost-efficient solutions

    Optimizing post-failure network performance for IP fast reroute using tunnels

    No full text
    IP Fast ReRoute (FRR) mechanisms have been proposed to achieve fast failover for supporting Quality of Services (QoS) assurance. However, these mechanisms do not consider network performance after affected traffic is rerouted onto repair paths. As a result, QoS deterioration may still happen due to post-failure traffic congestion in the network, which nullifies the effectiveness of IP FRR. In this paper, by considering IP tunneling as the underlying IP FRR mechanism, we proposed an efficient algorithm to judiciously select tunnel endpoints such that the network performance is optimized after the repair paths are activated for rerouting. According to the simulation results using real operational network topologies and traffic matrices, the algorithm achieves significant improvement on post-failure load balancing compared to the traditional IGP re-convergence and plain tunnel endpoint selection without such consideration

    Optimizing Post-Failure Network Performance for IP Fast Reroute using Tunnels

    No full text
    IP Fast ReRoute (FRR) mechanisms have been proposed to achieve fast failover for supporting Quality of Services (QoS) assurance. However, these mechanisms do not consider network performance after affected traffic is rerouted onto repair paths. As a result, QoS deterioration may still happen due to post-failure traffic congestion in the network, which nullifies the effectiveness of IP FRR. In this paper, by considering IP tunneling as the underlying IP FRR mechanism, we proposed an efficient algorithm to judiciously select tunnel endpoints such that the network performance is optimized after the repair paths are activated for rerouting. According to the simulation results using real operational network topologies and traffic matrices, the algorithm achieves significant improvement on post-failure load balancing compared to the traditional IGP re-convergence and plain tunnel endpoint selection without such consideration
    corecore