BFCA-VF: Best fit channel allocation and void filling by burst segmenting and scheduling

Venkata Rao Tavanam, D. S. Venkateswarlu, Karuna Sagar Dasari
{"title":"BFCA-VF: Best fit channel allocation and void filling by burst segmenting and scheduling","authors":"Venkata Rao Tavanam, D. S. Venkateswarlu, Karuna Sagar Dasari","doi":"10.1109/ICRAIE.2014.6909111","DOIUrl":null,"url":null,"abstract":"Optical Burst Switching (OBS) is a novel data transferring paradigm in rapidly growing Internet communication. The QoS factor of this OBS is syncing the bursts and available channels through a scheduling strategy such that the burst drop is minimal. Affirmation of the recent literature confirms that only 3 strategies Horizon, FFUC-VF and LAUC-VF are considerably performing to schedule bursts. But none of these models are considering all the QoS factors such as minimal Burst loss, speedy scheduling and minimal scheduling time complexity. In this paper, we propose a novel segmentation based algorithms for scheduling bursts in OBS networks without Fiber Delay Lines (FDLs). In networks without FDLs, our proposed burst scheduling algorithm can achieve scalability and linear time complexity (O(m) time, where m is the total number of void intervals) in channel scheduling and void filling by burst re-segmentation and scheduling strategy. Simulation results indicating that the proposed scheduling strategy is with minimal loss rate and time complexity that compared to LAUC-VF, ODBR and ABR, performs faster as like as Horizon scheduling strategy.","PeriodicalId":355706,"journal":{"name":"International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRAIE.2014.6909111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Optical Burst Switching (OBS) is a novel data transferring paradigm in rapidly growing Internet communication. The QoS factor of this OBS is syncing the bursts and available channels through a scheduling strategy such that the burst drop is minimal. Affirmation of the recent literature confirms that only 3 strategies Horizon, FFUC-VF and LAUC-VF are considerably performing to schedule bursts. But none of these models are considering all the QoS factors such as minimal Burst loss, speedy scheduling and minimal scheduling time complexity. In this paper, we propose a novel segmentation based algorithms for scheduling bursts in OBS networks without Fiber Delay Lines (FDLs). In networks without FDLs, our proposed burst scheduling algorithm can achieve scalability and linear time complexity (O(m) time, where m is the total number of void intervals) in channel scheduling and void filling by burst re-segmentation and scheduling strategy. Simulation results indicating that the proposed scheduling strategy is with minimal loss rate and time complexity that compared to LAUC-VF, ODBR and ABR, performs faster as like as Horizon scheduling strategy.
BFCA-VF:通过突发分割和调度实现最合适的信道分配和空隙填充
光突发交换(OBS)是快速发展的互联网通信中出现的一种新的数据传输模式。该OBS的QoS因素是通过调度策略同步突发和可用信道,使突发下降最小。最近的文献证实,只有3种策略Horizon, FFUC-VF和LAUC-VF在调度突发上表现相当好。但是这些模型都没有考虑到最小突发损失、快速调度和最小调度时间复杂度等所有QoS因素。在本文中,我们提出了一种新的基于分段的无光纤延迟线的OBS网络突发调度算法。在没有fdl的网络中,我们提出的突发调度算法在通道调度和通过突发再分割和调度策略填充空隙时可以实现可扩展性和线性时间复杂度(O(m)时间,其中m为空隙间隔总数)。仿真结果表明,该调度策略具有最小的损失率和时间复杂度,与lac - vf、ODBR和ABR调度策略相比,执行速度快于地平线调度策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信