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

SRLG: To Finding the Packet Loss in Peer to Peer Network

We introduce the ideas of watching methods (MPs) and watching cycles (MCs) for distinctive localization of shared risk connected cluster (SRLG) failures in all-optical networks. An SRLG failure causes multiple links to interrupt at the same time due to the failure of a typical resource. MCs (MPs) begin and finish at identical (distinct) watching location(s).They are constructed such any SRLG failure leads to the failure of a unique combination of methods and cycles. We tend to derive necessary and ample conditions on the set of MCs and MPs required for localizing associate single SRLG failure in a capricious graph. We determine the minimum range of optical splitters that area unit needed to watch all SRLG failures within the network. Extensive simulations area unit won�t to demonstrate the effectiveness of the planned watching technique

Force and Proficient Data Replica Discovery in WSN

We propose the distributed clone detection method and star topology is used to discover the replica data in the wireless sensor networks. In this paper vitality practiced space careful clone guarantee prosperous clone assault location and carry on satisfactory system period of time. Solidly, we tend to abuse the realm information of sensors and subjectively separate witnesses located in an exceedingly ring region to envision the genuineness of sensors and to report known clone assaults. Besides the clone detection likelihood, we tend to additionally contemplate energy consumption and memory storage within the style of clone detection protocol, i.e., associate degree energy- and memory economical distributed clone detection protocol with random witness choice theme in WSNs

On Integrating Failure Localization with Survivable Design

In this thesis, I proposed a novel framework of all-optical failure restoration which jointly determines network monitoring plane and spare capacity allocation in the presence of either static or dynamic traffic. The proposed framework aims to enable a general shared protection scheme to achieve near optimal capacity efficiency as in Failure Dependent Protection(FDP) while subject to an ultra-fast, all-optical, and deterministic failure restoration process. Simply put, Local Unambiguous Failure Localization(L-UFL) and FDP are the two building blocks for the proposed restoration framework. Under L-UFL, by properly allocating a set of Monitoring Trails (m-trails), a set of nodes can unambiguously identify every possible Shared Risk Link Group (SRLG) failure merely based on its locally collected Loss of Light(LOL) signals. Two heuristics are proposed to solve L-UFL, one of which exclusively deploys Supervisory Lightpaths (S-LPs) while the other jointly considers S-LPs and Working Lightpaths (W-LPs) for suppressing monitoring resource consumption. Thanks to the ``Enhanced Min Wavelength Max Information principle'', an entropy based utility function, m-trail global-sharing and other techniques, the proposed heuristics exhibit satisfactory performance in minimizing the number of m-trails, Wavelength Channel(WL) consumption and the running time of the algorithm. Based on the heuristics for L-UFL, two algorithms, namely MPJD and DJH, are proposed for the novel signaling-free restoration framework to deal with static and dynamic traffic respectively. MPJD is developed to determine the Protection Lightpaths (P-LPs) and m-trails given the pre-computed W-LPs while DJH jointly implements a generic dynamic survivable routing scheme based on FDP with an m-trail deployment scheme. For both algorithms, m-trail deployment is guided by the Necessary Monitoring Requirement (NMR) defined at each node for achieving signaling-free restoration. Extensive simulation is conducted to verify the performance of the proposed heuristics in terms of WL consumption, number of m-trails, monitoring requirement, blocking probability and running time. In conclusion, the proposed restoration framework can achieve all-optical and signaling-free restoration with the help of L-UFL, while maintaining high capacity efficiency as in FDP based survivable routing. The proposed heuristics achieve satisfactory performance as verified by the simulation results