{"title":"具有自适应路由和业务量疏导的动态光网络中波长分配启发式算法的性能","authors":"L. P. Ribeiro, M. Barros, M.S. de Alencar","doi":"10.1109/IMOC.2011.6169325","DOIUrl":null,"url":null,"abstract":"This paper present the performance analysis of the wavelength assignment four heuristics First-Fit, Random, Least-Used and Most-Used, considering adaptive routing and traffic grooming capabilities in the network. The goal of this comparison is to verify if some of those algorithms present a better performance with relation to First-Fit, considering these capabilities.","PeriodicalId":179351,"journal":{"name":"2011 SBMO/IEEE MTT-S International Microwave and Optoelectronics Conference (IMOC 2011)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Performance of wavelength assignment heuristics in a dynamic optical network with adaptive routing and traffic grooming\",\"authors\":\"L. P. Ribeiro, M. Barros, M.S. de Alencar\",\"doi\":\"10.1109/IMOC.2011.6169325\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper present the performance analysis of the wavelength assignment four heuristics First-Fit, Random, Least-Used and Most-Used, considering adaptive routing and traffic grooming capabilities in the network. The goal of this comparison is to verify if some of those algorithms present a better performance with relation to First-Fit, considering these capabilities.\",\"PeriodicalId\":179351,\"journal\":{\"name\":\"2011 SBMO/IEEE MTT-S International Microwave and Optoelectronics Conference (IMOC 2011)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 SBMO/IEEE MTT-S International Microwave and Optoelectronics Conference (IMOC 2011)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMOC.2011.6169325\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 SBMO/IEEE MTT-S International Microwave and Optoelectronics Conference (IMOC 2011)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMOC.2011.6169325","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Performance of wavelength assignment heuristics in a dynamic optical network with adaptive routing and traffic grooming
This paper present the performance analysis of the wavelength assignment four heuristics First-Fit, Random, Least-Used and Most-Used, considering adaptive routing and traffic grooming capabilities in the network. The goal of this comparison is to verify if some of those algorithms present a better performance with relation to First-Fit, considering these capabilities.