Crucial for the performance of peer-to-peer networks based on geometric topologies is the measurement complexity and quality of the mapping function used to map a node in the network to a point in the geometric target space. In this paper we study how results from mathematics as well as data mining can be applied to this mapping problem. Using a metric space model for networks and results from mathematics a relation between the number of nodes to be mapped, the worst case error of the mapping and the dimension of the geometric target space is formulated. As a main result geometric cluster placement (GCP) is presented, an improved and resilient placement algorithm based on GNP. An evaluation of GCP presented is based on measurement data from the RIPE NCC test traffic measurement (TTM) project
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.
Over the last years, the Internet has evolved towards becoming the dominant platform for deploying real time and multimedia services. This evolution has had as a consequence that the selection of an appropriate server, proxy or super node with reference to some specific QoS parameter becomes of paramount importance. We consider in our paper the specific case of delay estimation. An investigation of existing approaches for the estimation and prediction of network delay is provided. Based on that, we further suggest NetForecast as a way to overcome limitations of existing prediction methods. NetForecast is an algorithm for delay prediction in provider controlled networks. The algorithm is based on a combination of landmark-based distance estimation, clustering and a triangulation principle. The paper reports on preliminary performance of NetForecast, as provided by a simulation study. Our results show the feasibility of the suggested method.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.