Jiahui Wu, Min Zhang, F. Wang, Yanan Yue, Shanguo Huang
{"title":"弹性光网络中基于最优独立集的贪婪光谱碎片整理算法","authors":"Jiahui Wu, Min Zhang, F. Wang, Yanan Yue, Shanguo Huang","doi":"10.1109/ICOCN.2014.6987056","DOIUrl":null,"url":null,"abstract":"We quantify the fragmentation in elastic optical networks and propose a defragmentation algorithm which takes network's existing condition of spectrum allocation into consideration for the first time, we simulate the blocking probability (BP) together with spectrum continuous degree of networks after using three different algorithms. The results show our defragmentation algorithm has better performance compared to the existing strategies.","PeriodicalId":364683,"journal":{"name":"2014 13th International Conference on Optical Communications and Networks (ICOCN)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An optimal independent sets based greedy spectral defragmentation algorithm in elastic optical network\",\"authors\":\"Jiahui Wu, Min Zhang, F. Wang, Yanan Yue, Shanguo Huang\",\"doi\":\"10.1109/ICOCN.2014.6987056\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We quantify the fragmentation in elastic optical networks and propose a defragmentation algorithm which takes network's existing condition of spectrum allocation into consideration for the first time, we simulate the blocking probability (BP) together with spectrum continuous degree of networks after using three different algorithms. The results show our defragmentation algorithm has better performance compared to the existing strategies.\",\"PeriodicalId\":364683,\"journal\":{\"name\":\"2014 13th International Conference on Optical Communications and Networks (ICOCN)\",\"volume\":\"72 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 13th International Conference on Optical Communications and Networks (ICOCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOCN.2014.6987056\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 13th International Conference on Optical Communications and Networks (ICOCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOCN.2014.6987056","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An optimal independent sets based greedy spectral defragmentation algorithm in elastic optical network
We quantify the fragmentation in elastic optical networks and propose a defragmentation algorithm which takes network's existing condition of spectrum allocation into consideration for the first time, we simulate the blocking probability (BP) together with spectrum continuous degree of networks after using three different algorithms. The results show our defragmentation algorithm has better performance compared to the existing strategies.