Jiading Wang, Hejun Xuan, Yuping Wang, Yuanchao Yang, Sen Liu
{"title":"弹性光网络中路由与频谱分配的优化模型与算法","authors":"Jiading Wang, Hejun Xuan, Yuping Wang, Yuanchao Yang, Sen Liu","doi":"10.1109/CIS2018.2018.00074","DOIUrl":null,"url":null,"abstract":"In this paper, the problem of routing and spectrum assignment for static connection requests in elastic optical networks (EONs) is studied. Two different ratios of blocking formations are adopted, and a global constraint optimization model is established to minimize the ratio of blocking in the network. First, we propose an availability index of the frequency slots in the path. Second, a strategy of routing is designed by considering the two indexes of path length and availability index to judge the quality of the path. Then, a greedy strategy, which can obtain the largest availability index in the path after the frequency slot allocated, is proposed for the sake of assigning the spectra effectively. Simulation experiments were carried out in two network topologies. The two different ratios of blocking are obtained for different sorting strategy for connection requests and the number of connection requests. The experimental results show that the routing and spectrum assignment scheme designed in this paper can get a small ratio of blocking.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimization Model and Algorithm for Routing and Spectrum Assignment in Elastic Optical Networks\",\"authors\":\"Jiading Wang, Hejun Xuan, Yuping Wang, Yuanchao Yang, Sen Liu\",\"doi\":\"10.1109/CIS2018.2018.00074\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the problem of routing and spectrum assignment for static connection requests in elastic optical networks (EONs) is studied. Two different ratios of blocking formations are adopted, and a global constraint optimization model is established to minimize the ratio of blocking in the network. First, we propose an availability index of the frequency slots in the path. Second, a strategy of routing is designed by considering the two indexes of path length and availability index to judge the quality of the path. Then, a greedy strategy, which can obtain the largest availability index in the path after the frequency slot allocated, is proposed for the sake of assigning the spectra effectively. Simulation experiments were carried out in two network topologies. The two different ratios of blocking are obtained for different sorting strategy for connection requests and the number of connection requests. The experimental results show that the routing and spectrum assignment scheme designed in this paper can get a small ratio of blocking.\",\"PeriodicalId\":185099,\"journal\":{\"name\":\"2018 14th International Conference on Computational Intelligence and Security (CIS)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 14th International Conference on Computational Intelligence and Security (CIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS2018.2018.00074\",\"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 14th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS2018.2018.00074","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimization Model and Algorithm for Routing and Spectrum Assignment in Elastic Optical Networks
In this paper, the problem of routing and spectrum assignment for static connection requests in elastic optical networks (EONs) is studied. Two different ratios of blocking formations are adopted, and a global constraint optimization model is established to minimize the ratio of blocking in the network. First, we propose an availability index of the frequency slots in the path. Second, a strategy of routing is designed by considering the two indexes of path length and availability index to judge the quality of the path. Then, a greedy strategy, which can obtain the largest availability index in the path after the frequency slot allocated, is proposed for the sake of assigning the spectra effectively. Simulation experiments were carried out in two network topologies. The two different ratios of blocking are obtained for different sorting strategy for connection requests and the number of connection requests. The experimental results show that the routing and spectrum assignment scheme designed in this paper can get a small ratio of blocking.