Moment Analysis of Age-Dependent Gossip Networks

IF 2.2 3区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Han Xu;Yinfei Xu;Tiecheng Song
{"title":"Moment Analysis of Age-Dependent Gossip Networks","authors":"Han Xu;Yinfei Xu;Tiecheng Song","doi":"10.1109/TIT.2024.3488860","DOIUrl":null,"url":null,"abstract":"We study a class of gossip networks where a source delivers fresh status updates through networks consisting of a set of gossiping nodes. Contrary to previous works, the source delivers updates subject to an age-dependent point process where the rates are related to the age process at each node. Moreover, our work divides the age-dependent gossip networks into two types, i.e., type-A and type-B, where the former allows only one node sampling from source and the latter allows all. We first prove the necessary Markovity and ergodicity of both age-dependent gossip networks and proceed with deriving the general form of unique stationary distributions. With these premises established, closed-form expressions of the stationary age moments for type-A networks with arbitrary topologies are derived with the help of SHSs, with three specified results given for the line, ring and fully-connected networks. Meanwhile, we prove that no closed-form expressions of stationary age moments can be obtained in type-B networks. An approximated model for arbitrary-connected type-B networks is proposed, where we formulate the stationary moment equations for the approximated SHSs under the guarantee of Lagrange stability. Then, we provide a moment closure method to solve two symmetric cases, i.e., fully-connected and ring networks, approximately and verify the effectiveness of our algorithm by comparing to the simulations.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 1","pages":"1-22"},"PeriodicalIF":2.2000,"publicationDate":"2024-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10740585/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

We study a class of gossip networks where a source delivers fresh status updates through networks consisting of a set of gossiping nodes. Contrary to previous works, the source delivers updates subject to an age-dependent point process where the rates are related to the age process at each node. Moreover, our work divides the age-dependent gossip networks into two types, i.e., type-A and type-B, where the former allows only one node sampling from source and the latter allows all. We first prove the necessary Markovity and ergodicity of both age-dependent gossip networks and proceed with deriving the general form of unique stationary distributions. With these premises established, closed-form expressions of the stationary age moments for type-A networks with arbitrary topologies are derived with the help of SHSs, with three specified results given for the line, ring and fully-connected networks. Meanwhile, we prove that no closed-form expressions of stationary age moments can be obtained in type-B networks. An approximated model for arbitrary-connected type-B networks is proposed, where we formulate the stationary moment equations for the approximated SHSs under the guarantee of Lagrange stability. Then, we provide a moment closure method to solve two symmetric cases, i.e., fully-connected and ring networks, approximately and verify the effectiveness of our algorithm by comparing to the simulations.
年龄相关八卦网络的矩分析
我们研究了一类八卦网络,其中一个源通过一组八卦节点组成的网络传递最新的状态更新。与以前的工作相反,源根据年龄相关的点过程提供更新,其中速率与每个节点的年龄过程相关。此外,我们的工作将年龄相关的八卦网络分为两种类型,即a型和b型,其中前者只允许从源采样一个节点,后者允许所有节点。我们首先证明了年龄相关八卦网络的必要马尔可夫性和遍历性,然后推导了唯一平稳分布的一般形式。在这些前提建立的基础上,利用SHSs导出了具有任意拓扑的a型网络的平稳年龄矩的封闭表达式,并给出了线、环和全连通网络的三个特定结果。同时,我们证明了在b型网络中不可能得到平稳年龄矩的闭形式表达式。提出了任意连接的b型网络的近似模型,在此模型中,我们给出了保证拉格朗日稳定性的近似SHSs的平稳矩方程。然后,我们提供了一种矩闭包方法来近似求解两种对称情况,即全连接网络和环网络,并通过仿真对比验证了算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory 工程技术-工程:电子与电气
CiteScore
5.70
自引率
20.00%
发文量
514
审稿时长
12 months
期刊介绍: The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.
×
引用
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学术官方微信