QQ客服 官方微博 反馈留言

	Construct optimal diameter network and D-partition routing algorithm
	Ding Qiang ; Xu Ke ; Liu Hui-shan
	2010-05-06 ; 2010-05-06
关键词	Theoretical or Mathematical/ communication complexity graph theory peer-to-peer computing security of data telecommunication network routing telecommunication network topology telecommunication security/ construct optimal diameter network D-partition routing algorithm network maximum delay topological graphs network structure design graph-theoretical properties complexity analysis P2P worm defense system topology construction/ B6210L Computer communications B6150P Communication network design, planning and routing B0250 Combinatorial mathematics C5620 Computer networks and techniques C6130S Data security C1160 Combinatorial mathematics
中文摘要	The maximum delay of network can be denoted by the diameter of the network. The problem of finding topological graphs of optimal diameter receives much attention from researchers due to its possible applications in network structure design. It is highly important to research how to construct an optimal diameter network and design the efficient routing algorithm. In this paper, by using graph-theoretical properties, the authors studied the method of constructing network with an optimal diameter and the routing problem when the degree-constrained was dealt with. The authors also presented an efficient and simple heuristic routing algorithm and analyzed its complexity. At the present time, we have finished the P2P worm defense system based on this algorithm.
语种	中文 ; 中文
出版者	Mini-Micro Syst., China ; China
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/9978]
专题	清华大学
推荐引用方式 GB/T 7714	Ding Qiang,Xu Ke,Liu Hui-shan. Construct optimal diameter network and D-partition routing algorithm[J],2010, 2010.
APA	Ding Qiang,Xu Ke,&Liu Hui-shan.(2010).Construct optimal diameter network and D-partition routing algorithm..
MLA	Ding Qiang,et al."Construct optimal diameter network and D-partition routing algorithm".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。