Sciweavers

    39 search results - page 3 / 8
    » Discovering Network Topology in the Presence of Byzantine Fa...
    Sort
    View
    WDAG
    2007
    Springer
    73views Algorithms» more  WDAG 2007»
    On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
    14 years 11 days ago
    On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
    Download  www.cs.huji.ac.il
    Consider a distributed network of n nodes that is connected to a global source of “beats”. All nodes receive the “beats” simultaneously, and operate in lock-step. A scheme ...
    Danny Dolev, Ezra N. Hoch
    claim paper
    Read More »
    COMSUR
    2011
    203views Hardware» more  COMSUR 2011»
    Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and Algorithmic Approaches for Tolerating Malicious In
    12 years 6 months ago
    Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and Algorithmic Approaches for Tolerating Malicious In
    Download  www.cs.uwaterloo.ca
    Interference is an unavoidable property of the wireless communication medium and, in sensor networks, such interference is exacerbated due to the energy-starved nature of the netw...
    Maxwell Young, Raouf Boutaba
    claim paper
    Read More »
    LCN
    2005
    IEEE
    94views Computer Networks» more  LCN 2005»
    Fault Tolerant Active Rings for Structured Peer-to-Peer Overlays
    13 years 12 months ago
    Fault Tolerant Active Rings for Structured Peer-to-Peer Overlays
    Download  www.ee.unsw.edu.au
    Algorithms by which peers join and leave structured overlay networks can be classified as passive or active. Passive topology maintenance relies on periodic background repair of n...
    John Risson, Ken Robinson, Tim Moors
    claim paper
    Read More »
    PODC
    2012
    ACM
    230views Distributed and Parallel Com...» more  PODC 2012»
    Byzantine broadcast in point-to-point networks using local linear coding
    11 years 8 months ago
    Byzantine broadcast in point-to-point networks using local linear coding
    Download  www.crhc.illinois.edu
    The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
    Guanfeng Liang, Nitin H. Vaidya
    claim paper
    Read More »
    PODC
    2012
    ACM
    215views Distributed and Parallel Com...» more  PODC 2012»
    Iterative approximate byzantine consensus in arbitrary directed graphs
    11 years 8 months ago
    Iterative approximate byzantine consensus in arbitrary directed graphs
    Download  www.crhc.illinois.edu
    This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
    Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.