{"title":"基于现有光路感知区域的大型WDM网状光网络中高效、可扩展的动态业务疏导方法","authors":"Quang-Dung Ho, T. Le-Ngoc, M. Lee","doi":"10.1109/ACCESSNETS.2007.4447144","DOIUrl":null,"url":null,"abstract":"This paper proposes an efficient and scalable dynamic traffic grooming algorithm suitable for large WDM mesh networks by limiting the zone where lightpaths for new connection requests are searched. Besides, in order to maintain the multi-hop grooming flexibility, the searching zone can be dynamically enlarged according to the availability of groomable existing or new lightpaths and the physical connectivity between network nodes. We develop a mathematical model to estimate the possibility that a node connects the source and destination when included to enlarge the searching zone, and to ensure that the selected lightpath is resource-efficient. Simulation results demonstrate that the proposed algorithm can significantly reduce the computations and improve the blocking performance.","PeriodicalId":393914,"journal":{"name":"2007 Second International Conference on Access Networks & Workshops","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Existing-lightpath-aware zone-based approach for efficient and scalable dynamic traffic grooming in large optical WDM mesh networks\",\"authors\":\"Quang-Dung Ho, T. Le-Ngoc, M. Lee\",\"doi\":\"10.1109/ACCESSNETS.2007.4447144\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an efficient and scalable dynamic traffic grooming algorithm suitable for large WDM mesh networks by limiting the zone where lightpaths for new connection requests are searched. Besides, in order to maintain the multi-hop grooming flexibility, the searching zone can be dynamically enlarged according to the availability of groomable existing or new lightpaths and the physical connectivity between network nodes. We develop a mathematical model to estimate the possibility that a node connects the source and destination when included to enlarge the searching zone, and to ensure that the selected lightpath is resource-efficient. Simulation results demonstrate that the proposed algorithm can significantly reduce the computations and improve the blocking performance.\",\"PeriodicalId\":393914,\"journal\":{\"name\":\"2007 Second International Conference on Access Networks & Workshops\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 Second International Conference on Access Networks & Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACCESSNETS.2007.4447144\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 Second International Conference on Access Networks & Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACCESSNETS.2007.4447144","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Existing-lightpath-aware zone-based approach for efficient and scalable dynamic traffic grooming in large optical WDM mesh networks
This paper proposes an efficient and scalable dynamic traffic grooming algorithm suitable for large WDM mesh networks by limiting the zone where lightpaths for new connection requests are searched. Besides, in order to maintain the multi-hop grooming flexibility, the searching zone can be dynamically enlarged according to the availability of groomable existing or new lightpaths and the physical connectivity between network nodes. We develop a mathematical model to estimate the possibility that a node connects the source and destination when included to enlarge the searching zone, and to ensure that the selected lightpath is resource-efficient. Simulation results demonstrate that the proposed algorithm can significantly reduce the computations and improve the blocking performance.