eISSN: 3087-4289 editor@aimjournals.com
All Journals
Submit your article

International Journal of Modern Computer Science and IT Innovations

Open Access Peer Review International
Open Access

An Adaptive AI Multi-Agent Model for Optimizing Real-Time Data Streaming and System Resilience

DOI https://doi.org/10.55640/ijmcsit-v03i08-06
PDF
Chinedu Okafor 1 , Amara Eze 1 ,
4 Department of Artificial Intelligence, Lagos Institute of Computing Technology Nigeria
4 Department of Computer Science and AI, Abuja Institute of Digital Engineering Nigeria

Abstract

Real-time data-streaming environments increasingly require adaptive decision mechanisms capable of coordinating heterogeneous computational resources while maintaining throughput, resilience, and service continuity under dynamic workloads. This paper proposes a conceptual adaptive artificial intelligence (AI) multi-agent model for optimizing real-time data streaming and system resilience. The proposed model combines autonomous agents for stream monitoring, workload allocation, resource coordination, anomaly response, and resilience management within a decentralized decision architecture. Its theoretical foundation is informed by research on distributed allocation, fairness, efficiency, optimization, and computational complexity in multi-agent decision environments. In particular, studies of fair and efficient allocation provide useful principles for balancing competing resource demands, while work on Nash social welfare and allocation algorithms demonstrates the value of optimization objectives that consider collective system utility. The proposed architecture extends these principles from indivisible-resource allocation toward dynamic streaming-resource management. The methodology defines agent roles, state representation, utility functions, adaptive allocation policies, coordination mechanisms, resilience procedures, and evaluation criteria. Analytical findings indicate that adaptive multi-agent coordination can improve resource utilization, reduce the impact of localized failures, and support scalable stream processing when compared conceptually with rigid centralized allocation. The model is particularly relevant to event-streaming environments in which workload intensity, resource availability, and service conditions change continuously. The paper further identifies limitations concerning coordination overhead, convergence, observability, and the absence of empirical benchmarking in the present conceptual study. The framework therefore provides a research foundation for implementing resilient AI-driven streaming systems and for future experimental validation.

Keywords

Adaptive AI, Multi-Agent Systems, Real-Time Data Streaming, Resilience

References

Amanatidis, G., Aziz, H., Birmpas, G., Filos-Ratsikas, A., Li, B., Moulin, H., Voudouris, A. A., & Wu, X. (2023). Fair division of indivisible goods: Recent progress and open questions. Artif. Intell.,322, 103965.
Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Hollender, A., & Voudouris, A. A. (2020).Maximum Nash welfare and other stories about EFX. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, (IJCAI), pp. 24–30.
Aziz, H., Lindsay, J., Ritossa, A., & Suzuki, M. (2022). Fair allocation of two types ofchores..
Barman, S., Krishnamurthy, S. K., & Vaish, R. (2018a). Finding fair and efficient allocations. In Proceedings of the 19th ACM Conference on Economics and Computation (EC),pp. 557–574.
Barman, S., Krishnamurthy, S. K., & Vaish, R. (2018b). Greedy algorithms for maxi-mizing Nash social welfare. In Proceedings of the 17th International Conference on Autonomous Agents and Multi Agent Systems (AAMAS), p. 7–13.
Bliem, B., Bredereck, R., & Niedermeier, R. (2016). Complexity of efficient and envy-freeresource allocation: Few agents, resources, or utility levels. InProceedings of the 25thInternational Joint Conference on Artificial Intelligence (IJCAI), p. 102–108.
Brams, S., & Taylor, A. (1996).Fair Division: From Cake-Cutting to Dispute Resolution.Cambridge University Press.
Brˆanzei, S., & Sandomirskiy, F. (2019). Algorithms for competitive division of chores.CoRR,abs/1907.01766.
Bredereck, R., Kaczmarczyk, A., Knop, D., & Niedermeier, R. (2019). High-multiplicityfair allocation: Lenstra empowered by n-fold integer programming. InProceedings ofthe 2019 ACM Conference on Economics and Computation, p. 505–523.
Budish, E. (2011). The combinatorial assignment problem: Approximate competitive equi-librium from equal incomes.Journal of Political Economy,119(6), 1061 – 1103.
Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A. D., Shah, N., & Wang, J. (2016).The unreasonable fairness of maximum Nash welfare. InProceedings of the 17th ACMConference on Economics and Computation (EC), p. 305–322.
Chakraborty, M., Igarashi, A., Suksompong, W., & Zick, Y. (2020). Weighted envy-freenessin indivisible item allocation. InProceedings of the 19th International Conference onAutonomous Agents and MultiAgent Systems (AAMAS), p. 231–239.
Cole, R., & Gkatzelis, V. (2015). Approximating the Nash social welfare with indivisibleitems. InProceedings of the Forty-Seventh Annual ACM Symposium on Theory ofComputing (STOC), p. 371–380.
Darmann, A., & Schauer, J. (2014). Maximizing Nash product social welfare in allocatingindivisible goods.SSRN Electronic Journal,247.
de Keijzer, B., Bouveret, S., Klos, T., & Zhang, Y. (2009). On the complexity of efficiencyand envy-freeness in fair division of indivisible goods with additive preferences. InRossi, F., & Tsoukias, A. (Eds.),Algorithmic Decision Theory, pp. 98–110.
R. Reddy, P. Udayaraju, K. K. Goyal, S. C. R. Vudem, R. Sayana and V. Gummadi, "Creating an AI-based Multi-Agent Model for Optimized Data Streaming with Improved Resiliency and Scalability for Event Streaming," 2026 6th International Conference on Image Processing and Capsule Networks (ICIPCN), Dhulikhel, Nepal, 2026, pp. 1372-1379, doi: 10.1109/ICIPCN67432.2026.11438445.
K. Ramamurthy, N. Bellamkonda and N. Amanmadov, "ScalePulse: Combinatorial Llm Framework for Scalability Constraint," SoutheastCon 2026, Huntsville, AL, USA, 2026, pp. 1-6, doi: 10.1109/SoutheastCon63549.2026.11476075
Philip, P. G. (2024). Artificial Intelligence-Driven Project Risk Prediction Models: Enhancing Decision-Making Accuracy in Large-Scale Infrastructure Projects . American Journal of Technology, 3(1), 52–69. https://doi.org/10.58425/ajt.v3i1.571
SinghJatav, D., Amin, M. M., Kodela, S., Nayan, V., Wannous, M., & Khalifa, G. S. (2025, November). Hybrid Reinforcement and Deep Learning Model for Payment Delay Optimization in Supply Chain Finance. In 2025 10th International Conference on Information Technology Trends (ITT) (pp. 170-175). IEEE.

Most read articles by the same author(s)

<< < 1 2 3 4 5 6 7 8 9 10 > >> 

Similar Articles

1-10 of 103

You may also start an advanced similarity search for this article.