ویراساینس.
سند علمی

Efficient Self-stabilizing Graph Searching in Tree Networks

Jean R. S. Blair, Fredrik Manne, Rodica Mihai

چکیده

The graph search problem asks for a strategy that enables a minimum sized team of searchers to capture a “fugitive” while it evades and potentially multiplies through a network. It is motivated by the need to eliminate fast spreading viruses and other malicious software agents in computer networks. The current work improves on previous results with a self-stabilizing algorithm that clears an n node tree network using only 1+log n searchers and O(n log n) moves after initialization. Since Θ(log n) searchers are required to clear some tree networks even in the sequential case, this is the best that any self-stabilizing algorithm can do. The algorithm is based on a novel multi-layer traversal of the network.

اسناد مشابه

  • Efficient Self-stabilizing Algorithms for Tree Networks

    سند علمی۲۰۰۲Jean R. S. Blair, Fredrik Manne

    Many proposed self-stabilizing algorithms require an exponential number of moves before stabilizing on a global solution, including some rooting algorithms for tree networks [1, 2, 3]. These results are vastly improved upon in [5] with tree rooting algorithms that require only O(

  • Memory-Efficient Self Stabilizing Protocols for General Networks

    سند علمی۱۹۹۰WDAGYehuda Afek, Shay Kutten, Moti Yung

    A self stabilizing protocol for constructing a rooted spanning tree in an arbitrary asynchronous network of processors that communicate through sha~ed memory is presented. The processors have unique identifiers but are otherwise identical. The network topology is assumed to be dy

  • An efficient compression scheme for data communication which uses a new family of self-organizing binary search trees

    سند علمی۲۰۰۸Int. J. Communication SystemsLuis Rueda, B. John Oommen

    In this paper, we demonstrate that we can effectively use results from the field of adaptive self-organizing data structures in enhancing compression schemes. Unlike adaptive lists, which have already been used in compression, to the best of our knowledge, adaptive self-organizin

  • An Evaluation of Self-adjusting Binary Search Tree Techniques

    سند علمی۱۹۹۳Softw., Pract. Exper.Jim Bell, Gopal K. Gupta

    Much has been said in praise of self-adjusting data structures, particularly self-adjusting binary search trees. Self-adjusting trees are most suited to skewed key-access distributions as the techniques attempt to place the most commonly accessed keys near the root of the tree. T

  • Highly Space-Efficient Self-Stabilizing Depth-First Token Circulation for Trees

    سند علمی۱۹۹۷OPODISFranck Petit

    Self-stabilization was rst introduced by Dijkstra Dij74]: it is the property for a system to eventually recover itself a legitimate state after any perturbation modifying the memory state. Since Dijkstra original paper, the goal of many works has been to obtain self-stabilizing a

  • Avatar: A Time- and Space-Efficient Self-stabilizing Overlay Network

    سند علمی۲۰۱۵SSSAndrew Berns

    Overlay networks present an interesting challenge for faulttolerant computing. Many overlay networks operate in dynamic environments (e.g. the Internet), where faults are frequent and widespread, and the number of processes in a system may be quite large. Recently, self-stabilizi