Improving communication network topologies using tabu search

S. Pierre, A. Elgibaoui
{"title":"Improving communication network topologies using tabu search","authors":"S. Pierre, A. Elgibaoui","doi":"10.1109/LCN.1997.630901","DOIUrl":null,"url":null,"abstract":"This paper proposes a tabu search approach for improving communication network topologies. The problem consists of finding, for a given set of nodes and traffic requirements, a network topology that minimizes the communication cost taking into account some performance and reliability constraints. For this purpose, some moves or focal transformations called perturbations are applied to a starting topology in order to reduce the communication cost or the average packet delay. Preliminary results demonstrate the capability of such an approach to improve the communication cost as well as some performance attributes of network topologies.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 22nd Annual Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.1997.630901","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

This paper proposes a tabu search approach for improving communication network topologies. The problem consists of finding, for a given set of nodes and traffic requirements, a network topology that minimizes the communication cost taking into account some performance and reliability constraints. For this purpose, some moves or focal transformations called perturbations are applied to a starting topology in order to reduce the communication cost or the average packet delay. Preliminary results demonstrate the capability of such an approach to improve the communication cost as well as some performance attributes of network topologies.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用禁忌搜索改进通信网络拓扑
提出了一种改进通信网络拓扑结构的禁忌搜索方法。这个问题包括在考虑到一些性能和可靠性约束的情况下,为给定的一组节点和流量需求找到最小化通信成本的网络拓扑。为此,在起始拓扑上应用一些称为微扰的移动或焦点变换,以减少通信成本或平均数据包延迟。初步结果表明,该方法能够提高网络拓扑结构的通信成本和一些性能属性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Reducing the effects of large propagation delays on high speed IEEE 802.3 CSMA/CD networks using collision truncation Efficient fault-tolerant reliable broadcast in an extended LAN An ultra light weight CAC mechanism (UL-CAC) for soft guarantee in ATM networks Distributed shared memory layer for cooperative work applications Protocol implementation in a vertically structured operating system
×
引用
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