WEKO3
アイテム
{"_buckets": {"deposit": "4a5ab495-da37-425e-b3f4-c29ea64fc639"}, "_deposit": {"created_by": 4, "id": "4152", "owners": [4], "pid": {"revision_id": 0, "type": "depid", "value": "4152"}, "status": "published"}, "_oai": {"id": "oai:naist.repo.nii.ac.jp:00004152", "sets": ["35"]}, "author_link": ["8462", "36", "109"], "item_7_biblio_info_9": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2018-03-01", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "3", "bibliographicPageEnd": "610", "bibliographicPageStart": "602", "bibliographicVolumeNumber": "E101.D", "bibliographic_titles": [{"bibliographic_title": "IEICE Transactions on Information and Systems", "bibliographic_titleLang": "en"}]}]}, "item_7_description_7": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "We propose an algorithm for the gathering problem of mobile agents in arbitrary networks (graphs) with Byzantine agents. Our algorithm can make all correct agents meet at a single node in O(fm) time (f is the upper bound of the number of Byzantine agents and m is the number of edges) under the assumption that agents have unique ID and behave synchronously, each node is equipped with an authenticated whiteboard, and f is known to agents. Here, the whiteboard is a node memory where agents can leave information. Since the existing algorithm achieves gathering without a whiteboard in O(n9λ) time, where n is the number of nodes and λ is the length of the longest ID, our algorithm shows an authenticated whiteboard can significantly reduce the time for the gathering problem in Byzantine environments.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_7_publisher_10": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "The Institute of Electronics, Information and Communication Engineers", "subitem_publisher_language": "en"}]}, "item_7_relation_17": {"attribute_name": "出版者版DOI", "attribute_value_mlt": [{"subitem_relation_type": "isIdenticalTo", "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://doi.org/10.1587/transinf.2017FCP0008", "subitem_relation_type_select": "DOI"}}]}, "item_7_rights_18": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "c 2018 The Institute of Electronics, Information and Communication Engineers", "subitem_rights_language": "en"}]}, "item_7_source_id_12": {"attribute_name": "EISSN/PISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0916-8532", "subitem_source_identifier_type": "ISSN"}]}, "item_7_source_id_14": {"attribute_name": "書誌レコードID", "attribute_value_mlt": [{"subitem_source_identifier": "AA10826272", "subitem_source_identifier_type": "NCID"}]}, "item_7_text_25": {"attribute_name": "NAIST ID", "attribute_value_mlt": [{"subitem_text_value": "74652124"}, {"subitem_text_value": "73292369"}]}, "item_7_version_type_20": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_access_right": {"attribute_name": "アクセス権", "attribute_value_mlt": [{"subitem_access_right": "open access", "subitem_access_right_uri": "http://purl.org/coar/access_right/c_abf2"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Tsuchida, Masashi", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "8462", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Ooshita, Fukuhito", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "36", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "20362650", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://kaken.nii.ac.jp/ja/search/?qm=20362650"}]}, {"creatorNames": [{"creatorName": "Inoue, Michiko", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "109", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "30273840", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://kaken.nii.ac.jp/ja/search/?qm=30273840"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2023-03-02"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "e101-d_3_602.pdf", "filesize": [{"value": "361.4 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 361400.0, "url": {"label": "fulltext", "objectType": "fulltext", "url": "https://naist.repo.nii.ac.jp/record/4152/files/e101-d_3_602.pdf"}, "version_id": "9cc4a00a-c57a-4c37-96ef-74535e945163"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "mobile agent", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "gathering problem", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Byzantine fault", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards", "subitem_title_language": "en"}]}, "item_type_id": "7", "owner": "4", "path": ["35"], "permalink_uri": "http://hdl.handle.net/10061/12556", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2018-06-22"}, "publish_date": "2018-06-22", "publish_status": "0", "recid": "4152", "relation": {}, "relation_version_is_last": true, "title": ["Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards"], "weko_shared_id": -1}
Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards
http://hdl.handle.net/10061/12556
http://hdl.handle.net/10061/12556e2fff1bc-813b-4c0e-82ea-800235d6d84a
名前 / ファイル | ライセンス | アクション |
---|---|---|
fulltext (361.4 kB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2018-06-22 | |||||
タイトル | ||||||
タイトル | Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | mobile agent | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | gathering problem | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Byzantine fault | |||||
資源タイプ | ||||||
資源タイプ | journal article | |||||
アクセス権 | ||||||
アクセス権 | open access | |||||
著者 |
Tsuchida, Masashi
× Tsuchida, Masashi× Ooshita, Fukuhito× Inoue, Michiko |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | We propose an algorithm for the gathering problem of mobile agents in arbitrary networks (graphs) with Byzantine agents. Our algorithm can make all correct agents meet at a single node in O(fm) time (f is the upper bound of the number of Byzantine agents and m is the number of edges) under the assumption that agents have unique ID and behave synchronously, each node is equipped with an authenticated whiteboard, and f is known to agents. Here, the whiteboard is a node memory where agents can leave information. Since the existing algorithm achieves gathering without a whiteboard in O(n9λ) time, where n is the number of nodes and λ is the length of the longest ID, our algorithm shows an authenticated whiteboard can significantly reduce the time for the gathering problem in Byzantine environments. | |||||
書誌情報 |
en : IEICE Transactions on Information and Systems 巻 E101.D, 号 3, p. 602-610, 発行日 2018-03-01 |
|||||
出版者 | ||||||
出版者 | The Institute of Electronics, Information and Communication Engineers | |||||
EISSN/PISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 0916-8532 | |||||
出版者版DOI | ||||||
関連タイプ | isIdenticalTo | |||||
識別子タイプ | DOI | |||||
関連識別子 | https://doi.org/10.1587/transinf.2017FCP0008 | |||||
書誌レコードID | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AA10826272 | |||||
権利 | ||||||
権利情報 | c 2018 The Institute of Electronics, Information and Communication Engineers | |||||
著者版フラグ | ||||||
出版タイプ | VoR |