Presentation 2014-11-21
On composing a robust tree against single link failure in a network with reliability of links
Genya ISHIGAKI, Norihiko SHINOMIYA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper discusses an optimization problem to compose a reliable tree that alleviates the influence of single link failure on the whole network. Modeling of a network whose communication links hold reliability index with a graph, each edge in the graph is assigned availability that represents reliability of the corresponding link. The other metric is commonality that indicates importance of an edge based on the location of the edge. Exploiting these two reliability concepts, Robust Tree Problem is formulated and analyzed in simulations for small graphs.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) graph reliability / tree / ordered set / graph theory
Paper # CAS2014-100,MSS2014-64
Date of Issue

Conference Information
Committee CAS
Conference Date 2014/11/13(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 Circuits and Systems (CAS)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On composing a robust tree against single link failure in a network with reliability of links
Sub Title (in English)
Keyword(1) graph reliability
Keyword(2) tree
Keyword(3) ordered set
Keyword(4) graph theory
1st Author's Name Genya ISHIGAKI
1st Author's Affiliation Graduate School of Engineering, Soka University()
2nd Author's Name Norihiko SHINOMIYA
2nd Author's Affiliation Graduate School of Engineering, Soka University
Date 2014-11-21
Paper # CAS2014-100,MSS2014-64
Volume (vol) vol.114
Number (no) 312
Page pp.pp.-
#Pages 4
Date of Issue