利用支配集方法确定计算机网络优化中的路由器位置

Nova El Maidah, Ivan Hardja, S. Slamin
{"title":"利用支配集方法确定计算机网络优化中的路由器位置","authors":"Nova El Maidah, Ivan Hardja, S. Slamin","doi":"10.11591/eecsi.v5i5.1647","DOIUrl":null,"url":null,"abstract":"The aims of this research is to develop a system to determine an optimal router location in a computer network. The router location is optimal if the computer network need the minimal number of router without losing the network connectivity. The methods used in order to optimize the router location are dominating set and Greedy algorithm. The data is the router location of computer network in University of Jember. The result showed that the optimal router needed in the networks is 4. These routers were found by using the determination system that implement Greedy algorithm to find the minimum number of dominating set.","PeriodicalId":20498,"journal":{"name":"Proceeding of the Electrical Engineering Computer Science and Informatics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Determination of Router Location for Optimizing Computer Network Using Dominating Set Methods\",\"authors\":\"Nova El Maidah, Ivan Hardja, S. Slamin\",\"doi\":\"10.11591/eecsi.v5i5.1647\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The aims of this research is to develop a system to determine an optimal router location in a computer network. The router location is optimal if the computer network need the minimal number of router without losing the network connectivity. The methods used in order to optimize the router location are dominating set and Greedy algorithm. The data is the router location of computer network in University of Jember. The result showed that the optimal router needed in the networks is 4. These routers were found by using the determination system that implement Greedy algorithm to find the minimum number of dominating set.\",\"PeriodicalId\":20498,\"journal\":{\"name\":\"Proceeding of the Electrical Engineering Computer Science and Informatics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceeding of the Electrical Engineering Computer Science and Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.11591/eecsi.v5i5.1647\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceeding of the Electrical Engineering Computer Science and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11591/eecsi.v5i5.1647","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本研究的目的是开发一个系统来确定计算机网络中的最佳路由器位置。如果计算机网络需要最少数量的路由器而又不失去网络连接,则路由器的位置是最优的。优化路由器位置的方法主要有支配集算法和贪心算法。数据是Jember大学计算机网络的路由器位置。结果表明,网络中所需的最优路由器为4。利用贪心算法求解控制集的最小个数的确定系统找到这些路由器。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Determination of Router Location for Optimizing Computer Network Using Dominating Set Methods
The aims of this research is to develop a system to determine an optimal router location in a computer network. The router location is optimal if the computer network need the minimal number of router without losing the network connectivity. The methods used in order to optimize the router location are dominating set and Greedy algorithm. The data is the router location of computer network in University of Jember. The result showed that the optimal router needed in the networks is 4. These routers were found by using the determination system that implement Greedy algorithm to find the minimum number of dominating set.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Estimated Profits of Rengginang Lorjuk Madura by Used Comparison of Holt-Winter and Moving Average Water Contents and Monoglycerides as Development Role of Biodiesel Standard in Indonesia for B30 Implementation Image Restoration Effect on DCT High Frequency Removal and Wiener Algorithm for Detecting Facial Key Points RAIKU: E-Commerce App Using Laravel Probabilistic Programming with Piecewise Objective Function for Solving Supplier Selection Problem with Price Discount and Probabilistic Demand
×
引用
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