Algoritmos para Solução do Problema de Atribuição de Capacidades Discretas em Redes TCP/IP

Eduardo Yabcznski, E. Wille, H. D. S. Lopes
{"title":"Algoritmos para Solução do Problema de Atribuição de Capacidades Discretas em Redes TCP/IP","authors":"Eduardo Yabcznski, E. Wille, H. D. S. Lopes","doi":"10.14209/sbrt.2008.42851","DOIUrl":null,"url":null,"abstract":"This article is concerned with the dimensioning of IP networks when submitted to TCP traffic. The problem taken into account is the Discrete Capacity Assignment where capacity values for each network link are chosen based on a set of discrete values. Three techniques are proposed to deal with it: Exaustive Search (ES), Particle Swarm Optimization (PSO) and a restriction based heuristic. Keywords— Dimensioning of IP networks, Discrete Capacity Assignment, Exaustive Search, Particle Swarm Optimization.","PeriodicalId":340055,"journal":{"name":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14209/sbrt.2008.42851","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This article is concerned with the dimensioning of IP networks when submitted to TCP traffic. The problem taken into account is the Discrete Capacity Assignment where capacity values for each network link are chosen based on a set of discrete values. Three techniques are proposed to deal with it: Exaustive Search (ES), Particle Swarm Optimization (PSO) and a restriction based heuristic. Keywords— Dimensioning of IP networks, Discrete Capacity Assignment, Exaustive Search, Particle Swarm Optimization.
解决TCP/IP网络离散容量分配问题的算法
本文关注的是提交到TCP通信时IP网络的维度。所考虑的问题是离散容量分配,其中每个网络链路的容量值是根据一组离散值选择的。提出了三种解决方法:穷举搜索(ES)、粒子群优化(PSO)和基于约束的启发式算法。关键词:IP网络维数,离散容量分配,穷举搜索,粒子群优化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信