Fast link-disjoint path algorithm on parallel reconfigurable processor DAPDNA-2

Taku Kihara, Sho Shimizu, Yutaka Arakawa, Naoaki Yamanaka, Kosuke Shiba

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

This paper proposes fast parallel link-disjoint path algorithm using dynamically reconfigurable processor and implements it on DAPDNA-2 (IPFlex Inc) which is newly structured. The conventional k-shortest path algorithm finds multiple link-disjoint paths between the source node and the destination node. When the network scale is large, the calculation time of k-shortest path algorithm increases rapidly. Moreover, in the worst case, k-shortest path algorithm can not find optimum link-disjoint path pair because this algorithm always finds the shortest path at first and removes those links from network. Our proposed algorithm collects all path information in the network and calculates optimum linkdisjoint path pair (i.e. minimum cost link-disjoint path pair) at high speed by using parallel operation. Additionally, our proposed algorithm finds optimum link-disjoint path pair at a high rate in a limited of calculation time. The evaluation shows our proposed algorithm can decrease the calculation clock about 90%. copyright

本文言語English
ホスト出版物のタイトル2008 14th Asia-Pacific Conference on Communications, APCC 2008
出版ステータスPublished - 2008 12 1
イベント2008 14th Asia-Pacific Conference on Communications, APCC 2008 - Akihabara, Tokyo, United States
継続期間: 2008 10 142008 10 16

出版物シリーズ

名前2008 14th Asia-Pacific Conference on Communications, APCC 2008

Other

Other2008 14th Asia-Pacific Conference on Communications, APCC 2008
CountryUnited States
CityAkihabara, Tokyo
Period08/10/1408/10/16

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

フィンガープリント 「Fast link-disjoint path algorithm on parallel reconfigurable processor DAPDNA-2」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル