{"title":"弹性光网络中的移动路由","authors":"I. Szczesniak, A. Jajszczyk, A. Pach","doi":"10.1109/ICCCHINA.2014.7008252","DOIUrl":null,"url":null,"abstract":"With the continuing growth of wireless high-bitrate services, the progressing integration of wireless and optical networks, and the eventual deployment of elastic optical networks, there is a need to support the mobile routing in the elastic optical networks. We propose a mobile routing algorithm which, in comparison with the two baseline routing algorithms, requires the lowest number of new links to configure when the connection is reconfigured, and achieves the highest probability of completing a connection. The performance evaluation was carried out with 1200 simulation runs.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Mobile routing in elastic optical networks\",\"authors\":\"I. Szczesniak, A. Jajszczyk, A. Pach\",\"doi\":\"10.1109/ICCCHINA.2014.7008252\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the continuing growth of wireless high-bitrate services, the progressing integration of wireless and optical networks, and the eventual deployment of elastic optical networks, there is a need to support the mobile routing in the elastic optical networks. We propose a mobile routing algorithm which, in comparison with the two baseline routing algorithms, requires the lowest number of new links to configure when the connection is reconfigured, and achieves the highest probability of completing a connection. The performance evaluation was carried out with 1200 simulation runs.\",\"PeriodicalId\":353402,\"journal\":{\"name\":\"2014 IEEE/CIC International Conference on Communications in China (ICCC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE/CIC International Conference on Communications in China (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCHINA.2014.7008252\",\"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 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCHINA.2014.7008252","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
With the continuing growth of wireless high-bitrate services, the progressing integration of wireless and optical networks, and the eventual deployment of elastic optical networks, there is a need to support the mobile routing in the elastic optical networks. We propose a mobile routing algorithm which, in comparison with the two baseline routing algorithms, requires the lowest number of new links to configure when the connection is reconfigured, and achieves the highest probability of completing a connection. The performance evaluation was carried out with 1200 simulation runs.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
