{"title":"稀疏分割WDM网状网络中针对单链路故障的存活组播会话疏导","authors":"N. Sreenath, B. Palanisamy, S. Nadarajan","doi":"10.1109/ADCOM.2006.4289927","DOIUrl":null,"url":null,"abstract":"Cost effective grooming of several sessions with fractional wavelength bandwidth onto a single wavelength has become prominent in WDM networks. We, in this paper, address the problem of survivable routing and wavelength assignment of multicast sessions with sub-wavelength traffic demands in sparse splitting WDM networks. We assume a sparse splitting node architecture in which only a few nodes in the network are split-capable. A node with splitting capability can forward an incoming message to more than one outgoing link in the optical form. The multicast capability at the non-split nodes can be achieved by converting the optical signal into electronic form and transmitting in optical form onto all the required outgoing links. However, the traffic duplication at the electronic level is more expensive than the optical level in terms of the delay incurred due to the optical-electronic-optical (O/E/O) conversion. Since the multicast traffic grooming problem is computationally intractable, we adopt a heuristic approach called VSGroom which tries to minimize the resources required for electronic copying. We extend the notion of link disjoint, arc disjoint and path disjoint protection methodologies to groomed multicast sessions in order to protect them from single link failures. The performance of the various protection algorithms is studied and compared through extensive simulation experiments.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Grooming of Survivable Multicast Sessions Against Single Link Failures in Sparse Splitting WDM Mesh Networks\",\"authors\":\"N. Sreenath, B. Palanisamy, S. Nadarajan\",\"doi\":\"10.1109/ADCOM.2006.4289927\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cost effective grooming of several sessions with fractional wavelength bandwidth onto a single wavelength has become prominent in WDM networks. We, in this paper, address the problem of survivable routing and wavelength assignment of multicast sessions with sub-wavelength traffic demands in sparse splitting WDM networks. We assume a sparse splitting node architecture in which only a few nodes in the network are split-capable. A node with splitting capability can forward an incoming message to more than one outgoing link in the optical form. The multicast capability at the non-split nodes can be achieved by converting the optical signal into electronic form and transmitting in optical form onto all the required outgoing links. However, the traffic duplication at the electronic level is more expensive than the optical level in terms of the delay incurred due to the optical-electronic-optical (O/E/O) conversion. Since the multicast traffic grooming problem is computationally intractable, we adopt a heuristic approach called VSGroom which tries to minimize the resources required for electronic copying. We extend the notion of link disjoint, arc disjoint and path disjoint protection methodologies to groomed multicast sessions in order to protect them from single link failures. The performance of the various protection algorithms is studied and compared through extensive simulation experiments.\",\"PeriodicalId\":296627,\"journal\":{\"name\":\"2006 International Conference on Advanced Computing and Communications\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Conference on Advanced Computing and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ADCOM.2006.4289927\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Conference on Advanced Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ADCOM.2006.4289927","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Grooming of Survivable Multicast Sessions Against Single Link Failures in Sparse Splitting WDM Mesh Networks
Cost effective grooming of several sessions with fractional wavelength bandwidth onto a single wavelength has become prominent in WDM networks. We, in this paper, address the problem of survivable routing and wavelength assignment of multicast sessions with sub-wavelength traffic demands in sparse splitting WDM networks. We assume a sparse splitting node architecture in which only a few nodes in the network are split-capable. A node with splitting capability can forward an incoming message to more than one outgoing link in the optical form. The multicast capability at the non-split nodes can be achieved by converting the optical signal into electronic form and transmitting in optical form onto all the required outgoing links. However, the traffic duplication at the electronic level is more expensive than the optical level in terms of the delay incurred due to the optical-electronic-optical (O/E/O) conversion. Since the multicast traffic grooming problem is computationally intractable, we adopt a heuristic approach called VSGroom which tries to minimize the resources required for electronic copying. We extend the notion of link disjoint, arc disjoint and path disjoint protection methodologies to groomed multicast sessions in order to protect them from single link failures. The performance of the various protection algorithms is studied and compared through extensive simulation experiments.