Securing Network Coordinate Systems
Wed, 07/18/2007 - 16:14 by Damien Leroy
Abstract
Many large-scale Internet applications optimize their overlay network to reduce latencies. Embedding coordinate systems like Vivaldi or NPS are valuable tools for this new range of applications since they propose light-weight algorithms that permit to estimate the latency between any pair of nodes without having to contact them first. It has been recently demonstrated that network coordinate systems in general are sensible to attacks. Typically, malicious nodes can lie about their coordinates and distort the coordinate space.
In this work, we propose a formal reputation model to detect misbehaving nodes. The reputation model rely on two new types of nodes, the RCA, a certification agent and the surveyors that monitors nodes. Based on the observation of surveyors, the RCA gives a reputation to each node. The reputation estimates the probability that the node is not malicious. In this work, we propose a new network coordinate system called RVivaldi. RVivaldi is an adaptation of Vivaldi that implements the reputation model.
Based on experiments on RVivaldi, we determine that coordinate systems with reputation are less sensible to attacks than the system without the reputation.
- Authors
- Damien Saucez
- Type
- Master's thesis
- Source
- Université catholique de Louvain, jun 2007.
- Full text
-
(2.05 MB) - Cite it
- BibTex
- Copyright
- See here
IEEE Copyright 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. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
ACM Copyright Notice: Copyright 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page or intial screen of the document. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.
Springer-Verlag LNCS Copyright Notice: The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.