scispace - formally typeset
Open AccessProceedings Article

Joint QoS Routing and Dynamic Capacity Dimensioning with Elastic Traffic

TLDR
In this article, Jocelyne Elias, assegnista di Ricerca presso il Dipartimento di Ingegneria dell'Informazione e Metodi Matematici dal 1 Febbraio 2010 al 31 Agosto 2010.
Abstract
ISBN: 978-1-4244-6402-9 NOTE: La D. ssa Jocelyne Elias e stata assegnista di Ricerca presso il Dipartimento di Ingegneria dell'Informazione e Metodi Matematici dal 1 Febbraio 2010 al 31 Agosto 2010. L'articolo in questione e stato pubblicato il 1 Luglio 2010. Si veda il sito relativo: http://ieeexplore.ieee.org/search/freesrchabstract.jsp?tp=&arnumber=5502598&queryText%3DJoint+QoS+Routing+and+Dynamic+Capacity+Dimensioning+with+Elastic+Traffic%26openedRefinements%3D*%26searchField%3DSearch+All Dunque e stato indicato un grado di proprieta del 100%, essendo 2 autori su 2 appartenenti al nostro Ateneo.

read more

Citations
More filters
Journal ArticleDOI

Pareto-optimal Nash equilibrium in capacity allocation game for self-managed networks

TL;DR: A capacity allocation game which models the problem of maximizing network utility from the perspective of distributed noncooperative agents and the properties of the introduced game related to the Price of Anarchy and Price of Stability are discussed.
Journal ArticleDOI

Multi-leader multi-follower Stackelberg model for cognitive radio spectrum sharing scheme

TL;DR: A new fair-efficient spectrum sharing scheme is proposed for cognitive radio networks based on the multiple-leader multiple-follower Stackelberg game model, which has excellent network performance, while other schemes cannot offer such an attractive performance balance.
Journal ArticleDOI

A game-theoretic multipath routing for video-streaming services over Mobile Ad Hoc Networks

TL;DR: This article introduces a proposal called g-MMDSR (game theoretic-Multipath Multimedia Dynamic Source Routing), a cross-layer multipath routing protocol which includes a game theoretic approach to achieve a dynamic selection of the forwarding paths.
Book ChapterDOI

Game-Based Control Mechanisms for Cognitive Radio Networks

TL;DR: Under dynamically changing network environments, the TMGBS scheme formulates the bandwidth sharing problem as a two-way matching game model and modified game theory is adopted to reach a near Pareto optimal solution while avoiding bandwidth inefficiency.
Dissertation

Performance Evaluation of a Game Theoretical routing protocol over Mobile Ad Hoc Networks

TL;DR: The result of simulation have demonstrated the benefit of using the game theory technique in different situation over none game theory and also thebenefit of variable P value over fixed P value in game theory.
References
More filters
Book

Dynamic Noncooperative Game Theory

TL;DR: In this paper, the authors present a general formulation of non-cooperative finite games: N-Person nonzero-sum games, Pursuit-Evasion games, and Stackelberg Equilibria of infinite dynamic games.
Journal ArticleDOI

Competitive routing in multiuser communication networks

TL;DR: For a two-node multiple links system, uniqueness of the Nash equilibrium is proven under reasonable convexity conditions, and it is shown that this Nash equilibrium point possesses interesting monotonicity properties.
Journal ArticleDOI

Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games

TL;DR: In Pang and Fukushima, a sequential penalty approach was presented for a quasi-variational inequality (QVI) with particular application to the generalized Nash game, but numerical results due to an inverted sign in the penalty term in the example and some missing terms in the derivatives of the firms’ Lagrangian functions are incorrect.
Journal ArticleDOI

Achieving network optima using Stackelberg routing strategies

TL;DR: The existence of maximally efficient strategies for the manager, i.e., strategies that drive the system into the global network optimum, is investigated and it is shown that they are met in many cases of practical interest.
Journal ArticleDOI

Architecting noncooperative networks

TL;DR: It is shown that, for systems of parallel links, such paradoxes cannot occur and the optimal solution coincides with the solution in the single-user case, and some extensions to general network topologies are derived.