Single and Group Agent Migration: Algorithms, Bounds, and Optimality Issues

DOI10.1109/TC.2013.166MaRDI QIDQ5267345zbMATH OpenOpenAlexFDO

Authors Nikos Tziritas, Thanasis Loukopoulos, Spyros Lalis, Cheng-Zhong Xu, Petros Lampsas, Samee Ullah Khan

Publication date 20 June 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2013.166

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• scientific article; zbMATH DE number 1538064
• Discrete self-organizing migration algorithm and \(p\)-location problems
• An optimal moving policy for a mobile agent in distributed networks
• An Algorithmic Theory of Mobile Agents
• Move-optimal gossiping among mobile agents
• Optimal Moves for Gossiping Among Mobile Agents
• scientific article; zbMATH DE number 1979327
• Multiagent Maximum Coverage Problems: The Tradeoff Between Anarchy and Stability

This page was built for publication: Single and Group Agent Migration: Algorithms, Bounds, and Optimality Issues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267345)