{"links":{},"id":10482,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00010482","sets":["581:625:627"]},"path":["627"],"owner":"1","recid":"10482","title":["An Efficient Overlay Multicast Protocol for Heterogeneous Users"],"pubdate":{"attribute_name":"公開日","attribute_value":"2005-11-15"},"_buckets":{"deposit":"fdbf23c0-cae1-4298-adcc-d84a449f4d34"},"_deposit":{"id":"10482","pid":{"type":"depid","value":"10482","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"An Efficient Overlay Multicast Protocol for Heterogeneous Users","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"An Efficient Overlay Multicast Protocol for Heterogeneous Users"},{"subitem_title":"An Efficient Overlay Multicast Protocol for Heterogeneous Users","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Special Issue on Selected Papers from ICMU 2005","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2005-11-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology  Osaka University"},{"subitem_text_value":"Graduate School of Information Science and Technology  Osaka University"},{"subitem_text_value":"Graduate School of Information Science and Technology  Osaka University"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/10482/files/IPSJ-JNL4611005.pdf"},"date":[{"dateType":"Available","dateValue":"2007-11-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL4611005.pdf","filesize":[{"value":"351.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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"11b89202-ba22-4b7a-b0c4-e9bbbfe15e11","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2005 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"THILMEEM.BADUGE"},{"creatorName":"HIROZUMI, YAMAGUCHI"},{"creatorName":"TERUO, HIGASHINO"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"THILMEE, M.BADUGE","creatorNameLang":"en"},{"creatorName":"HIROZUMI, YAMAGUCHI","creatorNameLang":"en"},{"creatorName":"TERUO, HIGASHINO","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"In this paper  we present a de-centralized protocol to construct a Degree-Bounded Minimum Diameter Tree (DBMDT) as an overlay network. The main objective of this work is to incorporate instable and less powerful hosts such as mobile nodes in overlay multicast trees. The scheme proposed here organizes those nodes in such a way that their low performance (low bandwidth for instance) does not largely affect the entire tree. We derived some basic ideas from our previously proposed protocol MODE and enhanced them to well support the new environment. We have shown from the experimental results that this feature is very effective to keep the diameter as small as possible under the existence of mobile nodes  compared with MODE.","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we present a de-centralized protocol to construct a Degree-Bounded Minimum Diameter Tree (DBMDT) as an overlay network. The main objective of this work is to incorporate instable and less powerful hosts such as mobile nodes in overlay multicast trees. The scheme proposed here organizes those nodes in such a way that their low performance (low bandwidth for instance) does not largely affect the entire tree. We derived some basic ideas from our previously proposed protocol MODE and enhanced them to well support the new environment. We have shown from the experimental results that this feature is very effective to keep the diameter as small as possible under the existence of mobile nodes, compared with MODE.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"2622","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"2614","bibliographicIssueDates":{"bibliographicIssueDate":"2005-11-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"11","bibliographicVolumeNumber":"46"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:45:22.812555+00:00","updated":"2025-01-23T02:48:27.781230+00:00"}