A placement scheme for peer-to-peer networks based on principles from geometry

Kleis, Michael; Zhou, Xiaoming

doi:10.1109/ptp.2004.1334940

Cited by 9 publications

(13 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A coordinate system must provide an accurate embedding of the internet hosts in a low-dimensional space with a distance metric, with additional requirements for scalability and dynamic adaptation. Coordinates can be evaluated by measuring distances from some special hosts called landmarks, [NZ02,KZ04] 04]. Vivaldi treats the internet as a self-adjusting system of springs, where distances are dynamically updated in a totally distributed fashion, thus avoiding the use of static landmarks that pose scalability and fault-tolerance problems.…”

Section: Overview Of Performance Measurements Techniquesmentioning

confidence: 99%

Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer

Bertasi¹,

Biancoy²,

Pietracaprina³

et al. 2008

IJCIR

View full text Add to dashboard Cite

Abstract:The availability of enormous amounts of un-used computing power and data storage over the In-ternet makes the development of a globally distributed computing platform, called Overlay Computer (OC), at-tractive for the industry, the scientific community, and also the general user. In order to be effective, an OC must be equipped with tools for estimating and optimiz-ing the performance of applications. The tools must rely upon performance metrics of the key factors impacting performance of a distributed application, such as inter-connection latency and bandwidth, and available comput-ing power at the nodes. This paper first reviews the state-of-the-art on performance benchmarking approaches in globally distributed systems, including performance-conscious P2P systems. Later, it addresses the problem of developing a suite of microbenchmarking experiments aimed at providing the basic functionalities of a measurement tool for a P2P-based OC platform.Results show that such a measuring system should take into account the communication patterns generated by the applications in order to provide useful performance insights.

show abstract

Section: Overview Of Performance Measurements Techniquesmentioning

confidence: 99%

Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer

Bertasi¹,

Biancoy²,

Pietracaprina³

et al. 2008

IJCIR

View full text Add to dashboard Cite

show abstract

“…One of the first suggested solutions for network distance estimation with low measurement overhead was IDMaps [ [XSLB05]. In this thesis we will introduce Geometric Cluster Placement (GCP) [KZ04] and Netforecast [EKP07]. Based on the underlying principles used by the schemes mentioned we can do a classification into three main classes, which are:…”

Section: Qos Estimationmentioning

confidence: 99%

“…Before we start with a description of Geometric Cluster Placement [KZ04], we first recall the principle of landmark based distance estimation. For a state of the art with regard to landmark based distance estimation or more general network distance estimation, we refer to section 3.2.…”

Section: Delay Estimation With Geometric Cluster Placementmentioning

confidence: 99%

See 1 more Smart Citation

CSP, Cooperative Service Provisioning Using Peer-to-Peer Principles

Kleis

Büttner

Elmoumouhi

et al.

Self-Organizing Systems

View full text Add to dashboard Cite

There are two main challenges for flexible service provisioning on top of today's Internet. First the end-to-end networking paradigm which is based on a service and data unaware transport, and secondly a lack of high level communication abstractions.With this thesis we approach both challenges. To address the first point we propose a methodology to integrate the Network Provider into the process of service provisioning. The introduced cooperative service provisioning (CSP) enables an interaction between Service Provider, Network Provider and Client. CSP can be applied in classical Provider as well as novel Peerto-Peer scenarios.To address the second point, we adopt a Service Overlay approach. A new method based on the extension of Distributed Hash Tables (DHTs) is proposed to realise a distributed control plane for a decentral and reactive creation of Service Overlays. To archive this, a methodology to reduce Service Overlay related routing problems to search problems was developed. With regard to the required Quality of Service (QoS) measurements, the thesis focuses on scalable and time efficient estimation techniques. As a result, two new delay prediction schemes have been developed which improve estimation accuracy when compared to the state of the art.Furthermore, a novel approach to bandwidth estimation is investigated. It combines methods from landmark based delay estimation with a transformation step and has favourable estimation accuracy.

show abstract

“…While this type of graphs has already been studied in the area of MANETs [15], to the best of our knowledge there is no study in the area of P2P-Networks. To use Yao-Graphs, a mapping function is necessary to accurately embed nodes from the underlying network into a geometric space [8]. In this paper we are using the Highways [11] proximity clustering scheme, introduced by one of the authors, to assign accurate geometric co-ordinates to nodes.…”

Section: Introductionmentioning

confidence: 99%