Virtual landmarks for the internet

Tang, Liying; Crovella, Mark

doi:10.1145/948205.948223

Cited by 220 publications

(189 citation statements)

References 25 publications

Supporting

Mentioning

185

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

“…This approach generates O(#servers 3 ) total network traffic and therefore only scales to small networks. As an alternative, MEDYM can utilize state-of-the-art techniques [16] [22] to approximately estimate server locations with much lower overhead. Note that inaccurate server location information or even inconsistent information across servers does not affect the correctness of dynamic multicast, which is guaranteed by the routing invariants.…”

Section: Server Statesmentioning

confidence: 99%

“…In Section 5, we present experimental results of using both probing and the available GNP estimation service [16]. More detailed simulation results of using [22] can be found in [5].…”

Section: Server Statesmentioning

confidence: 99%

MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks

Cao

Singh

2005

Middleware 2005

View full text Add to dashboard Cite

Abstract. Design of distributed architectures for content-based publishsubscribe (pub-sub) service networks has been a challenging problem. To best support the highly dynamic and diversified content-based pub-sub communication, we propose a new architectural design called MEDYM -Match-Early with DYnamic Multicast. MEDYM follows the End-to-End distributed system design principle. It decouples a pub-sub service into two functionalities: complex, application-specific matching at network edge, and simple, generic multicast routing in the network. This architecture achieves low computation cost in event matching and high network efficiency and flexibility in event routing. For higher scalability, we describe a novel approach to extend MEDYM to a hierarchy structure called H-MEDYM, which effectively balances the trade-off between event delivery efficiency and server states maintenance. We evaluate MEDYM and H-MEDYM using detailed simulations and real-world experiments, and compare them with major existing design approaches. Results show that MEDYM and H-MEDYM achieve high event delivery efficiency and system scalability, and their advantages are most prominent when user subscriptions are highly selective and diversified.

show abstract

“…Since in standard DHT an object is randomly hashed to a single id (or a few id's, if replicated using several hash functions) in the id space, the node(s) responsible for storing or answering queries for that object can be overwhelmed by a "flash crowd," creating a "hot spot" in the system. Recent research [7,12,2] has shown that Internet hosts can be efficiently (i.e., without excessive measurements) mapped to a virtual (Euclidean) coordinate system, such that the geometric distance between any two nodes in the virtual space accurately approximates their real IP network distance (latency). For example, [7] shows that with an 8-dimension virtual space, more than 90% of inter-nodal distances in the virtual space are within 50% error margin of their real network distances.…”

Section: Introductionmentioning

confidence: 99%

“…Recent research [7,12,2] has shown that Internet hosts can be efficiently (i.e., without excessive measurements) mapped to a virtual (Euclidean) coordinate system, where the geometric distance between any two nodes in this virtual space approximates their real IP network distance (latency). Based on this result, in this paper, we propose an alternative approach that inherently incorporates a virtual coordinate system into a P2P network.…”

mentioning

confidence: 99%

Leopard: A Locality Aware Peer-to-Peer System with No Hot Spot

Lee

2005

NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile A

View full text Add to dashboard Cite

Abstract. Recent research [7,12,2] has shown that Internet hosts can be efficiently (i.e., without excessive measurements) mapped to a virtual (Euclidean) coordinate system, where the geometric distance between any two nodes in this virtual space approximates their real IP network distance (latency). Based on this result, in this paper, we propose an alternative approach that inherently incorporates a virtual coordinate system into a P2P network. In our system, called Leopard, a node is assigned a coordinate in the so-called node geo space as it joins the network, and obtains neighbor relationships that reflects network proximity from the beginning. The object id space and the node geo space are then "weaved" together via a novel technique called geographically-scoped hashing. Through analysis and simulation, we show three major desirable properties of Leopard to exemplify the power of this paradigm shift: i) a constant routing stretch, i.e., IP level network latency of object look-up is proportional to the distance between a requesting node and the target object; ii) always locates a near-by copy when multiple copies exist; and iii) effectively handles "flash crowd" traffic with near optimal load balancing.

show abstract

Virtual landmarks for the internet

Cited by 220 publications

References 25 publications

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

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

MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks

Leopard: A Locality Aware Peer-to-Peer System with No Hot Spot

Contact Info

Product

Resources

About