QoS routing algorithms using fully polynomial time approximation scheme

QoS routing algorithms using fully polynomial time approximation scheme
复制标题

DOI：
10.1109/iwqos.2011.5931329
复制
发表时间：
2011-06
期刊：
2011 IEEE Nineteenth IEEE International Workshop on Quality of Service
影响因子：
--
通讯作者：
Jun Huang;Y. Tanaka
Jun Huang;Y. Tanaka
中科院分区：
其他
文献类型：
--
作者：
Jun Huang;Y. Tanaka

文献摘要

被引文献

相似文献

具有端到端服务质量(Qos)保证的路由是新近出现的服务广泛部署的关键。研究网络中的服务质量路由算法是一个重要的开放课题。研究了与服务质量路由相关的问题，提出了一种全多项式时间近似算法(FPTAS)。在所提出的FPTAS中，提出了一种基于图扩展的动态规划方法，并研究了该算法的扩展版本。理论分析表明，所提算法的性能优于以往最著名的研究。
Routing with end-to-end Quality-of-Service (QoS) guarantees is a key to the widespread deployment of recent emerged services. Developing QoS routing algorithm in the network is an important open topic. This paper investigates the QoS routing related problems and proposes a Fully Polynomial Time Approximation Scheme (FPTAS) for QoS routing. In the proposed FPTAS, a graph-extending based dynamic programming approach is developed, and an extended version of the proposed algorithm is studied. The theoretical analyses show that the proposed algorithms outperform the previous best-known studies.