期刊文献+

网络出版传播的广播时间问题研究

Study of Broadcasting-time on Publication and Communication in Networks
下载PDF
导出
摘要 对于网络出版传播中的广播时间问题,借助图论理论通过分析图的连通度,给出了确定网络单信息广播时间一个界的方法,实例证明该界是可以通过计算得到的。 Broadcasting is a basic problem of publication and communication in networks. In this paper, using of graph theory and by analyzing graph's connected degree, we find a way to obtain one bound of broadcasting-time for single information. It can be illustrated that the bound is available through calculation.
作者 朱晓峰
出处 《北京印刷学院学报》 2004年第1期3-6,27,共5页 Journal of Beijing Institute of Graphic Communication
基金 北京市教育委员会科技发展计划项目资助(KM200310015060) 北京市优秀人才培养专项经费资助
关键词 网络出版传播 广播时间 图论 连通度 计算方法 单信息广播 结点 publication and communication in networks, broadcasting-time, connected degree, graph theory.
  • 相关文献

参考文献2

二级参考文献8

  • 1[1]Wu J.Safety level-an efficient mechanism for achieving reliable broadcasting in hypercubes[J].IEEE Trans Computers,1995,44(5): 702~705.
  • 2[2]CHIU Ge-ming,CHEN Kai-shung.Use of routing capability for fault-tolerant routing in hypercube multicomputers[J].IEEE Trans Computers,1997,46(8): 953~958.
  • 3[3]Wu J.Reliable unicasting in faulty hypercubes using safety levels[J].IEEE Trans Computers,1997,46(2): 241~247.
  • 4[4]Bondy J A,Murty U S R.Graph Theory with Applications[M].The Macmllian press Itd London,1976.
  • 5[5]Chiu G M,Wu S P.A fault-tolerant routing strategy in hypercube multicomputers[J].IEEE Trans Computers,1996,45(2): 143~156.
  • 6[6]Gordon J M,Stout Q F.Hypercube message routing in the presence of fault[J].Proc Third Conf Hypercube concurrent computers and applications,1988,251~263.
  • 7[7]Lan Y.A Fault-Tolerant Routing Algorithm in Hypercubes[C].Proc 1994 Int′l Conf Parallel Processing,pp.Ⅲ 163-Ⅲ 166,Aug.1994.
  • 8[8]Lee T C,Hayes J P.A fault-tolerant communication scheme for hypercube computers[J].IEEE Trans Computers,1992,41(10): 1242~1256.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部