WEKO3
アイテム
An Efficient Overlay Multicast Protocol for Heterogeneous Users
https://ipsj.ixsq.nii.ac.jp/records/10482
https://ipsj.ixsq.nii.ac.jp/records/104825f4f2f50-d006-472c-86e0-02c88f926181
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL4611005.pdf (351.2 kB)
|
Copyright (c) 2005 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2005-11-15 | |||||||
| タイトル | ||||||||
| タイトル | An Efficient Overlay Multicast Protocol for Heterogeneous Users | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | An Efficient Overlay Multicast Protocol for Heterogeneous Users | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | Special Issue on Selected Papers from ICMU 2005 | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Graduate School of Information Science and Technology Osaka University | ||||||||
| 著者所属 | ||||||||
| Graduate School of Information Science and Technology Osaka University | ||||||||
| 著者所属 | ||||||||
| Graduate School of Information Science and Technology Osaka University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Graduate School of Information Science and Technology, Osaka University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Graduate School of Information Science and Technology, Osaka University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Graduate School of Information Science and Technology, Osaka University | ||||||||
| 著者名 |
THILMEEM.BADUGE
HIROZUMI, YAMAGUCHI
TERUO, HIGASHINO
× THILMEEM.BADUGE HIROZUMI, YAMAGUCHI TERUO, HIGASHINO
|
|||||||
| 著者名(英) |
THILMEE, M.BADUGE
HIROZUMI, YAMAGUCHI
TERUO, HIGASHINO
× THILMEE, M.BADUGE HIROZUMI, YAMAGUCHI TERUO, HIGASHINO
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AN00116647 | |||||||
| 書誌情報 |
情報処理学会論文誌 巻 46, 号 11, p. 2614-2622, 発行日 2005-11-15 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-7764 | |||||||
