Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 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.) CAS2014-9 VLD2014-18 SIP2014-30 MSS2014-9 SIS2014-9
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
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF CAS2014-9 VLD2014-18 SIP2014-30 MSS2014-9 SIS2014-9

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 ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2014-07-09 13:20:00 
Presentation Time 20 minutes 
Registration for CAS 
Paper # CAS2014-9, VLD2014-18, SIP2014-30, MSS2014-9, SIS2014-9 
Volume (vol) vol.114 
Number (no) no.122(CAS), no.123(VLD), no.124(SIP), no.125(MSS), no.126(SIS) 
Page pp.41-44 
#Pages 4 
Date of Issue 2014-07-02 (CAS, VLD, SIP, MSS, SIS) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan