For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Flexible Allocation of Optical Access Network Resources Using Constraint Satisfaction Problem
Kenichi TAYAMA Shiro OGASAWARA Tetsuya YAMAMURA Yasuyuki OKUMURA
IEICE TRANSACTIONS on Communications
Publication Date: 2007/07/01
Online ISSN: 1745-1345
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network Management/Operation
optical access network, allocation, service delivery provisioning, constraint satisfaction problem (CSP),
Full Text: PDF(2.1MB)>>
A method for flexibly allocating and reallocating optical access network (OAN) resources, including fibers and equipment, using the constraint satisfaction problem (CSP) is described. OAN resource allocation during service delivery provisioning involves various input conditions and allocation sequences, so an OAN resource allocation method has to support various workflow patterns. Furthermore, exception processing, such as reallocating OAN resources once they are allocated, is inevitable, especially during the spread of service using optical fiber and during the deployment of an optical access network. However, it is almost impossible to describe all workflow patterns including exception processes. Improving the efficiency of these exception processes, as well as that of the typical processes, is important for reducing the service delivery time. Describing all these patterns and process flows increases development cost. The CSP can be used to search for solutions without having to fix the process sequence and input conditions beforehand. We have formulated the conditions for OAN resource allocation and reallocation as a CSP. Use of this method makes it possible to handle various allocation workflow patterns including exception processes. Evaluation of the solution search time demonstrated its feasibility.