Scribd Logo
Upload

Welcome to Scribd!

  • Abstract

    Uploaded by

    Soumya Ranjan Satapathy
    13 views1 page
    Routing protocols can see degraded performance when nodes malfunction, but fault tolerant routing protocols address this by using multiple paths. Designing effective fault tolerant routing is difficult because the problem is computationally hard and exact path information is unknown. The paper presents an end-to-end estimation-based fault tolerant routing algorithm called E2FT that employs route estimation and selection processes. Route estimation iteratively improves path assessments through measurement, and route selection chooses multiple paths for delivery informed by the increasingly accurate estimates.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Routing protocols can see degraded performance when nodes malfunction, but fault tolerant routing protocols address this by using multiple paths. Designing effective fault tolerant routing is difficult because the problem is computationally hard and exact path information is unknown. The paper presents an end-to-end estimation-based fault tolerant routing algorithm called E2FT that employs route estimation and selection processes. Route estimation iteratively improves path assessments through measurement, and route selection chooses multiple paths for delivery informed by the increasingly accurate estimates.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    13 views1 page

    Abstract

    Uploaded by

    Soumya Ranjan Satapathy
    Routing protocols can see degraded performance when nodes malfunction, but fault tolerant routing protocols address this by using multiple paths. Designing effective fault tolerant routing is difficult because the problem is computationally hard and exact path information is unknown. The paper presents an end-to-end estimation-based fault tolerant routing algorithm called E2FT that employs route estimation and selection processes. Route estimation iteratively improves path assessments through measurement, and route selection chooses multiple paths for delivery informed by the increasingly accurate estimates.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 1

    Abstract

    The performance of ad hoc routing protocols will


    significantly degrade, if there are malfunctioned nodes in the
    network. Fault tolerant routing protocols address this
    problem by exploring the network redundancy through
    multipath routing.Designing an effective and efficient fault
    tolerant routing protocol is inherently hard, because the
    problem is NP-complete and the precise path information is
    unavailable. This paper solves this problem by presenting an
    end-to-end estimation-based fault tolerant routing algorithm
    E2FT. E2FT deploys two complementary processes: route
    estimation and route selection. Through endto-end
    performance measurement, the route estimation process
    gives improving estimation results via iterations. Based on
    these estimation results, the route selection process decides a
    multipath route for packet delivery. The route selection is
    refined progressively with the increasingly accurate
    estimation result using “confirmation” and “dropping”
    procedures. Through theoretical analysis and simulation, we
    show E2FT can achieve a high packet delivery rate with
    acceptable overhead.

    You might also like