Hitless Defragmentation to Increase Traffic Admissibility in Elastic Optical Networks

• Material Type: 博士論文
• Title: Hitless Defragmentation to Increase Traffic Admissibility in Elastic Optical Networks
• Author/Editor: BA, SEYDOU
• Author Heading: BA, SEYDOU
• Alternative Title: エラスティック光ネットワークにおけるトラヒック収容性を向上させるための無瞬断デフラグメンテーション
• Degree grantor/type: 電気通信大学
• Date Granted: 2017-03-24
• Dissertation Number: 甲第886号
• Degree Type: 博士（工学）
• Text Language Code: eng
• Target Audience: 一般
• Note (General): In elastic optical networks (EONs), a major obstacle to using the spectrum resources efficiently is spectrum fragmentation. Much of the research activities in EONs focuses on finding defragmentation methods which remove the spectrum fragmentation. Among the defragmentation methods presented in the literature, hitless defragmentation has been introduced as an approach to limit the spectrum fragmentation in elastic optical networks without traffic disruption. It facilitates the accommodation of new request by creating large spectrum blocks, as it moves active lightpaths (retuning) to fill in gaps left in the spectrum by expired ones. Nevertheless, hitless defragmentation witnesses limitations for gradual retuning with the conventionally used first fit allocation. The first fit allocation stacks all lightpaths to the lower end of the spectrum. This leads to a large number of lightpaths that need to be retuned and are subject to interfere with each other's retuning. This thesis presents two schemes, which are based on hitless defragmentation, to increase the admissible traffic in EONs. Firstly, a route partitioning scheme for hitless defragmentation in default EONs is presented. The proposed scheme uses route partitioning with the first-last fit allocation to increase the possibilities of lightpath retuning by avoiding the retuning interference among lightpaths. The first-last fit allocation is used to set a bipartition with one partition allocated with the first fit and the second with the last fit. Lightpaths that are allocated on different partitions cannot interfere with each other. Thus the route partitioning avoids the interferences among lightpaths when retuning. The route partitioning problem is defined as an optimization problem to minimize the total interferences. Secondly, this thesis presents a defragmentation scheme using path exchanging in 1+1 path protected EONs. For 1+1 path protection, conventional defragmentation approaches consider designated primary and backup paths. This exposes the spectrum to fragmentations induced by the primary lightpaths, which are not to be disturbed in order to achieve hitless defragmentation. The presented path exchanging scheme exchanges the path function of the 1+1 protection with the primary toggling to the backup state while the backup becomes the primary. This allows both lightpaths to be reallocated during the defragmentation process while they work as backup, offering hitless defragmentation. Considering path exchanging, a static spectrum reallocation optimization problem that minimizes the spectrum fragmentation while limiting the number of path exchanging and reallocation operations is defined. For each of the presented schemes, after the problem is defined as an optimization problem, it is then formulated as an integer linear programming problem (ILP). A decision version of each defined problem is proven NP-complete. A heuristic algorithm is then introduced for large networks, where the ILP used to represent the problem is not tractable. The simulation results show that the proposed schemes outperform the conventional ones and improve the total admissible traffic.; 2016
• Source: fulltext; https://uec.repo.nii.ac.jp/?action=repository_action_common_download&item_id=8514&item_no=1&attribute_id=20&file_no=1
• Access Restrictions: インターネット公開
• Data Provider (Database): 国立情報学研究所 : 学術機関リポジトリデータベース（IRDB）（機関リポジトリ）; https://irdb.nii.ac.jp
• Original Data Provider (Database): 電気通信大学 : 電気通信大学学術機関リポジトリ