Paper Abstract and Keywords |
Presentation |
2006-05-25 14:05
A GMPLS Path Computing Method with a Tabu Search Algorithm for-the Weighted Constraint Satisfaction Problem Hiroki Furuya, Nagao Ogino, Satoshi Konishi, Hajime Nakamura (KDDI R&D Labs.), Takahito Tanabe, Toshihiro Nitta, Makoto Sato (Mathematical Systems) PN2006-3 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
This paper proposes a route computation method for a GMPLS based survivable network. It is classified as a pre-computed and centralized approach. It tries to globally optimize both working and recovery routes for each demand while taking account of GMPLS recovery schemes and network resource constraints. To enhance its scalability as well as computational performance, two distinctive devices are introduced to the method: utilization of a tabu-search algorithm for the weighted con-straint satisfaction problem (WCSP) and the limitation of candidate routes. Experimental results demonstrate the possibility that it could handle practical-scale networks with satisfactory performance in both optimality of solution and computational time. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
network design / route computation / fault recovery / mathematical programming / GMPLS / / / |
Reference Info. |
IEICE Tech. Rep., vol. 106, no. 70, PN2006-3, pp. 13-18, May 2006. |
Paper # |
PN2006-3 |
Date of Issue |
2006-05-18 (PN) |
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 |
PN2006-3 |
|