The Experts below are selected from a list of 18090126 Experts worldwide ranked by ideXlab platform

Zheng Yan - One of the best experts on this subject based on the ideXlab platform.

  • a conceptual architecture of a trusted mobile environment
    International Workshop on Security, 2006
    Co-Authors: Zheng Yan
    Abstract:

    Trust is crucial in mobile communications. How to establish a trusted mobile environment is becoming more and more important for mobile device venders, mobile service providers and mobile networking operators. This paper presents a conceptual architecture towards establishing a trusted mobile environment. The contribution of this paper is a) specifying the architecture of a trusted mobile environment; b) by developing the conceptual architecture, explaining key motivations behind the location of every element in the architecture; and c) evaluating the architecture by applying it into a mobile Peer-to-Peer System.

  • SecPerU - A conceptual architecture of a trusted mobile environment
    Second International Workshop on Security Privacy and Trust in Pervasive and Ubiquitous Computing (SecPerU'06), 1
    Co-Authors: Zheng Yan
    Abstract:

    Trust is crucial in mobile communications. How to establish a trusted mobile environment is becoming more and more important for mobile device venders, mobile service providers and mobile networking operators. This paper presents a conceptual architecture towards establishing a trusted mobile environment. The contribution of this paper is a) specifying the architecture of a trusted mobile environment; b) by developing the conceptual architecture, explaining key motivations behind the location of every element in the architecture; and c) evaluating the architecture by applying it into a mobile Peer-to-Peer System.

Yuanyuan Yang - One of the best experts on this subject based on the ideXlab platform.

  • IPDPS - An efficient hybrid Peer-to-Peer System for distributed data sharing
    2008 IEEE International Symposium on Parallel and Distributed Processing, 2008
    Co-Authors: Min Yang, Yuanyuan Yang
    Abstract:

    Peer-to-Peer overlay networks are widely used in distributed Systems. Based on whether a regular topology is maintained among peers, Peer-to-Peer networks can be divided into two categories: structured peer- to-peer networks in which peers are connected by a regular topology, and unstructured Peer-to-Peer networks in which the topology is arbitrary. Structured Peer-to-Peer networks usually can provide efficient and accurate services but need to spend a lot of efforts in maintaining the regular topology. On the other hand, unstructured Peer-to-Peer networks are extremely resilient to the frequent peer joining and leaving but this is usually achieved at the expense of efficiency. The objective of this work is to design a hybrid Peer-to-Peer System for distributed data sharing which combines the advantages of both types of Peer-to-Peer networks and minimizes their disadvantages. The proposed hybrid Peer-to-Peer System is composed of two parts: the first part is a structured core network which forms the backbone of the hybrid System; the second part is multiple unstructured peer- to-peer networks each of which is attached to a node in the core network. The core structured network can narrow down the data lookup within a certain unstructured network accurately, while the unstructured networks provide a low cost mechanism for peers to join or leave the System freely. A data lookup operation first checks the local unstructured network and then the structured network. This two-tier hierarchy can decouple the flexibility of the System from the efficiency of the System. Our simulation results demonstrate that the hybrid Peer-to-Peer System can utilize both the efficiency of structured Peer-to-Peer network and the flexibility of the unstructured Peer-to-Peer network and achieve a good balance between the two types of networks.

Yann Busnel - One of the best experts on this subject based on the ideXlab platform.

  • PROXSEM: Interest-based Proximity Measure to Improve Search Efficiency in P2P Systems
    2006
    Co-Authors: Yann Busnel
    Abstract:

    Peer-to-Peer file sharing Systems are now at the origin of most of Internet traffic. Improving the performance of such Systems has generated a lot of interest both in industry and academia. More specifically, many approaches focus on the improvement of the query mechanism in such Systems. In a Peer-to-Peer System, peers are connected to a subset of other peers with which they can communicate. Each peer maintains a cache and makes available its contents to the rest of the System. Connecting peers sharing similar interest in the context of a given application has recently been identified as a sound basis to improve the search efficiency. However, capturing such interest-based (or semantic) proximity patterns is a difficult task. Most of current approaches measure this proximity between peers as the overlap between their cache contents. Given the well-known popularity patterns of Peer-to-Peer file sharing Systems, the overlap between cache contents of two peers may not reflect accurately their semantic proximity. More specifically, this measure depends upon peer generosity and file popularity. In this poster, we propose a refined proximity measure taking into account these factors. We evaluated the proposed solution by simulation against a real Peer-to-Peer System (eDonkey) workload. We obtain results which shown the effectiveness of the proposed approach: taking into account file popularity increases the one hop hit ratio (23 \% of success against 1\% for random search and 17 \% for overlap size measure); taking into account peer generosity balances generous nodes load (the maximum in-degree of the network is 990 against 1702 with overlap strategy). While peers generosity can easily be computed locally, file popularity may require a global knowledge of the System. We also propose in this study an epidemic algorithm to compute in a fully decentralised way an estimation of files popularity.

  • integrating file popularity and peer generosity in proximity measure for semantic based overlays
    2005
    Co-Authors: Yann Busnel, Anne-marie Kermarrec
    Abstract:

    Peer-to-Peer file sharing Systems are now at the origin of most of Internet traffic. Improving the performance of such Systems has generated a lot of interest both in industry and academia. More specifically, many approaches focus on the improvement of the query mechanism in such Systems. In a Peer-to-Peer System, peers are connected to a subset of other peers with which they can communicate. Each peer maintains a cache and makes available its contents to the rest of the System. Connecting peers sharing similar interest in the context of a given application has recently been identified as a sound basis to improve the search efficiency. However, capturing such interest-based (or semantic) proximity patterns is a difficult task. Most of current approaches measure this proximity between peers as the overlap between their cache contents. Given the well-known popularity patterns of Peer-to-Peer file sharing Systems, the overlap between cache contents of two peers may not reflect accurately their semantic proximity. More specifically, this measure depends upon peer generosity and file popularity. In this paper we propose a refined proximity measure taking into account these factors. We evaluated the proposed solution by simulation against a real Peer-to-Peer System (eDonkey) workload and results show the effectiveness of the proposed approach. While peers generosity can easily be computed locally, file popularity may require a global knowledge of the System. We also propose in this paper an epidemic algorithm to compute in a fully decentralised fashion an estimation of files popularity. // Ce rapport presente une mesure de proximite semantique permettant de prendre en compte les effets de bords induits par la generosite des noeuds et la popularite des fichiers d'un Systeme de partage de fichiers. Cette mesure est introduite dans un protocole epidemique permettant la comparaison des resultats obtenus. De plus, ce rapport introduit une approche epidemique d'evaluation locale de la popularite d'un fichier.

  • Integrating File Popularity and Peer Generosity in Proximity Measure for Semantic-based Overlays
    2005
    Co-Authors: Yann Busnel, Anne-marie Kermarrec
    Abstract:

    Peer-to-Peer file sharing Systems are now at the origin of most of Internet traffic. Improving the performance of such Systems has generated a lot of interest both in industry and academia. More specifically, many approaches focus on the improvement of the query mechanism in such Systems. In a Peer-to-Peer System, peers are connected to a subset of other peers with which they can communicate. Each peer maintains a cache and makes available its contents to the rest of the System. Connecting peers sharing similar interest in the context of a given application has recently been identified as a sound basis to improve the search efficiency. However, capturing such interest-based (or semantic) proximity patterns is a difficult task. Most of current approaches measure this proximity between peers as the overlap between their cache contents. Given the well-known popularity patterns of Peer-to-Peer file sharing Systems, the overlap between cache contents of two peers may not reflect accurately their semantic proximity. More specifically, this measure depends upon peer generosity and file popularity. In this paper we propose a refined proximity measure taking into account these factors. We evaluated the proposed solution by simulation against a real Peer-to-Peer System (eDonkey) workload and results show the effectiveness of the proposed approach. While peers generosity can easily be computed locally, file popularity may require a global knowledge of the System. We also propose in this paper an epidemic algorithm to compute in a fully decentralised fashion an estimation of files popularity.

  • Integrating File Popularity and Peer Generosity in Proximity Measure for Semantic-based Overlays
    2005
    Co-Authors: Yann Busnel, Anne-marie Kermarrec
    Abstract:

    Peer-to-Peer file sharing Systems are now at the origin of most of Internet traffic. Improving the performance of such Systems has generated a lot of interest both in industry and academia. More specifically, many approaches focus on the improvement of the query mechanism in such Systems. In a Peer-to-Peer System, peers are connected to a subset of other peers with which they can communicate. Each peer maintains a cache and makes available its contents to the rest of the System. Connecting peers sharing similar interest in the context of a given application has recently been identified as a sound basis to improve the search efficiency. However, capturing such interest-based (or semantic) proximity patterns is a difficult task. Most of current approaches measure this proximity between peers as the overlap between their cache contents. Given the well-known popularity patterns of Peer-to-Peer file sharing Systems, the overlap between cache contents of two peers may not reflect accurately their semantic proximity. More specifically, this measure depends upon peer generosity and file popularity. In this paper we propose a refined proximity measure taking into account these factors. We evaluated the proposed solution by simulation against a real Peer-to-Peer System (eDonkey) workload and results show the effectiveness of the proposed approach. While peers generosity can easily be computed locally, file popularity may require a global knowledge of the System. We also propose in this paper an epidemic algorithm to compute in a fully decentralised fashion an estimation of files popularity. // Ce rapport présente une mesure de proximité sémantique permettant de prendre en compte les effets de bords induits par la générosité des noeuds et la popularité des fichiers d'un système de partage de fichiers. Cette mesure est introduite dans un protocôle épidémique permettant la comparaison des résultats obtenus. De plus, ce rapport introduit une approche épidémique d'évaluation locale de la popularité d'un fichier.

Anne-marie Kermarrec - One of the best experts on this subject based on the ideXlab platform.

  • integrating file popularity and peer generosity in proximity measure for semantic based overlays
    2005
    Co-Authors: Yann Busnel, Anne-marie Kermarrec
    Abstract:

    Peer-to-Peer file sharing Systems are now at the origin of most of Internet traffic. Improving the performance of such Systems has generated a lot of interest both in industry and academia. More specifically, many approaches focus on the improvement of the query mechanism in such Systems. In a Peer-to-Peer System, peers are connected to a subset of other peers with which they can communicate. Each peer maintains a cache and makes available its contents to the rest of the System. Connecting peers sharing similar interest in the context of a given application has recently been identified as a sound basis to improve the search efficiency. However, capturing such interest-based (or semantic) proximity patterns is a difficult task. Most of current approaches measure this proximity between peers as the overlap between their cache contents. Given the well-known popularity patterns of Peer-to-Peer file sharing Systems, the overlap between cache contents of two peers may not reflect accurately their semantic proximity. More specifically, this measure depends upon peer generosity and file popularity. In this paper we propose a refined proximity measure taking into account these factors. We evaluated the proposed solution by simulation against a real Peer-to-Peer System (eDonkey) workload and results show the effectiveness of the proposed approach. While peers generosity can easily be computed locally, file popularity may require a global knowledge of the System. We also propose in this paper an epidemic algorithm to compute in a fully decentralised fashion an estimation of files popularity. // Ce rapport presente une mesure de proximite semantique permettant de prendre en compte les effets de bords induits par la generosite des noeuds et la popularite des fichiers d'un Systeme de partage de fichiers. Cette mesure est introduite dans un protocole epidemique permettant la comparaison des resultats obtenus. De plus, ce rapport introduit une approche epidemique d'evaluation locale de la popularite d'un fichier.

  • Integrating File Popularity and Peer Generosity in Proximity Measure for Semantic-based Overlays
    2005
    Co-Authors: Yann Busnel, Anne-marie Kermarrec
    Abstract:

    Peer-to-Peer file sharing Systems are now at the origin of most of Internet traffic. Improving the performance of such Systems has generated a lot of interest both in industry and academia. More specifically, many approaches focus on the improvement of the query mechanism in such Systems. In a Peer-to-Peer System, peers are connected to a subset of other peers with which they can communicate. Each peer maintains a cache and makes available its contents to the rest of the System. Connecting peers sharing similar interest in the context of a given application has recently been identified as a sound basis to improve the search efficiency. However, capturing such interest-based (or semantic) proximity patterns is a difficult task. Most of current approaches measure this proximity between peers as the overlap between their cache contents. Given the well-known popularity patterns of Peer-to-Peer file sharing Systems, the overlap between cache contents of two peers may not reflect accurately their semantic proximity. More specifically, this measure depends upon peer generosity and file popularity. In this paper we propose a refined proximity measure taking into account these factors. We evaluated the proposed solution by simulation against a real Peer-to-Peer System (eDonkey) workload and results show the effectiveness of the proposed approach. While peers generosity can easily be computed locally, file popularity may require a global knowledge of the System. We also propose in this paper an epidemic algorithm to compute in a fully decentralised fashion an estimation of files popularity.

  • Integrating File Popularity and Peer Generosity in Proximity Measure for Semantic-based Overlays
    2005
    Co-Authors: Yann Busnel, Anne-marie Kermarrec
    Abstract:

    Peer-to-Peer file sharing Systems are now at the origin of most of Internet traffic. Improving the performance of such Systems has generated a lot of interest both in industry and academia. More specifically, many approaches focus on the improvement of the query mechanism in such Systems. In a Peer-to-Peer System, peers are connected to a subset of other peers with which they can communicate. Each peer maintains a cache and makes available its contents to the rest of the System. Connecting peers sharing similar interest in the context of a given application has recently been identified as a sound basis to improve the search efficiency. However, capturing such interest-based (or semantic) proximity patterns is a difficult task. Most of current approaches measure this proximity between peers as the overlap between their cache contents. Given the well-known popularity patterns of Peer-to-Peer file sharing Systems, the overlap between cache contents of two peers may not reflect accurately their semantic proximity. More specifically, this measure depends upon peer generosity and file popularity. In this paper we propose a refined proximity measure taking into account these factors. We evaluated the proposed solution by simulation against a real Peer-to-Peer System (eDonkey) workload and results show the effectiveness of the proposed approach. While peers generosity can easily be computed locally, file popularity may require a global knowledge of the System. We also propose in this paper an epidemic algorithm to compute in a fully decentralised fashion an estimation of files popularity. // Ce rapport présente une mesure de proximité sémantique permettant de prendre en compte les effets de bords induits par la générosité des noeuds et la popularité des fichiers d'un système de partage de fichiers. Cette mesure est introduite dans un protocôle épidémique permettant la comparaison des résultats obtenus. De plus, ce rapport introduit une approche épidémique d'évaluation locale de la popularité d'un fichier.

Roger Wattenhofer - One of the best experts on this subject based on the ideXlab platform.

  • equus a provably robust and locality aware peer to peer System
    International Conference on Peer-to-Peer Computing, 2006
    Co-Authors: Thomas Locher, Stefan Schmid, Roger Wattenhofer
    Abstract:

    Peer-to-Peer Systems (p2p) are highly dynamic in nature. They may consist of millions of peers joining only for a limited period of time, resulting in hundreds of join and leave events per second. In this paper we introduce eQuus, a novel distributed hash table (DHT) suitable for highly dynamic environments. eQuus guarantees that lookups are always fast-- in terms of both the delay and the total number of routing hops--, although peers may join and leave the network at any time and concurrently. 1 Introduction

  • Peer-to-Peer Computing - eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System
    Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06), 1
    Co-Authors: Thomas Locher, Stefan Schmid, Roger Wattenhofer
    Abstract:

    Peer-to-Peer Systems (p2p) are highly dynamic in nature. They may consist of millions of peers joining only for a limited period of time, resulting in hundreds of join and leave events per second. In this paper we introduce eQuus, a novel distributed hash table (DHT) suitable for highly dynamic environments. eQuus guarantees that lookups are always fast-- in terms of both the delay and the total number of routing hops--, although peers may join and leave the network at any time and concurrently. 1 Introduction