Nonhomogeneous Place-dependent Markov Chains, Unsynchronised AIMD, and Optimisation

Author:

Wirth Fabian R.1ORCID,Stüdli Sonja2,Yu Jia Yuan3,Corless Martin4,Shorten Robert5

Affiliation:

1. University of Passau, Germany

2. University of Newcastle, Australia

3. Concordia University, Quebec, Canada

4. Purdue University, Newcastle, West Lafayette, IN, USA

5. Imperial College London and University College Dublin, Dublin, Ireland

Abstract

A stochastic algorithm is presented for a class of optimisation problems that arise when a group of agents compete to share a single constrained resource in an optimal manner. The approach uses intermittent single-bit feedback, which indicates a constraint violation and does not require inter-agent communication. The algorithm is based on a positive matrix model of AIMD, which is extended to the nonhomogeneous Markovian case. The key feature is the assignment of back-off probabilities to the individual agents as a function of the past average access to the resource. This leads to a nonhomogeneous Markov chain in an extended state space, and we show almost sure convergence of the average access to the social optimum.

Funder

Seventh Framework Programme

Science Foundation Ireland

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference60 articles.

1. A Stochastic Approach to “Dynamic-Demand” Refrigerator Control

2. M. F. Barnsley S. G. Demko J. H. Elton and J. S. Geronimo. 1988. Invariant measures for Markov processes arising from iterated function systems with place-dependent probabilities. Annales de l'Institut Henri Poincaré

3. (B) Probabilités et Statistiques 24 3 (1988) 367--394. M. F. Barnsley S. G. Demko J. H. Elton and J. S. Geronimo. 1988. Invariant measures for Markov processes arising from iterated function systems with place-dependent probabilities. Annales de l'Institut Henri Poincaré

4. (B) Probabilités et Statistiques 24 3 (1988) 367--394.

5. Emulating AQM from end hosts

Cited by 9 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Consensus With a Linear Constraint;IEEE Transactions on Automatic Control;2024-01

2. Communication-Efficient Allocation of Multiple Indivisible Resources in a Federated Multi-Agent System;2023 62nd IEEE Conference on Decision and Control (CDC);2023-12-13

3. On unique ergodicity of coupled AIMD flows;International Journal of Control;2023-10-02

4. Communication-efficient Preference-based Federated Multi-resource Allocation;2023 59th Annual Allerton Conference on Communication, Control, and Computing (Allerton);2023-09-26

5. Existence of a Unique Invariant Measure and Ergodic Property in AIMD-based Multi-resource Allocation;2023 American Control Conference (ACC);2023-05-31

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3