English  |  正體中文  |  简体中文  |  Items with full text/Total items : 27248/39091
Visitors : 2417178      Online Users : 59
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/40459

Title: Broadcasting in Heterogeneous Tree Networks
Authors: Yu-Hsuan Su
Ching-Chi Lin
D. T. Lee
Contributors: 國立臺灣海洋大學:資訊工程學系
Keywords: postal model
broadcast center
algorithm
heterogeneous network
weighted tree
Date: 2010
Issue Date: 2017-01-19T03:07:54Z
Publisher: International Computing and Combinatorics Conference
Abstract: Abstract: We consider the broadcasting problem in heterogeneous tree networks. A heterogeneous tree network is represented by a weighted tree T = (V,E) such that the weight of each edge denotes the communication time between the two end vertices. The broadcasting problem is to find a broadcast center such that the maximum communication time from the broadcast center to all vertices is minimized. In this paper, we propose a linear time algorithm for the broadcasting problem in a heterogeneous tree network following the postal model. As a byproduct of the algorithm, we can compute in linear time the broadcasting time of any vertex in the tree, i.e., the maximum time required to transmit messages from the vertex to every other vertex in the tree. Furthermore, an optimal sequence by which the broadcast center broadcasts its messages to all vertices in T can also be determined in linear time.
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/40459
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML42View/Open


All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback