| Presentation | 2008-03-06 Multicast Tree Construction Algorithms for All Optical Networks Under a Delay Constraint Tsutomu MAKABE, Toyofumi TAKENAKA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We propose novel tree construction algorithms for multicast communication in photonic networks. Since multicast communications consume many more link resources than unicast communications, effective algorithms for route selection and wavelength allocation are required. We propose a novel tree construction algorithm, called the Weighted Steiner Tree algorithm, and a Composite Weighted Steiner Tree algorithm. Since the proposed Weighted Steiner Tree algorithm takes account of the number of wavelengths available for each link, this algorithm can select those links which have the greatest number of available wavelengths. By using this link selection technique, this algorithm can accept many more multicast requests than other multicast tree construction algorithms. However, under certain delay constraints, the blocking characteristics of the proposed Weighted Steiner Tree algorithm deteriorate since some light paths between source and destination use long hops and cannot satisfy the delay constraint. In order to adapt the approach to the delay-sensitive environments, we have devised a Composite Weighted Steiner Tree algorithm comprising the Weighted Steiner Tree algorithm and the Dijkstra algorithm for use in a delay constrained environment such as an IPTV application. In this paper, we also give the results of simulation experiments which demonstrate the superiority of the proposed Composite Weighted Steiner Tree algorithm compared with the Distributed Minimum Hop Tree (DMHT) algorithm, from the viewpoint of the light-tree request blocking probability. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Photonic Networks / Multicast / Light-tree / Steiner Tree Heuristic |
| Paper # | NS2007-160 |
| Date of Issue |
| Conference Information | |
| Committee | NS |
|---|---|
| Conference Date | 2008/2/28(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Network Systems(NS) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Multicast Tree Construction Algorithms for All Optical Networks Under a Delay Constraint |
| Sub Title (in English) | |
| Keyword(1) | Photonic Networks |
| Keyword(2) | Multicast |
| Keyword(3) | Light-tree |
| Keyword(4) | Steiner Tree Heuristic |
| 1st Author's Name | Tsutomu MAKABE |
| 1st Author's Affiliation | Graduate School of Engineering, Nihon University() |
| 2nd Author's Name | Toyofumi TAKENAKA |
| 2nd Author's Affiliation | Graduate School of Engineering, Nihon University |
| Date | 2008-03-06 |
| Paper # | NS2007-160 |
| Volume (vol) | vol.107 |
| Number (no) | 524 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |