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 2015-10-19 16:40
Efficient Network Policy Checking with Multi-dimensional Graph Traversal Algorithm
Chen Richard, Takeru Inoue, Toru Mano, Kimihiro Mizutani, Hisashi Nagata, Osamu Akashi (NTT) IA2015-34
Abstract (in Japanese) (See Japanese page) 
(in English) Since network operators find much difficulty in guaranteeing to
correctly configure their complex networks, they are strongly
demanding a new technology to automatically check the network
configuration. The technology must be very efficient in terms of
time, because there can be a number of policies configured in a
network for performance and security reasons. In this paper, we
introduce a novel graph traversal algorithm to make the checking
process very efficient. Since network policies are often represneted
as a compressed graph for space limitation, our algorithm well suits
for the high-speed policy checking. Our algorithm extends the
well-established dynamic programming paradigm to enumerate all the
policies matched to a given condition. We conduct thorough
experiments with real network datasets, and reveal that our algorithm
is one hundred times faster than the state-of-the art.
Keyword (in Japanese) (See Japanese page) 
(in English) network policy checking / graph traversal / dynamic programming / / / / /  
Reference Info. IEICE Tech. Rep., vol. 115, no. 256, IA2015-34, pp. 25-30, Oct. 2015.
Paper # IA2015-34 
Date of Issue 2015-10-12 (IA) 
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 IA2015-34

Conference Information
Committee IA  
Conference Date 2015-10-19 - 2015-10-19 
Place (in Japanese) (See Japanese page) 
Place (in English) Takeda Hall, Takeda Bldg. 5F, Hongo Campus, Univ. of Tokyo 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Network R&D Testbed Operation and Utilization, etc. (cosponsored by ADVNET) 
Paper Information
Registration To IA 
Conference Code 2015-10-IA 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Efficient Network Policy Checking with Multi-dimensional Graph Traversal Algorithm 
Sub Title (in English)  
Keyword(1) network policy checking  
Keyword(2) graph traversal  
Keyword(3) dynamic programming  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Chen Richard  
1st Author's Affiliation Nippon Telegraph and Telephone Corporation (NTT)
2nd Author's Name Takeru Inoue  
2nd Author's Affiliation Nippon Telegraph and Telephone Corporation (NTT)
3rd Author's Name Toru Mano  
3rd Author's Affiliation Nippon Telegraph and Telephone Corporation (NTT)
4th Author's Name Kimihiro Mizutani  
4th Author's Affiliation Nippon Telegraph and Telephone Corporation (NTT)
5th Author's Name Hisashi Nagata  
5th Author's Affiliation Nippon Telegraph and Telephone Corporation (NTT)
6th Author's Name Osamu Akashi  
6th Author's Affiliation Nippon Telegraph and Telephone Corporation (NTT)
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 2015-10-19 16:40:00 
Presentation Time 25 minutes 
Registration for IA 
Paper # IA2015-34 
Volume (vol) vol.115 
Number (no) no.256 
Page pp.25-30 
#Pages 6 
Date of Issue 2015-10-12 (IA) 

[Return to Top Page]

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