QoS routing algorithms using fully polynomial time approximation scheme

Jun Huang*, Yoshiaki Tanaka

*この研究の対応する著者

研究成果: Conference contribution

10 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトル2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011
DOI
出版ステータスPublished - 2011 7月 28
イベント2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011 - San Jose, CA, United States
継続期間: 2011 6月 62011 6月 7

出版物シリーズ

名前IEEE International Workshop on Quality of Service, IWQoS
ISSN(印刷版)1548-615X

Conference

Conference2011 IEEE 19th International Workshop on Quality of Service, IWQoS 2011
国/地域United States
CitySan Jose, CA
Period11/6/611/6/7

ASJC Scopus subject areas

  • 電子工学および電気工学

フィンガープリント

「QoS routing algorithms using fully polynomial time approximation scheme」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル