分布式信息控制系统中二级数据传输网络中网关位置的确定

Mihail N. Yokhin, M. M. Stepanov
{"title":"分布式信息控制系统中二级数据传输网络中网关位置的确定","authors":"Mihail N. Yokhin, M. M. Stepanov","doi":"10.1109/EICONRUS.2018.8317052","DOIUrl":null,"url":null,"abstract":"The paper presents an algorithm to determine the location of two-channel gateways in two-level network to reduce response time of second-level network. To evaluate response time in second-level network with bus topology an integer functions are proposed. The algorithm is based on construction of approximation function by three special points or using the least squares method. It's shown for tree topology that construction of approximation function using three special points must be preceded by finding the numeration order of tree edges such that all edges corresponding to optimal values of the integer functions have adjacent numbers. The paper shows that in order to numerate edges in such a way a special condition based on the Hamiltonian cycle must be satisfied. If the condition is not hold the paper propose sequential procedure consisting of several steps of edges renumbering and local optimal values of approximation functions subset determination.","PeriodicalId":6562,"journal":{"name":"2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus)","volume":"42 1","pages":"153-158"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Determining location of gateways in two-level data transfer networks in distributed information control systems\",\"authors\":\"Mihail N. Yokhin, M. M. Stepanov\",\"doi\":\"10.1109/EICONRUS.2018.8317052\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents an algorithm to determine the location of two-channel gateways in two-level network to reduce response time of second-level network. To evaluate response time in second-level network with bus topology an integer functions are proposed. The algorithm is based on construction of approximation function by three special points or using the least squares method. It's shown for tree topology that construction of approximation function using three special points must be preceded by finding the numeration order of tree edges such that all edges corresponding to optimal values of the integer functions have adjacent numbers. The paper shows that in order to numerate edges in such a way a special condition based on the Hamiltonian cycle must be satisfied. If the condition is not hold the paper propose sequential procedure consisting of several steps of edges renumbering and local optimal values of approximation functions subset determination.\",\"PeriodicalId\":6562,\"journal\":{\"name\":\"2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus)\",\"volume\":\"42 1\",\"pages\":\"153-158\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EICONRUS.2018.8317052\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EICONRUS.2018.8317052","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

提出了一种在二级网络中确定双通道网关位置的算法,以减少二级网络的响应时间。为了评估具有总线拓扑的二级网络的响应时间,提出了一个整数函数。该算法基于三个特殊点构造近似函数或使用最小二乘法。在树形拓扑中,用三个特殊点构造逼近函数之前,必须先求出树边的编号顺序,使得所有与整数函数最优值对应的边都有相邻的数。文中指出,为了用这种方法计算边,必须满足一个基于哈密顿循环的特殊条件。在不满足条件的情况下,提出了由边重新编号和逼近函数子集局部最优值确定等步骤组成的顺序处理方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Determining location of gateways in two-level data transfer networks in distributed information control systems
The paper presents an algorithm to determine the location of two-channel gateways in two-level network to reduce response time of second-level network. To evaluate response time in second-level network with bus topology an integer functions are proposed. The algorithm is based on construction of approximation function by three special points or using the least squares method. It's shown for tree topology that construction of approximation function using three special points must be preceded by finding the numeration order of tree edges such that all edges corresponding to optimal values of the integer functions have adjacent numbers. The paper shows that in order to numerate edges in such a way a special condition based on the Hamiltonian cycle must be satisfied. If the condition is not hold the paper propose sequential procedure consisting of several steps of edges renumbering and local optimal values of approximation functions subset determination.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信