Evolutionary game of N competing AIMD connections

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper deals with modeling of network’s dynamic using evolutionary games approach. Today there are many different protocols for data transmission through Internet, providing users with better or worse service. The process of choosing better protocol could be considered as a dynamic game with players (users), trying to maximize their payoffs (e.g. throughput). In this work we presented the model of network’s dynamic using differential equations with discontinuous right side and proved existence and uniqueness of solution, formulated payoff matrix for a network game and found conditions of equilibrium existence depending of loss sensitivity parameter. The results are illustrated by simulations.

Cite

CITATION STYLE

APA

Ignatenko, O., & Synetskyi, O. (2014). Evolutionary game of N competing AIMD connections. Communications in Computer and Information Science, 469, 325–342. https://doi.org/10.1007/978-3-319-13206-8_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free