- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- 【Updated on June 30, 2025】Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
An Efficient Overlay Multicast Protocol for Heterogeneous Users
Bibliographic Information
- Other Title
-
- Efficient Overlay Multicast Protocol for Heterogeneous Users
Search this article
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.
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.
Journal
-
- 情報処理学会論文誌
-
情報処理学会論文誌 46 (11), 2614-2622, 2005-11-15
東京 : 情報処理学会
- Tweet
Details 詳細情報について
-
- CRID
- 1050564287836033664
-
- NII Article ID
- 110002972719
-
- NII Book ID
- AN00116647
-
- ISSN
- 18827764
- 03875806
-
- NDL BIB ID
- 7726966
-
- Text Lang
- en
-
- Article Type
- journal article
-
- Data Source
-
- IRDB
- NDL Search
- CiNii Articles
- KAKEN