Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2008-03-06 11:50
Multicast Tree Construction Algorithms for All Optical Networks in Delay Constraint Environments
Tsutomu Makabe, Toyofumi Takenaka (Nihon Univ.) NS2007-160
Abstract (in Japanese) (See Japanese page) 
(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 hybrid 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 hybrid 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 hybrid 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) 
(in English) Photonic Networks / Multicast / Light-tree / Steiner Tree Heuristic / / / /  
Reference Info. IEICE Tech. Rep., vol. 107, no. 524, NS2007-160, pp. 167-172, March 2008.
Paper # NS2007-160 
Date of Issue 2008-02-28 (NS) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF NS2007-160

Conference Information
Committee NS IN  
Conference Date 2008-03-06 - 2008-03-07 
Place (in Japanese) (See Japanese page) 
Place (in English) Bankoku Shinryokan 
Topics (in Japanese) (See Japanese page) 
Topics (in English) General issues 
Paper Information
Registration To NS 
Conference Code 2008-03-NS-IN 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Multicast Tree Construction Algorithms for All Optical Networks in Delay Constraint Environments 
Sub Title (in English)  
Keyword(1) Photonic Networks  
Keyword(2) Multicast  
Keyword(3) Light-tree  
Keyword(4) Steiner Tree Heuristic  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Tsutomu Makabe  
1st Author's Affiliation Nihon University (Nihon Univ.)
2nd Author's Name Toyofumi Takenaka  
2nd Author's Affiliation Nihon University (Nihon Univ.)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2008-03-06 11:50:00 
Presentation Time 20 minutes 
Registration for NS 
Paper # NS2007-160 
Volume (vol) vol.107 
Number (no) no.524 
Page pp.167-172 
#Pages
Date of Issue 2008-02-28 (NS) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan