{"title":"单跳WDM业务训练光网络阻塞概率计算","authors":"J. Vardakas, V. Vassilakis, M. Logothetis","doi":"10.1109/ICTON.2007.4296352","DOIUrl":null,"url":null,"abstract":"Traffic grooming in Wavelength Division Multiplexing (WDM) optical networks is a promising technology for improving the performance and reducing the network cost. We study the blocking performance of a single-hop WDM traffic groomed optical network, by considering that different connections request service through a single optical link. In each connection the generated calls may come from a single or multiple service-classes. For the case of a single service-class we develop a novel analytical loss model to calculate Connection Blocking Probabilities (ConBP) and Call Blocking Probabilities (CBP). Also, we extend this model to support multiple service-classes. The accuracy of the calculations is verified by simulation and found to be absolutely satisfactory.","PeriodicalId":265478,"journal":{"name":"2007 9th International Conference on Transparent Optical Networks","volume":"415 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Calculating Blocking Probabilities in Single-Hop WDM Traffic Groomed Optical Networks\",\"authors\":\"J. Vardakas, V. Vassilakis, M. Logothetis\",\"doi\":\"10.1109/ICTON.2007.4296352\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traffic grooming in Wavelength Division Multiplexing (WDM) optical networks is a promising technology for improving the performance and reducing the network cost. We study the blocking performance of a single-hop WDM traffic groomed optical network, by considering that different connections request service through a single optical link. In each connection the generated calls may come from a single or multiple service-classes. For the case of a single service-class we develop a novel analytical loss model to calculate Connection Blocking Probabilities (ConBP) and Call Blocking Probabilities (CBP). Also, we extend this model to support multiple service-classes. The accuracy of the calculations is verified by simulation and found to be absolutely satisfactory.\",\"PeriodicalId\":265478,\"journal\":{\"name\":\"2007 9th International Conference on Transparent Optical Networks\",\"volume\":\"415 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 9th International Conference on Transparent Optical Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTON.2007.4296352\",\"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 9th International Conference on Transparent Optical Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTON.2007.4296352","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Calculating Blocking Probabilities in Single-Hop WDM Traffic Groomed Optical Networks
Traffic grooming in Wavelength Division Multiplexing (WDM) optical networks is a promising technology for improving the performance and reducing the network cost. We study the blocking performance of a single-hop WDM traffic groomed optical network, by considering that different connections request service through a single optical link. In each connection the generated calls may come from a single or multiple service-classes. For the case of a single service-class we develop a novel analytical loss model to calculate Connection Blocking Probabilities (ConBP) and Call Blocking Probabilities (CBP). Also, we extend this model to support multiple service-classes. The accuracy of the calculations is verified by simulation and found to be absolutely satisfactory.