Distributed Routing Algorithms in all Optical Multi-Rings Topology Networks

L. Gastal, S. Rousseau
{"title":"Distributed Routing Algorithms in all Optical Multi-Rings Topology Networks","authors":"L. Gastal, S. Rousseau","doi":"10.1109/ICCGI.2007.22","DOIUrl":null,"url":null,"abstract":"This paper investigates the problem of minimizing the worst packet latency and maximizing the ratio of utilization in all-optical multi-rings topologies. The topology is composed of several rings connected through one switch. In this framework, a distributed management protocol as well as a switching protocol are proposed and analyzed along different types of traffic. One of the aims of this framework is to propose a distributed management protocol that controls the access resources and thus the number of packets in nodes. Indeed, simulations results show the variation, in terms of number of packets in buffers, between the proposed protocol and the well known token ring protocol. We first focus on the algorithmic complexity of the related problem in a one ring network. Then, we analyze simulation results provided by the OMnet++ simulator, in terms of packet delay, latency, utilization ratio of the network, and also number of packets in nodes buffer. We compare proposed protocols with the well known token ring protocol giving theoretical analysis and also simulation results.","PeriodicalId":102568,"journal":{"name":"2007 International Multi-Conference on Computing in the Global Information Technology (ICCGI'07)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Multi-Conference on Computing in the Global Information Technology (ICCGI'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCGI.2007.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper investigates the problem of minimizing the worst packet latency and maximizing the ratio of utilization in all-optical multi-rings topologies. The topology is composed of several rings connected through one switch. In this framework, a distributed management protocol as well as a switching protocol are proposed and analyzed along different types of traffic. One of the aims of this framework is to propose a distributed management protocol that controls the access resources and thus the number of packets in nodes. Indeed, simulations results show the variation, in terms of number of packets in buffers, between the proposed protocol and the well known token ring protocol. We first focus on the algorithmic complexity of the related problem in a one ring network. Then, we analyze simulation results provided by the OMnet++ simulator, in terms of packet delay, latency, utilization ratio of the network, and also number of packets in nodes buffer. We compare proposed protocols with the well known token ring protocol giving theoretical analysis and also simulation results.
全光多环拓扑网络中的分布式路由算法
本文研究了全光多环拓扑中最小化最坏分组延迟和最大化利用率的问题。该拓扑结构由多个环通过一个交换机连接而成。在此框架下,针对不同的业务类型,提出了分布式管理协议和交换协议,并进行了分析。该框架的目标之一是提出一种分布式管理协议来控制访问资源,从而控制节点中的数据包数量。实际上,仿真结果显示了所提出的协议与众所周知的令牌环协议之间在缓冲区中数据包数量方面的差异。我们首先关注单环网络中相关问题的算法复杂度。然后,我们对omnet++模拟器提供的仿真结果进行了分析,包括数据包延迟、时延、网络利用率以及节点缓冲区中的数据包数量。我们将所提出的协议与已知的令牌环协议进行了比较,给出了理论分析和仿真结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信