Improvement of Network Flow Using Multi-Commodity Flow Problem

IF 3.6 3区 医学 Q2 NEUROSCIENCES Network Neuroscience Pub Date : 2023-04-04 DOI:10.3390/network3020012
Takato Fukugami, Tomofumi Matsuzawa
{"title":"Improvement of Network Flow Using Multi-Commodity Flow Problem","authors":"Takato Fukugami, Tomofumi Matsuzawa","doi":"10.3390/network3020012","DOIUrl":null,"url":null,"abstract":"In recent years, Internet traffic has increased due to its widespread use. This can be attributed to the growth of social games on smartphones and video distribution services with increasingly high image quality. In these situations, a routing mechanism is required to control congestion, but most existing routing protocols select a single optimal path. This causes the load to be concentrated on certain links, increasing the risk of congestion. In addition to the optimal path, the network has redundant paths leading to the destination node. In this study, we propose a multipath control with multi-commodity flow problem. Comparing the proposed method with OSPF, which is single-path control, and OSPF-ECMP, which is multipath control, we confirmed that the proposed method records higher packet arrival rates. This is expected to reduce congestion.","PeriodicalId":48520,"journal":{"name":"Network Neuroscience","volume":"12 1","pages":"239-252"},"PeriodicalIF":3.6000,"publicationDate":"2023-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Network Neuroscience","FirstCategoryId":"3","ListUrlMain":"https://doi.org/10.3390/network3020012","RegionNum":3,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"NEUROSCIENCES","Score":null,"Total":0}
引用次数: 0

Abstract

In recent years, Internet traffic has increased due to its widespread use. This can be attributed to the growth of social games on smartphones and video distribution services with increasingly high image quality. In these situations, a routing mechanism is required to control congestion, but most existing routing protocols select a single optimal path. This causes the load to be concentrated on certain links, increasing the risk of congestion. In addition to the optimal path, the network has redundant paths leading to the destination node. In this study, we propose a multipath control with multi-commodity flow problem. Comparing the proposed method with OSPF, which is single-path control, and OSPF-ECMP, which is multipath control, we confirmed that the proposed method records higher packet arrival rates. This is expected to reduce congestion.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用多商品流问题改进网络流
近年来,由于互联网的广泛使用,互联网流量有所增加。这可以归因于智能手机社交游戏的发展以及图像质量越来越高的视频分销服务。在这些情况下,需要一种路由机制来控制拥塞,但大多数现有的路由协议选择单一的最优路径。这导致负载集中在某些链接上,增加了拥塞的风险。除了最优路径外,网络中还有通往目的节点的冗余路径。在本研究中,我们提出了一个多商品流问题的多路径控制。将该方法与单路径控制的OSPF和多路径控制的OSPF- ecmp进行比较,证实了该方法具有较高的报文到达率。预计这将减少拥堵。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Network Neuroscience
Network Neuroscience NEUROSCIENCES-
CiteScore
6.40
自引率
6.40%
发文量
68
审稿时长
16 weeks
期刊最新文献
Brain signaling becomes less integrated and more segregated with age. CoCoNest: A continuous structural connectivity-based nested family of parcellations of the human cerebral cortex. Cognitive abilities are associated with rapid dynamics of electrophysiological connectome states. Contrasting topologies of synchronous and asynchronous functional brain networks. Exploring memory-related network via dorsal hippocampus suppression.
×
引用
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