Lighthouses for Scalable Distributed Location

Pias, Marcelo; Crowcroft, Jon; Wilbur, Steve; Harris, Timothy L.; Bhatti, Saleem N.

doi:10.1007/978-3-540-45172-3_26

Cited by 144 publications

(118 citation statements)

References 14 publications

Supporting

Mentioning

117

Contrasting

Unclassified

Order By: Relevance

“…Landmark-based systems rely on infrastructure components (such as a set of landmark servers) to predict distance between any two hosts. The set of landmarks can be pre-determined [17,26,27] or randomly selected [28,35]. Decentralized virtual coordinate systems do not rely on explicitly designated infrastructure components, requiring any node in the system to act as a reference node.…”

Section: Virtual Coordinate Systemsmentioning

confidence: 99%

Securing Application-Level Topology Estimation Networks: Facing the Frog-Boiling Attack

Becker

Seibert

Nita-Rotaru

et al. 2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Peer-to-peer real-time communication and media streaming applications optimize their performance by using application-level topology estimation services such as virtual coordinate systems. Virtual coordinate systems allow nodes in a peer-to-peer network to accurately predict latency between arbitrary nodes without the need of performing extensive measurements. However, systems that leverage virtual coordinates as supporting building blocks, are prone to attacks conducted by compromised nodes that aim at disrupting, eavesdropping, or mangling with the underlying communications. Recent research proposed techniques to mitigate basic attacks (inflation, deflation, oscillation) considering a single attack strategy model where attackers perform only one type of attack. In this work we explore supervised machine learning techniques to mitigate more subtle yet highly effective attacks (frog-boiling, network-partition) that are able to bypass existing defenses. We evaluate our techniques on the Vivaldi system against a more complex attack strategy model, where attackers perform sequences of all known attacks against virtual coordinate systems, using both simulations and Internet deployments.

show abstract

Section: Virtual Coordinate Systemsmentioning

confidence: 99%

Securing Application-Level Topology Estimation Networks: Facing the Frog-Boiling Attack

Becker

Seibert

Nita-Rotaru

et al. 2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…However, owing to its use of simplex downhill to solve a multidimensional nonlinear minimization problem for error minimization, GNP incurs high computational overhead unless an application can effectively amortize it. Subsequent approaches [3,25,28] have dealt with a number of important issues such as security and landmark load but used the same underlying estimation principle.…”

Section: Related Workmentioning

confidence: 99%

“…King [9] has a unique ability to estimate distance between uncooperative hosts, even if they do not respond to probes. Coordinate-based techniques [26,25,28,19,31,3,4] map hosts to points in a metric space. These techniques are especially well-suited in applications that reuse host coordinates for multiple tasks since these tasks can be accomplished without further costs.…”

Section: Introductionmentioning

confidence: 99%

Dynamic landmark triangles: A simple and efficient mechanism for inter-host latency estimation

Wen

Rabinovich

2011

Computer Networks

View full text Add to dashboard Cite

This paper describes a simple and efficient approach to estimate the network latency between arbitrary Internet hosts. We use three landmark hosts forming a triangle in two-dimensional space to estimate the distance between arbitrary hosts with simple trigonometrical calculations. To improve the accuracy of estimation, we dynamically choose the "best" triangle for a given pair of hosts using a heuristic algorithm. Experiments using several data sets of measured host-pair latencies, as well as a live Internet study, demonstrate the accuracy and efficiency of our approach.

show abstract

“…In the first step, we model the internet as a geometric space and compute the coordinates of nodes in a d-dimensional Cartesian space, using GNP [3] or other techniques [20] [11]. Then in the second step, the LexID of each node is generated by mapping from its coordinates to a circular ID space.…”

Section: Lexicographic Id Generationmentioning

confidence: 99%

Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning

Shi

Yang

Wang

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract-This paper discusses large scale keyword searching on top of peer-to-peer (P2P) networks. The state-of-the-art keyword searching techniques for unstructured and structured P2P systems are query flooding and inverted list intersection respectively. However, it has been demonstrated that P2P-based large scale full-text searching is not feasible by using either of the two techniques. We propose in this paper a new index partitioning and building scheme, multi-level partitioning (MLP), and discuss its implementation on top of P2P networks. MLP can dramatically reduce bisection bandwidth and end-user latency compared to the partition-by-keyword scheme. And compare to partition-bydocument, it need only broadcast a query to moderate number of peers to generate precise results.

show abstract

Lighthouses for Scalable Distributed Location

Cited by 144 publications

References 14 publications

Securing Application-Level Topology Estimation Networks: Facing the Frog-Boiling Attack

Securing Application-Level Topology Estimation Networks: Facing the Frog-Boiling Attack

Dynamic landmark triangles: A simple and efficient mechanism for inter-host latency estimation

Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning

Contact Info

Product

Resources

About