IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
... (for ESS/CS/ES/ISS)
Tech. Rep. Archives
... (for ES/CS)
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2014-07-09 13:20
On finding node-disjoint paths by local manipulation of a tie-set base
Ryuta Ito, Norihiko Shinomiya (Soka Univ.)
Abstract (in Japanese) (See Japanese page) 
(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) 
(in English) tie-set vector space / exclusive OR / node-disjoint path / graph theory / / / /  
Reference Info. IEICE Tech. Rep., vol. 114, no. 122, CAS2014-9, pp. 41-44, July 2014.
Paper # CAS2014-9 
Date of Issue 2014-07-02 (CAS, VLD, SIP, MSS, SIS) 
ISSN Print edition: ISSN 0913-5685  Online edition: ISSN 2432-6380

Conference Information
Committee CAS SIP MSS VLD SIS  
Conference Date 2014-07-09 - 2014-07-11 
Place (in Japanese) (See Japanese page) 
Place (in English) Hokkaido University 
Topics (in Japanese) (See Japanese page) 
Topics (in English) System, signal processing and related topics 
Paper Information
Registration To CAS 
Conference Code 2014-07-CAS-SIP-MSS-VLD-SIS 
Language Japanese 
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  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Ryuta Ito  
1st Author's Affiliation Soka University (Soka Univ.)
2nd Author's Name Norihiko Shinomiya  
2nd Author's Affiliation Soka University (Soka Univ.)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker
Date Time 2014-07-09 13:20:00 
Presentation Time 20 
Registration for CAS 
Paper # IEICE-CAS2014-9,IEICE-VLD2014-18,IEICE-SIP2014-30,IEICE-MSS2014-9,IEICE-SIS2014-9 
Volume (vol) IEICE-114 
Number (no) no.122(CAS), no.123(VLD), no.124(SIP), no.125(MSS), no.126(SIS) 
Page pp.41-44 
#Pages IEICE-4 
Date of Issue IEICE-CAS-2014-07-02,IEICE-VLD-2014-07-02,IEICE-SIP-2014-07-02,IEICE-MSS-2014-07-02,IEICE-SIS-2014-07-02 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan