{"title":"WDM疏导网络中的在线组播路由","authors":"A. Vishwanath, W. Liang","doi":"10.1109/ICCCN.2005.1523861","DOIUrl":null,"url":null,"abstract":"This paper considers the problem of on-line multicast routing in WDM grooming optical mesh networks without wavelength conversion capability. In such networks, provisioning of connection requests with fractional wavelength capacity requirements is achieved by dividing a wavelength into multiple time slots and multiplexing traffic on the wavelength. We present an on-line multicast traffic grooming algorithm for the concerned problem. The objective is to efficiently route multicast requests with sub-wavelength capacity requirements onto high-capacity wavelengths, and balance the load on the links in the network at the same time. To do so, we propose a cost function, which not only encourages grooming new requests onto the wavelengths that are being used by existing traffic, but also performs load balancing by intelligently increasing the cost of using wavelengths on links. The performance results obtained by experiments on a representative sized mesh network show that the proposed algorithm outperforms the other existing algorithms.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"On-line multicast routing in WDM grooming networks\",\"authors\":\"A. Vishwanath, W. Liang\",\"doi\":\"10.1109/ICCCN.2005.1523861\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the problem of on-line multicast routing in WDM grooming optical mesh networks without wavelength conversion capability. In such networks, provisioning of connection requests with fractional wavelength capacity requirements is achieved by dividing a wavelength into multiple time slots and multiplexing traffic on the wavelength. We present an on-line multicast traffic grooming algorithm for the concerned problem. The objective is to efficiently route multicast requests with sub-wavelength capacity requirements onto high-capacity wavelengths, and balance the load on the links in the network at the same time. To do so, we propose a cost function, which not only encourages grooming new requests onto the wavelengths that are being used by existing traffic, but also performs load balancing by intelligently increasing the cost of using wavelengths on links. The performance results obtained by experiments on a representative sized mesh network show that the proposed algorithm outperforms the other existing algorithms.\",\"PeriodicalId\":379037,\"journal\":{\"name\":\"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2005.1523861\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2005.1523861","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On-line multicast routing in WDM grooming networks
This paper considers the problem of on-line multicast routing in WDM grooming optical mesh networks without wavelength conversion capability. In such networks, provisioning of connection requests with fractional wavelength capacity requirements is achieved by dividing a wavelength into multiple time slots and multiplexing traffic on the wavelength. We present an on-line multicast traffic grooming algorithm for the concerned problem. The objective is to efficiently route multicast requests with sub-wavelength capacity requirements onto high-capacity wavelengths, and balance the load on the links in the network at the same time. To do so, we propose a cost function, which not only encourages grooming new requests onto the wavelengths that are being used by existing traffic, but also performs load balancing by intelligently increasing the cost of using wavelengths on links. The performance results obtained by experiments on a representative sized mesh network show that the proposed algorithm outperforms the other existing algorithms.