QQ客服 官方微博 反馈留言

	Precomputation for QoS routing based on linear functions
	Cui Yong ; Xu Ke ; Wu Jian-Ping
	2010-05-06 ; 2010-05-06
关键词	Practical/ computational complexity computer networks quality of service telecommunication network routing/ quality-of-service routing QoS routing linear function high-speed network heuristic algorithm QoSR routing table precomputation uniform distribution/ B6150P Communication network design, planning and routing B6210L Computer communications C5620W Other computer networks C4240C Computational complexity
中文摘要	As one of the most challenging problems of the upcoming next-generation high-speed networks, quality-of-service routing (QoSR) has the complexity of NPC. This paper proposes a heuristic algorithm, which converts two QoS weights to a single value by a linear function. Then multiple linear functions are selected to achieve the QoSR routing table precomputation independent of QoS request. The performance of linear functions is analyzed. This paper also gives the method determining the feasible and unfeasible areas for a QoS request. Extensive simulations show that with a few linear functions in uniform distribution, the proposed algorithm can construct a well-performed QoS routing table and excels the current algorithms on both scalability and routing performance.
语种	中文 ; 中文
出版者	Science Press ; China
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/9925]
专题	清华大学
推荐引用方式 GB/T 7714	Cui Yong,Xu Ke,Wu Jian-Ping. Precomputation for QoS routing based on linear functions[J],2010, 2010.
APA	Cui Yong,Xu Ke,&Wu Jian-Ping.(2010).Precomputation for QoS routing based on linear functions..
MLA	Cui Yong,et al."Precomputation for QoS routing based on linear functions".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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