Presentation 1999/10/21
A Study on Center Location Method in Center-based Multicast
Norio Igarashi, Ushio Yamamoto, Yoshikuni Onozato,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Center-based Multicast has been proposed to expedite multicast on the network. In Center-based Multicast, finding the optimum center node is called "Center (Core)-Location Problem." In this paper we investigate the method of finding more appropriate center node by using distance information. We also propose new methods based on distributed fashion and based on Genetic Algorithm. We compare our methods with Random method and HillClimb method by simulation. We evaluate the power of our methods from simulation results in term of cost and delay on nonhierarchical and hierarchical networks.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) multicast / center-based tree / center-location problem / distance information
Paper # SAT99-92
Date of Issue

Conference Information
Committee SAT
Conference Date 1999/10/21(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 Satellite Telecommunications (SAT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Study on Center Location Method in Center-based Multicast
Sub Title (in English)
Keyword(1) multicast
Keyword(2) center-based tree
Keyword(3) center-location problem
Keyword(4) distance information
1st Author's Name Norio Igarashi
1st Author's Affiliation Department of Computer Science, Faculty of Engineering, Gunma University()
2nd Author's Name Ushio Yamamoto
2nd Author's Affiliation Department of Computer Science, Faculty of Engineering, Gunma University
3rd Author's Name Yoshikuni Onozato
3rd Author's Affiliation Department of Computer Science, Faculty of Engineering, Gunma University
Date 1999/10/21
Paper # SAT99-92
Volume (vol) vol.99
Number (no) 366
Page pp.pp.-
#Pages 6
Date of Issue