Presentation | 2014-07-09 On finding node-disjoint paths by local manipulation of a tie-set base Ryuta ITO, Norihiko SHINOMIYA, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | In the information communication network, it is required for a detour path to be node-disjoint regarding a working path in case of a node failure occurs. Additionally, the previous research has indicated that fast failure recovery might be realized by using local node-disjoint paths that connect two nodes neighboring the failure node. This paper discusses a calculation method of local node-disjoint paths. By defining an edge set which forms a cycle as a tie-set, local node-disjoint paths are calculated by using tie-sets whose exclusive-OR leads to a single tie-set. However, an exclusive OR of arbitrary tie-sets is not always a tie-set. Hence, this paper proposes the concept of overlapping degree as a sufficient condition that an exclusive-OR of two tie-sets must becomes a tie-set and discusses its property. Finally, this paper shows the comparison results of a proposed method and a simple method using shortest path algorithm. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | tie-set vector space / exclusive OR / node-disjoint path / graph theory |
Paper # | CAS2014-9,VLD2014-18,SIP2014-30,MSS2014-9,SIS2014-9 |
Date of Issue |
Conference Information | |
Committee | MSS |
---|---|
Conference Date | 2014/7/2(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 | Mathematical Systems Science and its applications(MSS) |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | On finding node-disjoint paths by local manipulation of a tie-set base |
Sub Title (in English) | |
Keyword(1) | tie-set vector space |
Keyword(2) | exclusive OR |
Keyword(3) | node-disjoint path |
Keyword(4) | graph theory |
1st Author's Name | Ryuta ITO |
1st Author's Affiliation | Faculty of Engineering, Soka University() |
2nd Author's Name | Norihiko SHINOMIYA |
2nd Author's Affiliation | Faculty of Engineering, Soka University |
Date | 2014-07-09 |
Paper # | CAS2014-9,VLD2014-18,SIP2014-30,MSS2014-9,SIS2014-9 |
Volume (vol) | vol.114 |
Number (no) | 125 |
Page | pp.pp.- |
#Pages | 4 |
Date of Issue |