Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Efficient broadcast in structured P2P networks
Swedish Institute of Computer Science.
KTH, Superseded Departments, Microelectronics and Information Technology, IMIT.
Swedish Institute of Computer Science.
KTH, Superseded Departments, Microelectronics and Information Technology, IMIT.ORCID iD: 0000-0002-6718-0144
2003 (English)In: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 2735, 304-314 p.Article in journal (Refereed) Published
Abstract [en]

In this position paper, we present an efficient algorithm for performing a broadcast operation with minimal cost in structured DHT-based P2P networks. In a system of N nodes, a broadcast message originating at an arbitrary node reaches all other nodes after exactly N - 1 messages. We emphasize the perception of a class of DHT systems as a form of distributed k-ary search and we take advantage of that perception in constructing a spanning tree that is utilized for efficient broadcasting. We consider broadcasting as a basic service that adds to existing DHTs the ability to search using arbitrary queries as well as dissiminate/collect global information.

Place, publisher, year, edition, pages
2003. Vol. 2735, 304-314 p.
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:kth:diva-25088ISI: 000185936300027OAI: oai:DiVA.org:kth-25088DiVA: diva2:355727
Note
QC 20101008. Ingår i 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03), BERKELEY, CALIFORNIA, FEB 21-22, 2003.Available from: 2010-10-08 Created: 2010-10-08 Last updated: 2017-12-12Bibliographically approved
In thesis
1. Designs and analyses in structured peer-to-peer systems
Open this publication in new window or tab >>Designs and analyses in structured peer-to-peer systems
2005 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Peer-to-Peer (P2P) computing is a recent hot topic in the areas of networking and distributed systems. Work on P2P computing was triggered by a number of ad-hoc systems that made the concept popular. Later, academic research efforts started to investigate P2P computing issues based on scientific principles. Some of that research produced a number of structured P2P systems that were collectively referred to by the term ``Distributed Hash Tables'' (DHTs). However, the research occurred in a diversified way leading to the appearance of similar concepts yet lacking a common perspective and not heavily analyzed. In this thesis we present a number of papers representing our research results in the area of structured P2P systems grouped as two sets labeled respectively ``Designs'' and ``Analyses''.

The contribution of the first set of papers is as follows. First, we present the principle of distributed k-ary search (DKS) and argue that it serves as a framework for most of the recent P2P systems known as DHTs. That is, given the DKS framework, understanding existing DHT systems is done simply by seeing how they are instances of that framework. We argue that by perceiving systems as instances of the DKS framework, one can optimize some of them. We illustrate that by applying the framework to the Chord system, one of the most established DHT systems. Second, We show how the DKS framework helps in the design of P2P algorithms by two examples: (a) The DKS(n;k;f) system which is a system designed from the beginning on the principles of distributed k-ary search. (b) Two broadcast algorithms that take advantage of the distributed k-ary search tree.

The contribution of the second set of papers is as follows. We account for two approaches that we used to evaluate the performance of a particular class of DHTs, namely the one adopting periodic stabilization for topology maintenance. The first approach was of an intrinsic empirical nature. In that approach, we tried to perceive a DHT as a physical system and account for its properties in a size-independent manner. The second approach was of a more analytical nature. In this approach we applied the technique of Master equations, which is a widely used technique in the analysis of natural systems. The application of the technique lead to a highly accurate description of the behavior of structured overlays.

Additionally, the thesis contains a primer on structured P2P systems that tries to capture the main ideas that are prevailing in the field and enumerates a subset of the current hot and open research issues.

Place, publisher, year, edition, pages
Stockholm: KTH, 2005. 229 p.
Series
Trita-IMIT. LECS, ISSN 1651-4076 ; 05:02
Series
SICS Dissertation Series, ISSN 1101-1335 ; 38
Keyword
Datorsystem, Datorsystem
National Category
Computer Engineering
Identifiers
urn:nbn:se:kth:diva-264 (URN)
Public defence
2005-06-10, Sal D, KTH Forum, 10:00
Opponent
Supervisors
Note
QC 20101008Available from: 2005-06-07 Created: 2005-06-07 Last updated: 2010-10-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Lecture Notes in Computer Science

Authority records BETA

Haridi, Seif

Search in DiVA

By author/editor
El-Ansary, SamehOnana Alima, LucBrand, PerHaridi, Seif
By organisation
Microelectronics and Information Technology, IMIT
In the same journal
Lecture Notes in Computer Science
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 290 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf