SINCE 2004

  • 0

      0 Item in Bag


      Your Shopping bag is empty

      CHECKOUT
  • Notice

    • ALL COMPUTER, ELECTRONICS AND MECHANICAL COURSES AVAILABLE…. PROJECT GUIDANCE SINCE 2004. FOR FURTHER DETAILS CALL 9443117328

    Projects > COMPUTER > 2019 > NON IEEE > APPLICATION

    Taming Both Predicate and unpredictable link failures from network


    Abstract

    LNetwork tomography is the process of calculating fine-grained link metrics by using aggregated path measurements. It is an effective and efficient way to facilitate various network operations, such as network monitoring, load balancing, and fault diagnosis. Recently, there is a growing interest in the monitor placement problem that ensures link identifiability in a network with link failures. In this project the problem of placing a minimum number of monitors to identify additive link was studied from end-to-end measurements among monitors with considering both predictable and unpredictable link failures. A set of robust monitor placement algorithms was developed with different performance-complexity trade-offs to solve this tomography problem. In particular, the optimal (i.e., minimum) monitor placement is the solution to a hitting set problem, for which it provides a polynomial-time algorithm to construct the input. The proposed algorithms can guarantee network identifiability against failures based on the graph theory.


    Existing System

    In the existing system, Optimal Monitor Assignment (OMA) algorithm was used.An optimal monitor assignment (OMA) algorithm for preferential link tomography in communication networks. OMA first partitions the graph representing the network topology into multiple graph components.


    Proposed System

    A set of robust monitor placement algorithms that place monitors to achieve network identifiability against predictable and unpredictable link failures, including: (i) two straightforward solutions that apply an existing algorithm for static networks with fixed topologies to a network with changing topologies. (ii) An incremental placement algorithm that sequentially places monitors in each predicted topology. (iii) a joint placement algorithm that jointly considers monitor requirements of all network topologies by casting the problem as a hitting set problem, and then removes the redundant monitors by a monitor removal method.


    Architecture


    ARCHITECTURE DIAGRAM


    FOR MORE INFORMATION CLICK HERE