Team for Research in
Ubiquitous Secure Technology

Intrusion tolerant services over WANs
Oprea Florian

Citation
Oprea Florian. "Intrusion tolerant services over WANs". Talk or presentation, 27, April, 2006; Poster given at NSF Trust Site Visit.

Abstract
Methods for building intrusion-tolerant services employ coordination protocols executed at a collection of distributed servers to mask the corruption of some of those servers. While benefits accrue by distributing the servers not only logically but also geographically, there has been little study of optimal ways to do so, i.e., so as to minimize network-centric costs (access delay, network congestion) of the resulting protocols. We have launched a research effort to analyze this problem both analytically and empirically, and we summarize our initial results in this area. Our techniques provide means to place servers at physical nodes in a way that is sensitive to both capacity constraints on those nodes and network costs that result from that placement. The replicated service built using the mapped servers features good resilience to server intrusions and near-optimal access delay or network congestion.

Electronic downloads

Citation formats  
  • HTML
    Oprea Florian. <a
    href="http://www.truststc.org/pubs/74.html"
    ><i>Intrusion tolerant services over
    WANs</i></a>, Talk or presentation,  27, April,
    2006; Poster given at NSF Trust Site Visit.
  • Plain text
    Oprea Florian. "Intrusion tolerant services over
    WANs". Talk or presentation,  27, April, 2006; Poster
    given at NSF Trust Site Visit.
  • BibTeX
    @presentation{Florian06_IntrusionTolerantServicesOverWANs,
        author = {Oprea Florian},
        title = {Intrusion tolerant services over WANs},
        day = {27},
        month = {April},
        year = {2006},
        note = {Poster given at NSF Trust Site Visit},
        abstract = {Methods for building intrusion-tolerant services
                  employ coordination protocols executed at a
                  collection of distributed servers to mask the
                  corruption of some of those servers. While
                  benefits accrue by distributing the servers not
                  only logically but also geographically, there has
                  been little study of optimal ways to do so, i.e.,
                  so as to minimize network-centric costs (access
                  delay, network congestion) of the resulting
                  protocols. We have launched a research effort to
                  analyze this problem both analytically and
                  empirically, and we summarize our initial results
                  in this area. Our techniques provide means to
                  place servers at physical nodes in a way that is
                  sensitive to both capacity constraints on those
                  nodes and network costs that result from that
                  placement. The replicated service built using the
                  mapped servers features good resilience to server
                  intrusions and near-optimal access delay or
                  network congestion.},
        URL = {http://www.truststc.org/pubs/74.html}
    }
    

Posted by Christopher Brooks on 4 May 2006.
Groups: trust
For additional information, see the Publications FAQ or contact webmaster at www truststc org.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.