{"title":"弹性光网络中碎片抑制RSA算法:一种定量方法","authors":"K. Singh, S. Prakash Singh, S. Sengar","doi":"10.1109/BICOP.2018.8658350","DOIUrl":null,"url":null,"abstract":"Fragmentation is a complicated issue during online resource allocation in Elastic optical network (EON). It becomes more complicated if the connection is assumed to be dynamic in nature. In this paper for the dynamic (increase) connection, the probability density function of unused and used optical band is calculated. The role of smaller unused frequency slots on the spectral utilization is extensively analyzed through simulation. We propose a quantitative metric to quantify the fragmentation in a link. On the basis of metric, we propose a routing and spectral algorithm called Fragmentation suppressed RSA (FS-RSA). Our proposed FS-RSA helps in accommodating more number of connection by decreasing the fragmentation as compared to the conventional First fit and Random fit. The proposed scheme takes lesser computational time as compared to MinEnt RSA.","PeriodicalId":145258,"journal":{"name":"2018 IEEE British and Irish Conference on Optics and Photonics (BICOP)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Fragmentation Suppressed RSA Algorithm for Elastic Optical Network: A Quantitative approach\",\"authors\":\"K. Singh, S. Prakash Singh, S. Sengar\",\"doi\":\"10.1109/BICOP.2018.8658350\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Fragmentation is a complicated issue during online resource allocation in Elastic optical network (EON). It becomes more complicated if the connection is assumed to be dynamic in nature. In this paper for the dynamic (increase) connection, the probability density function of unused and used optical band is calculated. The role of smaller unused frequency slots on the spectral utilization is extensively analyzed through simulation. We propose a quantitative metric to quantify the fragmentation in a link. On the basis of metric, we propose a routing and spectral algorithm called Fragmentation suppressed RSA (FS-RSA). Our proposed FS-RSA helps in accommodating more number of connection by decreasing the fragmentation as compared to the conventional First fit and Random fit. The proposed scheme takes lesser computational time as compared to MinEnt RSA.\",\"PeriodicalId\":145258,\"journal\":{\"name\":\"2018 IEEE British and Irish Conference on Optics and Photonics (BICOP)\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE British and Irish Conference on Optics and Photonics (BICOP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BICOP.2018.8658350\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE British and Irish Conference on Optics and Photonics (BICOP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BICOP.2018.8658350","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fragmentation Suppressed RSA Algorithm for Elastic Optical Network: A Quantitative approach
Fragmentation is a complicated issue during online resource allocation in Elastic optical network (EON). It becomes more complicated if the connection is assumed to be dynamic in nature. In this paper for the dynamic (increase) connection, the probability density function of unused and used optical band is calculated. The role of smaller unused frequency slots on the spectral utilization is extensively analyzed through simulation. We propose a quantitative metric to quantify the fragmentation in a link. On the basis of metric, we propose a routing and spectral algorithm called Fragmentation suppressed RSA (FS-RSA). Our proposed FS-RSA helps in accommodating more number of connection by decreasing the fragmentation as compared to the conventional First fit and Random fit. The proposed scheme takes lesser computational time as compared to MinEnt RSA.