{"title":"Wavelength and Offset Window Assignment Schemes to Avoid Contention in OBS Rings","authors":"A. Agusti-Torra, C. Cervelló-Pastor, M. A. Fiol","doi":"10.1109/BROADNETS.2006.4374375","DOIUrl":null,"url":null,"abstract":"This paper proposes a simple procedure to ensure burst transmission without losses in Optical Burst Switching ring networks. The contention problem is solved by providing a scheme that pre-assigns, to each communication, a given wavelength and an offset window. This approach does not need any additional control information and, since burst contention is avoided, the network capacity and the wavelength utilization are maximized under dynamic traffic assumptions. The study is done by using techniques from graph theory. In particular, the so-called (acyclic) restriction digraphs provide a sharp lower bound for the number of required wavelengths, and support a greedy algorithm for assigning a suitable offset window to each communication. An alternative formulation of the obtained schemes, in terms of matrices, is also discussed. Simulation results of different feasible solutions are provided, showing low transmission delays and quite balanced wavelength utilization.","PeriodicalId":147887,"journal":{"name":"2006 3rd International Conference on Broadband Communications, Networks and Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 3rd International Conference on Broadband Communications, Networks and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BROADNETS.2006.4374375","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
This paper proposes a simple procedure to ensure burst transmission without losses in Optical Burst Switching ring networks. The contention problem is solved by providing a scheme that pre-assigns, to each communication, a given wavelength and an offset window. This approach does not need any additional control information and, since burst contention is avoided, the network capacity and the wavelength utilization are maximized under dynamic traffic assumptions. The study is done by using techniques from graph theory. In particular, the so-called (acyclic) restriction digraphs provide a sharp lower bound for the number of required wavelengths, and support a greedy algorithm for assigning a suitable offset window to each communication. An alternative formulation of the obtained schemes, in terms of matrices, is also discussed. Simulation results of different feasible solutions are provided, showing low transmission delays and quite balanced wavelength utilization.