Presentation 2013-03-07
High-Speed Reconfiguration of Virtual Network with Shortest Path Betweenness
Yasuhiro URAYAMA, Takuji TACHIBANA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, in order to reconfigure a virtual network quickly based on user's request, we propose a high-speed reconfiguration of virtual network. In our proposed method, a service provider receives user's request for reconfiguring virtual network topology, the topology of the constructed virtual network is reconfig using by shortest path betweenness. Then, the service provider also design a new virtual network using by Dijkstra algorithm and Prim's MST. We evaluate the performance of our proposed method, and we show the effectiveness of the proposed method.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Virtual networks / Shortest path betweenness / Robustness / Topology design / Reconfiguration
Paper # IN2012-160
Date of Issue

Conference Information
Committee IN
Conference Date 2013/2/28(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Networks (IN)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) High-Speed Reconfiguration of Virtual Network with Shortest Path Betweenness
Sub Title (in English)
Keyword(1) Virtual networks
Keyword(2) Shortest path betweenness
Keyword(3) Robustness
Keyword(4) Topology design
Keyword(5) Reconfiguration
1st Author's Name Yasuhiro URAYAMA
1st Author's Affiliation Graduate School of Engineering, University of Fukui()
2nd Author's Name Takuji TACHIBANA
2nd Author's Affiliation Graduate School of Engineering, University of Fukui
Date 2013-03-07
Paper # IN2012-160
Volume (vol) vol.112
Number (no) 464
Page pp.pp.-
#Pages 6
Date of Issue