Art

J-GLOBAL ID：200902239027608889   Reference number：07A0023531

A New Distributed QoS Routing Algorithm using Mean Field Approximation Method

平均場近似計算法を用いた分散型QoSルーティングアルゴリズム

Author (2)： QIAN Fei (関東学院大) ,  HIRATA HIRONORI (千葉大)
Material： 電気学会論文誌 C  (IEEJ Transactions on Electronics, Information and Systems)
Volume： 127  Issue： 1  Page： 59-67  Publication year： Jan. 01, 2007 
JST Material Number： S0810A  ISSN： 0385-4221  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： JAPANESE (JA)

Thesaurus term： *QOS ,...
Semi thesaurus term： routing

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=07A0023531&from=J-GLOBAL&jstjournalNo=S0810A") }}

JST classification (1)： Communication theory in general  (ND02010V)

Reference (16)：

• (1) M. R. Garey and D. S. Jhonson: “Computer and Interactability: A guide to the theory of NP-completeness”, Freeman, Sanfrancisco (1978)
• (2) D. Blokh and G. Gutin: “An Approximation Algorithm for Combinatorial Optimization Problems with Two Parameters”, IMADA preprint, pp. 14-18 (1995)
• (3) S. Chen and C. Nahrstedt: “On Finding Multi-constrained Paths”, Proc. IEEE Int. Conf. Commun. (ICC98), pp. 874-879 (1998)
• (4) A. Stavroula and G. Leonidas: “Efficient QoS Routing, Computer Networks: The International Journal of Computer and Telecommunications Networking”, Vol. 43, No. 3, pp. 351-367 (2003)
• (5) S. Chen and C. Nahrstedt: “An Overview of Quality of Service Routing for Next-Generation High-Speed Networks: problem and Solutions”, IEEE Networks, Vol. 12, No. 6, pp. 64-79 (1998)

Terms in the title (4)： 平均場近似 ,  計算法 ,  QoSルーティング ,  アルゴリズム