WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Some remarks on distributed depth-first search
Information Processing Letters
Distributed distance measurement for large-scale networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Proceedings of the Ninth Conference on Foundations of Software Technology and Theoretical Computer Science
Peer Pressure: Distributed Recovery from Attacks in Peer-to-Peer Systems
Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
You Can Run, But You Can't Hide: An Effective Methodology to Traceback DDoS Attackers
MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Sketch-based change detection: methods, evaluation, and applications
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
On the Cost-Quality Tradeoff in Topology-Aware Overlay Path Probing
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Exploiting Routing Redundancy via Structured Peer-to-Peer Overlays
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Locating internet bottlenecks: algorithms, measurements, and implications
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Denial-of-service resilience in peer-to-peer file sharing systems
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A Distributed Approach to Node Clustering in Decentralized Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Towards an evolvable internet architecture
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
On the Effectiveness of Secure Overlay Forwarding Systems under Intelligent Distributed DoS Attacks
IEEE Transactions on Parallel and Distributed Systems
Resilience in Overlay Multicast Protocols
MASCOTS '06 Proceedings of the 14th IEEE International Symposium on Modeling, Analysis, and Simulation
RBP: robust broadcast propagation in wireless networks
Proceedings of the 4th international conference on Embedded networked sensor systems
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
Optimizing overlay topology by reducing cut vertices
Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video
Scalability of network-failure resilience: analysis using multi-layer probabilistic graphical models
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In large-scale, self-organized distributed systems, such as peer-to-peer (P2P) overlays and wireless sensor networks (WSN), a small proportion of the nodes are likely to be more critical to the system's reliability than others. This paper focuses on detecting cut vertices so that we can either neutralize or protect these critical nodes. Detection of cut vertices is trivial if the global knowledge of the whole system is known but it is very challenging when the global knowledge is not available. In this paper, we propose a completely distributed scheme where every single node can determine whether it is a cut vertex or not. In addition, our design can also confine the detection overhead to a constant instead of being proportional to the size of a network. The correctness of this algorithm is theoretically proved and the key performance gains are measured and verified through trace-driven simulations.