光WDM网络静态虚拟拓扑设计的两种新算法

R. Datta, S. Ghose, I. Sengupta
{"title":"光WDM网络静态虚拟拓扑设计的两种新算法","authors":"R. Datta, S. Ghose, I. Sengupta","doi":"10.1142/S0219799507000576","DOIUrl":null,"url":null,"abstract":"In this paper, we present two improved algorithms to establish lightpaths in a physical topology for the formation of a static WDM virtual topology. One of the major design issues in these networks is the volume of traffic in the intermediate nodes and the number of optical hops between network nodes so that the delay is less and at the same time greater capacity can be achieved. We first present an algorithm that is based on average weighted hop count as objective function to generate connection requests for connecting physical nodes optically. The second algorithm is a lookahead version of our first algorithm. We study the performances of the algorithms with regard to the performance metrics such as number of requests blocked, maximum hops required from a source to destination, maximum traffic to be handled in a node, average intermediate traffic and average spare wavelengths remaining after the completion of the virtual topologies. We find that on the average the lookahead scheme optimizes the objective function better, but at the cost of maximum load in any node. To improve the wavelength utilization we also discuss a wavelength assignment algorithm which uses the best alternate physical path while establishing lightpaths. We have simulated about six thousand random graphs of various sizes and densities to show how our algorithm behaves in comparison to a widely used existing algorithm.","PeriodicalId":185917,"journal":{"name":"Int. J. Wirel. Opt. Commun.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Two New Algorithms for Static Virtual Topology Design in Optical WDM Networks\",\"authors\":\"R. Datta, S. Ghose, I. Sengupta\",\"doi\":\"10.1142/S0219799507000576\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present two improved algorithms to establish lightpaths in a physical topology for the formation of a static WDM virtual topology. One of the major design issues in these networks is the volume of traffic in the intermediate nodes and the number of optical hops between network nodes so that the delay is less and at the same time greater capacity can be achieved. We first present an algorithm that is based on average weighted hop count as objective function to generate connection requests for connecting physical nodes optically. The second algorithm is a lookahead version of our first algorithm. We study the performances of the algorithms with regard to the performance metrics such as number of requests blocked, maximum hops required from a source to destination, maximum traffic to be handled in a node, average intermediate traffic and average spare wavelengths remaining after the completion of the virtual topologies. We find that on the average the lookahead scheme optimizes the objective function better, but at the cost of maximum load in any node. To improve the wavelength utilization we also discuss a wavelength assignment algorithm which uses the best alternate physical path while establishing lightpaths. We have simulated about six thousand random graphs of various sizes and densities to show how our algorithm behaves in comparison to a widely used existing algorithm.\",\"PeriodicalId\":185917,\"journal\":{\"name\":\"Int. J. Wirel. Opt. Commun.\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Wirel. Opt. Commun.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/S0219799507000576\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Wirel. Opt. Commun.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S0219799507000576","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在本文中,我们提出了两种改进的算法来在物理拓扑中建立光路,以形成静态WDM虚拟拓扑。这些网络的主要设计问题之一是中间节点的通信量和网络节点之间的光跳数,以便在实现更大容量的同时减少延迟。我们首先提出了一种基于平均加权跳数作为目标函数来生成连接请求的算法,用于光连接物理节点。第二个算法是第一个算法的前瞻版本。我们研究了算法的性能指标,如请求阻塞的数量,从源到目的地所需的最大跳数,在节点中处理的最大流量,平均中间流量和完成虚拟拓扑后剩余的平均空闲波长。我们发现,平均而言,前瞻性方案能更好地优化目标函数,但代价是在任何节点上的最大负载。为了提高波长利用率,我们还讨论了在建立光路时使用最佳替代物理路径的波长分配算法。我们模拟了大约6000个不同大小和密度的随机图,以显示我们的算法与广泛使用的现有算法相比的表现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Two New Algorithms for Static Virtual Topology Design in Optical WDM Networks
In this paper, we present two improved algorithms to establish lightpaths in a physical topology for the formation of a static WDM virtual topology. One of the major design issues in these networks is the volume of traffic in the intermediate nodes and the number of optical hops between network nodes so that the delay is less and at the same time greater capacity can be achieved. We first present an algorithm that is based on average weighted hop count as objective function to generate connection requests for connecting physical nodes optically. The second algorithm is a lookahead version of our first algorithm. We study the performances of the algorithms with regard to the performance metrics such as number of requests blocked, maximum hops required from a source to destination, maximum traffic to be handled in a node, average intermediate traffic and average spare wavelengths remaining after the completion of the virtual topologies. We find that on the average the lookahead scheme optimizes the objective function better, but at the cost of maximum load in any node. To improve the wavelength utilization we also discuss a wavelength assignment algorithm which uses the best alternate physical path while establishing lightpaths. We have simulated about six thousand random graphs of various sizes and densities to show how our algorithm behaves in comparison to a widely used existing algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信