%0 Journal Article
%T Study of General Incomplete Star Interconnection Networks
%A SHI Yuntao HOU Zifeng
%A SONG JianpingInstitute of Computing Technology
%A The Chinese Acadcmy of Sciences
%A Beijing
%A PR China
%A <br>史云涛
%A 侯紫峰
%A 宋建平
%J 计算机科学技术学报
%D 2002
%I 
%X The star networks, which were originally proposed by Akers and Harel, havesuffered from a rigorous restriction on the number of nodes. The general incomplete starnetworks (GISN) are proposed in this paper to relieve this restriction. An efficient labelingscheme for GISN is given, and routing and broadcasting a1gorithms are also presented forGlSN. The communication diameter of GISN is shown to be bounded by 4n - 7. The proposedsingle node broadcasting algorithm is optimal with respect to time complexity O(nlog2,n).
%K interconnection network
%K expandability
%K incomplete star graph
%K routing andbroadcasting algorithm<br>
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=E7A361A3A494B30BF47EE7343B51C8C3&yid=C3ACC247184A22C1&vid=BCA2697F357F2001&iid=38B194292C032A66&sid=2B25C5E62F83A049&eid=2B25C5E62F83A049&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=0