{"title":"Fairness control in wavelength-routed WDM ring networks","authors":"K. Mosharaf, I. Lambadaris, J. Talim, A. Shokrani","doi":"10.1109/GLOCOM.2005.1578033","DOIUrl":null,"url":null,"abstract":"We investigate a threshold-based wavelength allocation scheme in order to support fairness and service differentiation in WDM unidirectional ring networks. A ring network can handle different classes of traffic streams, which differ by their hop-counts (i.e., the number of hops used from source to destination). We assume that for each class of traffic, call interarrival and holding times are exponentially distributed. In such a network, classes of calls with smaller hop-counts, experience lower blocking rates than ones with greater hop-counts. In this paper, a multi-threshold wavelength allocation scheme is proposed to provide equal blocking probabilities experienced by different classes. A recursive simulation-based algorithm is designed to numerically compute the optimal thresholds. Simulation results compare the performance of our proposed scheme, with that of complete sharing and complete partitioning schemes","PeriodicalId":319736,"journal":{"name":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2005.1578033","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
We investigate a threshold-based wavelength allocation scheme in order to support fairness and service differentiation in WDM unidirectional ring networks. A ring network can handle different classes of traffic streams, which differ by their hop-counts (i.e., the number of hops used from source to destination). We assume that for each class of traffic, call interarrival and holding times are exponentially distributed. In such a network, classes of calls with smaller hop-counts, experience lower blocking rates than ones with greater hop-counts. In this paper, a multi-threshold wavelength allocation scheme is proposed to provide equal blocking probabilities experienced by different classes. A recursive simulation-based algorithm is designed to numerically compute the optimal thresholds. Simulation results compare the performance of our proposed scheme, with that of complete sharing and complete partitioning schemes