{"updated":"2025-01-22T15:14:48.829802+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00034355","sets":["1164:2836:2852:2855"]},"path":["2855"],"owner":"1","recid":"34355","title":["グローバルクロックを用いた大規模グループ通信プロトコル"],"pubdate":{"attribute_name":"公開日","attribute_value":"2005-06-02"},"_buckets":{"deposit":"93523d46-440d-46c8-bab1-9cbecbc2d1e0"},"_deposit":{"id":"34355","pid":{"type":"depid","value":"34355","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"グローバルクロックを用いた大規模グループ通信プロトコル","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"グローバルクロックを用いた大規模グループ通信プロトコル"},{"subitem_title":"A Scalable Group Communication Protocol with Global Clock","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2005-06-02","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京電機大学"},{"subitem_text_value":"東京電機大学"},{"subitem_text_value":"立正大学"},{"subitem_text_value":"東京電機大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Tokyo Denki University","subitem_text_language":"en"},{"subitem_text_value":"Tokyo Denki University","subitem_text_language":"en"},{"subitem_text_value":"Rissho University","subitem_text_language":"en"},{"subitem_text_value":"Tokyo Denki University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/34355/files/IPSJ-DPS05123001.pdf"},"date":[{"dateType":"Available","dateValue":"2007-06-02"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DPS05123001.pdf","filesize":[{"value":"175.2 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"34"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"1468f7c8-b04d-4917-91d0-24da1c9dc176","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2005 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"西村, 豪"},{"creatorName":"林原, 尚浩"},{"creatorName":"榎戸, 智也"},{"creatorName":"滝沢, 誠"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takshi, Nishimura","creatorNameLang":"en"},{"creatorName":"Naohiro, Hayashibara","creatorNameLang":"en"},{"creatorName":"Tomoya, Enokido","creatorNameLang":"en"},{"creatorName":"Makoto, Takizawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10116224","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"P2Pアプリケーションでは多数の対等なプロセスが協調動作している。プロセスが広域に分散された大規模グループではベクタ時計による因果順序付けは、通信と処理の点で困難である。各ローカルネットワーク内の各コンピュータは、自身の時計をGPS時刻サーバとNTPを用いて時刻同期できる。本論文では実時間を用いたメッセージの因果順序付け方法を提案する。実時間を用いて因果順序付けを行えない場合にも、線形時計を用いることにより、順序付けることにより、不要に順序付けが行われることを検出する。順序付けが行われるメッセージ数を評価し、本方式により線形時計にして不要な順序付けを減少できることを提案する。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In peer-to-peer (P2P) applications, large number of peer processes are cooperating. In this paper, we discuss a scalable group of processes where processes are widely distributed in networks. Clocks of computers in every local network are synchronized by using the network time protocol (NTP) with a GPS time server. We discuss a global clock group (GCG) protocol where messages are causally ordered by using the physical time stamps. Messages not to be ordered by physical clock are furthermore ordered by using linear clock. We evaluate the protocol in terms of the number of messages ordered compared with the vector clock.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告マルチメディア通信と分散処理（DPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2005-06-02","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"58(2005-DPS-123)","bibliographicVolumeNumber":"2005"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:02:57.808310+00:00","id":34355,"links":{}}