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 |
|