rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Capacity-proportional unstructured peer-to-peer networks
  name:
    name part: Reddy, Chandan Rama.
    role:
      role term: creator
  name:
    name part: Loguinov, Dmitri
    role:
      role term: thesis advisor.
  type of resource: text
  genre: bibliography
  origin info:
    place:
      place term: txu
    date issued: 2010
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: remote
    extent: 1 online resource.
  abstract: Existing methods to utilize capacity-heterogeneity in a P2P system either rely on constructing special overlays with capacity-proportional node degree or use topology adaptation to match a node's capacity with that of its neighbors. In existing P2P networks, which are often characterized by diverse node capacities and high churn, these methods may require large node degree or continuous topology adaptation, potentially making them infeasible due to their high overhead. In this thesis, we propose an unstructured P2P system that attempts to address these issues. We first prove that the overall throughput of search queries in a heterogeneous network is maximized if and only if traffic load through each node is proportional to its capacity. Our proposed system achieves this traffic distribution by biasing search walks using the Metropolis-Hastings algorithm, without requiring any special underlying topology. We then define two saturation metrics for measuring the performance of overlay networks: one for quantifying their ability to support random walks and the second for measuring their potential to handle the overhead caused by churn. Using simulations, we finally compare our proposed method with Gia, an existing system which uses topology adaptation, and find that the former performs better under all studied conditions, both saturation metrics, and such end-to-end parameters as query success rate, latency, and query-hits for various file replication schemes.
  note: by Chandan Rama Reddy.
  note: "Major Subject: Computer Engineering"
  note: Title from author supplied metadata (automated record created 2010-11-11 10:17:47).
  note: Electronic resource.
  note: Master of Science Texas A&M University 2009 http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-878
  note: Includes bibliographical references.
  note: Text (Thesis)
  subject:
    topic: Major computer engineering
  subject:
    topic: heterogeneous networks
  subject:
    topic: Metropolis-Hastings algorithm
  subject:
    topic: P2P
  subject:
    topic: random walks
  identifier: http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-878
  record info:
    record content source: TXA
    record creation date: 101130
    record change date: 20151202112934.0
    record identifier: in00002650683