KMITL
Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/123456789/1
Browse
2 results
Search Results
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Spectrum Slicer Placement for Elastic Optical Network With Sparse Slicers(2023-01-01) ;Pavarangkoon, Praphan ;Akaki, KaitoKitsuwan, NattapongThis paper investigates spectrum slicer placement problem under a spectrum allocation scheme that considers the splitting process to minimize the blocking probability for elastic optical network with sparse slicers. Unlike the conventional elastic optical network without slicers, the elastic optical network with slicers is able to split a spectrum band into several spectrum components by replicating the original spectrum band and filtering out an unwanted signal on each spectrum band. The largest L-shape fit allocation algorithm, which allocates a request to available slot areas with L-shape, is utilized to reduce the request blocking probability. We evaluate the performance of our scheme with various centrality policies on elastic optical network with sparse slicers, where the number of slicers is given. Simulation results show that our scheme with betweenness centrality significantly outperforms that with random centrality, degree centrality, and closeness centrality in terms of bandwidth blocking rate. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Scale-Based Slicer Placement in Elastic Optical Networks(2023-01-01) ;Kitsuwan, NattapongPavarangkoon, PraphanThis paper proposes a scale-based slicer placement scheme to reduce bandwidth blocking rate (BBR) in elastic optical networks (EONs). In EONs, a slicing-stitching technology is adopted to overcome a spectrum slot allocation rule that the spectrum slots of the same request must be consecutive on the same link. This technology is done by slicers to split a spectrum band into multiple sub-spectrum components. In EONs with limited slicers, determining equally the number of slicers on every node may not result in a low BBR since the traffic volume on each node is not the same. We investigate and determine the number of slicers needed for each node as a scale-based policy. The simulation results show that our scheme achieves a BBR reduction of 91%, compared to the conventional scheme.
