Crown: An efficient and stable distributed resource lookup protocol

T. I. Wang, K. H. Tsai, Y. H. Lee

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Citations (Scopus)

Abstract

This paper modifies the Chord protocol and results in a new resource lookup protocol, the Crown protocol, which is suitable for mobile and wireless network environment. In Chord, all peers are connected to form a single ring topology, while Crown protocol adds concept of group and expands the ring to a group-ring. Besides, Crown adds a replica mechanism and a fault-recovery mechanism to strengthen the group-ring topology, and enhances the availability and reliability of resources. The group-ring concept makes the whole topology more stable when peers join or leave frequently.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsLaurence T. Yang, Minyi Guo, Guang R. Gao, Niraj K. Jha
PublisherSpringer Verlag
Pages1075-1084
Number of pages10
ISBN (Print)354022906X, 9783540229063
DOIs
Publication statusPublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3207
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Crown: An efficient and stable distributed resource lookup protocol'. Together they form a unique fingerprint.

Cite this