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
Multicast in DKS (N, k, f) overlay networks
KTH, Superseded Departments, Microelectronics and Information Technology, IMIT.
KTH, Superseded Departments, Microelectronics and Information Technology, IMIT.
KTH, Superseded Departments, Microelectronics and Information Technology, IMIT.ORCID iD: 0000-0002-6718-0144
2004 (English)In: Principles Of Distributed Systems / [ed] Papatrianatafilou, M; Hunel, P, 2004, Vol. 3144, 83-95 p.Conference paper, Published paper (Refereed)
Abstract [en]

Recent developments in the area of peer-to-peer computing show that structured overlay networks implementing distributed hash tables scale well and can serve as infrastructures for Internet scale applications. We are developing a family of infrastructures, DKS(N, k, f), for the construction of peer-to-peer applications. An instance of DKS(N, k, f) is an overlay network that implements a distributed hash table and which has a number of desirable properties: low cost of communication, scalability, logarithmic lookup length, fault-tolerance and strong guarantees of locating any data item that was inserted in the system. In this paper, we show how multicast is achieved in DKS(N, k, f) overlay networks. The design presented here is attractive in three main respects. First, members of a multicast group self-organize in an instance of DKS(N,k,f) in a way that allows co-existence of groups of different sizes, degree of fault-tolerance, and maintenance cost, thereby, providing flexibility. Second, each member of a group can multicast, rather than having single source multicast. Third, within a group, dissemination of a multicast message is optimal under normal system operation in the sense that there are no redundant messages despite the presence of outdated routing information.

Place, publisher, year, edition, pages
2004. Vol. 3144, 83-95 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 3144
Keyword [en]
peer-to-peer computing, distributed algorithms, multicast, distributed hash tables
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-44670ISI: 000223641400010Scopus ID: 2-s2.0-35048871122ISBN: 3-540-22667-2 (print)OAI: oai:DiVA.org:kth-44670DiVA: diva2:452100
Conference
7th International Conference on Principles of Distributed Systems (OPODIS 2003) Location: MARTINIQUE Date: DEC 10-13, 2003
Note
QC 20111028Available from: 2011-10-28 Created: 2011-10-25 Last updated: 2011-10-28Bibliographically approved

Open Access in DiVA

No full text

Scopus

Authority records BETA

Haridi, Seif

Search in DiVA

By author/editor
Onana Alima, LucGhodsi, AliHaridi, Seif
By organisation
Microelectronics and Information Technology, IMIT
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 59 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