Public cloud platforms might start with homogeneous hardware; nevertheless, because of inevitable hardware upgrades, or adding more capacity, the initial homogeneous platform will gradually evolve into heterogeneous as time passes by. The consequent performance heterogeneity is of concern to cloud users. In this paper, we evaluate performance variations… (More)
We look at the scenario of having to route a continuous rate of traffic from a source node to a sink node in a network, where the objective is to maximize throughput. This is of interest, e.g., for providers of streaming content in communication networks. The overall path latency, which was relevant in other non-cooperative network routing games such as the… (More)
—We develop defenses from resource-exhausting Denial-of-Service attacks initiated by an attacker to a server. The attacker does not have a permanent identity but spoofs the IP addresses for other users. Generalizing the Defense-by-Offense approach we enable benign users to obtain low service time by re-submitting requests according to a game-theoretic… (More)
We consider a P2P-system with two kinds of users: " seeders " and " leechers ". Seeders provide data to others in a random manner with a known distribution. Leechers maximize amount of down-loaded data by trying to guess seeders' behavior. An equilibrium condition is derived for this system.
This paper considers the ranking problem of candidates for a certain position based on ballot papers filled by voters. We suggest a ranking procedure of alternatives using cooperative game theory methods. For this, it is necessary to construct a characteristic function via the filled ballot paper profile of voters. The Shapley value serves as the ranking… (More)
We consider equilibrium in multiuser multipath routing optimization problem in Wardrop model where selfish players distribute their TCP traffic in the shared multipath network. Minimization of the end-to-end traffic delay over all paths for each user is the criterion of optimality. We discover that in the game with latency function f e (δ) = 1−e −αeδ… (More)
In this paper we introduce and analyze a reputation scheme for common resource sharing problem from game theory perspective. The paper tries to answer the question: If each player is allocated resources proportional to its reputation, will the player's strategy be good for the system? The problem is formulated for a general form of reputation metric and… (More)