Anonymous stabilizing leader election using a network sequencer

Material type: 文書・図像類

Author: Wiesmann, Matthiasほか

Publisher: 北陸先端科学技術大学院大学情報科学研究科

Publication date: 2006-11-28

Material Format: Digital

Capacity, size, etc.: -

NDC: -

View All

Notes on use

Note (General)：: In this paper, we present an anonymous, stable, communication efficient, stabilizing leader election algorithm that works using anonymous communicatio...

Search by Bookstore

Holdings of Libraries in Japan

This page shows libraries in Japan other than the National Diet Library that hold the material.

List of Cooperating Institutions and Databases

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

JAIST Repository
Digital
You can check the holdings of institutions and databases with which Institutional Repositories DataBase(IRDB)(Institutional Repository) is linked at the site of Institutional Repositories DataBase(IRDB)(Institutional Repository).
JAIST Repository

Search by Bookstore

Bibliographic Record

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Digital

Material Type: 文書・図像類
Title: Anonymous stabilizing leader election using a network sequencer
Author/Editor: Wiesmann, Matthias
Defago, Xavier
Author Heading: Wiesmann, Matthias
Defago, Xavier
Publication, Distribution, etc.: 北陸先端科学技術大学院大学情報科学研究科
Publication Date: 2006-11-28
Publication Date (W3CDTF): 2006-11-28
Periodical title: Research report (School of Information Science, Japan Advanced Institute of Science and Technology)
No. or year of volume/issue: IS-RR-2006-017
Volume: IS-RR-2006-017
Pages: 1-8
ISSN (Periodical Title): ISSN : 0918-7553
Text Language Code: eng
Target Audience: 一般
Note (General): In this paper, we present an anonymous, stable, communication efficient, stabilizing leader election algorithm that works using anonymous communication primitives. The algorithm offers properties similar to that of the Ω failure detector, with the added property of totally ordering the sequence of proposed leaders. The algorithm does not need to know beforehand the identity or the number of processes in the system, and operates using a constant amount of memory. We present the algorithm, discuss performance issues and optimizations and present experimental results of a prototype implementation.
リサーチレポート（北陸先端科学技術大学院大学情報科学研究科）
identifier:https://dspace.jaist.ac.jp/dspace/handle/10119/4795
Access Restrictions: 限定公開
Data Provider (Database): 国立情報学研究所 : 学術機関リポジトリデータベース（IRDB）（機関リポジトリ）
https://irdb.nii.ac.jp
Original Data Provider (Database): 北陸先端科学技術大学院大学 : JAIST学術研究成果リポジトリ