Many-to-Many Multicast Routing Schemes under a Fixed Topology
Many-to-many multicast routing can be extensively applied in computer or communication networks supporting various continuous multimedia applications. The paper focuses on the case where all users share a common communication channel while each user is both a sender and a receiver of messages in mul...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2013/718152 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849306342330728448 |
|---|---|
| author | Wei Ding Hongfa Wang Xuerui Wei |
| author_facet | Wei Ding Hongfa Wang Xuerui Wei |
| author_sort | Wei Ding |
| collection | DOAJ |
| description | Many-to-many multicast routing can be extensively applied in computer or communication networks supporting various continuous multimedia applications. The paper focuses on the case where all users share a common communication channel while each user is both a sender and a receiver of messages in multicasting as well as an end user. In this case, the multicast tree appears as a terminal Steiner tree (TeST). The problem of finding a TeST with a quality-of-service (QoS) optimization is frequently NP-hard. However, we discover that it is a good idea to find a many-to-many multicast tree with QoS optimization under a fixed topology. In this paper, we are concerned with three kinds of QoS optimization objectives of multicast tree, that is, the minimum cost, minimum diameter, and maximum reliability. All of three optimization problems are distributed into two types, the centralized and decentralized version. This paper uses the dynamic programming method to devise an exact algorithm, respectively, for the centralized and decentralized versions of each optimization problem. |
| format | Article |
| id | doaj-art-2ea1f75ce14d42669b48e61e3cc06428 |
| institution | Kabale University |
| issn | 1537-744X |
| language | English |
| publishDate | 2013-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | The Scientific World Journal |
| spelling | doaj-art-2ea1f75ce14d42669b48e61e3cc064282025-08-20T03:55:07ZengWileyThe Scientific World Journal1537-744X2013-01-01201310.1155/2013/718152718152Many-to-Many Multicast Routing Schemes under a Fixed TopologyWei Ding0Hongfa Wang1Xuerui Wei2Zhejiang Water Conservancy and Hydropower College, Hangzhou, Zhejiang 310018, ChinaZhejiang Water Conservancy and Hydropower College, Hangzhou, Zhejiang 310018, ChinaDepartment of Mathematics, Shaoxing University, Shaoxing, Zhejiang 312000, ChinaMany-to-many multicast routing can be extensively applied in computer or communication networks supporting various continuous multimedia applications. The paper focuses on the case where all users share a common communication channel while each user is both a sender and a receiver of messages in multicasting as well as an end user. In this case, the multicast tree appears as a terminal Steiner tree (TeST). The problem of finding a TeST with a quality-of-service (QoS) optimization is frequently NP-hard. However, we discover that it is a good idea to find a many-to-many multicast tree with QoS optimization under a fixed topology. In this paper, we are concerned with three kinds of QoS optimization objectives of multicast tree, that is, the minimum cost, minimum diameter, and maximum reliability. All of three optimization problems are distributed into two types, the centralized and decentralized version. This paper uses the dynamic programming method to devise an exact algorithm, respectively, for the centralized and decentralized versions of each optimization problem.http://dx.doi.org/10.1155/2013/718152 |
| spellingShingle | Wei Ding Hongfa Wang Xuerui Wei Many-to-Many Multicast Routing Schemes under a Fixed Topology The Scientific World Journal |
| title | Many-to-Many Multicast Routing Schemes under a Fixed Topology |
| title_full | Many-to-Many Multicast Routing Schemes under a Fixed Topology |
| title_fullStr | Many-to-Many Multicast Routing Schemes under a Fixed Topology |
| title_full_unstemmed | Many-to-Many Multicast Routing Schemes under a Fixed Topology |
| title_short | Many-to-Many Multicast Routing Schemes under a Fixed Topology |
| title_sort | many to many multicast routing schemes under a fixed topology |
| url | http://dx.doi.org/10.1155/2013/718152 |
| work_keys_str_mv | AT weiding manytomanymulticastroutingschemesunderafixedtopology AT hongfawang manytomanymulticastroutingschemesunderafixedtopology AT xueruiwei manytomanymulticastroutingschemesunderafixedtopology |