Fairness control in wavelength-routed WDM ring networks

K. Mosharaf, I. Lambadaris, J. Talim, A. Shokrani
{"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
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
波长路由WDM环网中的公平性控制
为了支持WDM单向环形网络的公平性和业务差异化,研究了一种基于阈值的波长分配方案。环形网络可以处理不同类型的流量流,这些流量流的不同之处是它们的跳数(即从源到目的所使用的跳数)。我们假设对于每一类流量,呼叫到达间隔和等待时间呈指数分布。在这样的网络中,具有较小跳数的调用类比具有较大跳数的调用类经历更低的阻塞率。本文提出了一种多阈值波长分配方案,以保证不同类别的阻塞率相等。设计了一种基于递归仿真的算法来数值计算最优阈值。仿真结果与完全共享和完全分区方案的性能进行了比较
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Route discovery and capacity of ad hoc networks An algorithm for exploiting channel time selectivity in pilot-aided MIMO systems Consistent proportional delay differentiation: a fuzzy control approach Quantization bounds on Grassmann manifolds of arbitrary dimensions and MIMO communications with feedback Hash-AV: fast virus signature scanning by cache-resident filters
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1