{"updated":"2025-01-19T10:14:16.706110+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00233031","sets":["1164:4088:11480:11520"]},"path":["11520"],"owner":"44499","recid":"233031","title":["Rerouting Tip Algorithm to Bypass Conflicting Transactions in Tangle"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-03-05"},"_buckets":{"deposit":"1af04394-d556-48ba-9653-fadc1d3f633d"},"_deposit":{"id":"233031","pid":{"type":"depid","value":"233031","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Rerouting Tip Algorithm to Bypass Conflicting Transactions in Tangle","author_link":["632011","632013","632012","632014"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Rerouting Tip Algorithm to Bypass Conflicting Transactions in Tangle"},{"subitem_title":"Rerouting Tip Algorithm to Bypass Conflicting Transactions in Tangle","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"IA-B","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2024-03-05","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Kyoto University"},{"subitem_text_value":"Kyoto University"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"Kyoto 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/233031/files/IPSJ-IOT24064011.pdf","label":"IPSJ-IOT24064011.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-IOT24064011.pdf","filesize":[{"value":"1.2 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"43"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"e4a4d779-69ae-4933-9a6f-1b01adc8fcb7","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Changle, Wan"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kazuyuki, Shudo"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Changle, Wan","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kazuyuki, Shudo","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12326962","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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8787","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"In the Tangle-based [1] network, each tip (defined as unconfirmed blocks in Tangle) has to select at least two former blocks as their parent blocks and verify their validity. The probability of a newly generated tip detecting conflicting transactions could be low due to the parallel structure of the Tangle network. In the original Tangle network, the double-spending transactions are mainly handled by a kind of special block called Milestone generated by Coordinator, which is run by the IOTA foundation. In conclusion, the Tangle network could be quite centralized and TPS depends on the generating speed of Milestone. Here, we propose a new kind of tip called Rerouting tip. It is generated by normal nodes who detect a transaction that is conflicting with an existing transaction and run a process called Rerouting tip algorithm. The rerouting tip algorithm would rewrite the parent list of those blocks connected directly to the conflicting transaction and therefore bypass the conflicting transaction without Milestone’s confirmation. Which could help with improving the decentralization of the Tangle network.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In the Tangle-based [1] network, each tip (defined as unconfirmed blocks in Tangle) has to select at least two former blocks as their parent blocks and verify their validity. The probability of a newly generated tip detecting conflicting transactions could be low due to the parallel structure of the Tangle network. In the original Tangle network, the double-spending transactions are mainly handled by a kind of special block called Milestone generated by Coordinator, which is run by the IOTA foundation. In conclusion, the Tangle network could be quite centralized and TPS depends on the generating speed of Milestone. Here, we propose a new kind of tip called Rerouting tip. It is generated by normal nodes who detect a transaction that is conflicting with an existing transaction and run a process called Rerouting tip algorithm. The rerouting tip algorithm would rewrite the parent list of those blocks connected directly to the conflicting transaction and therefore bypass the conflicting transaction without Milestone’s confirmation. Which could help with improving the decentralization of the Tangle network.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"5","bibliographic_titles":[{"bibliographic_title":"研究報告インターネットと運用技術（IOT）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-03-05","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"11","bibliographicVolumeNumber":"2024-IOT-64"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:34:14.207553+00:00","id":233031,"links":{}}