Virtual path bandwidth allocation in multiuser networks

Author

Lazar, Aurel A. ; Orda, Ariel ; Pendarakis, Dimitrios E.

Author_Institution

Dept. of Electr. Eng., Columbia Univ., New York, NY, USA

Volume

5

Issue

6

fYear

1997

fDate

12/1/1997 12:00:00 AM

Firstpage

861

Lastpage

871

Abstract

We consider a multiuser network that is shared by noncooperative users. Each user sets up virtual paths that optimize its own selfish performance measure. This measure accounts for the guaranteed call level quality of service, as well as for the cost incurred for reserving the resource. The interaction among the user strategies is formalized as a noncooperative game. We show that the game has a unique Nash equilibrium and that it possesses a certain fairness property. We investigate the dynamics of this game and prove convergence to the Nash equilibrium of both a Gauss-Seidel scheme and a Jacobi scheme. We extend our study to various general network topologies. Finally, the formal results and some extensions thereof are tested by emulating the schemes on an experimental network

Keywords

asynchronous transfer mode; broadband networks; channel capacity; convergence of numerical methods; game theory; iterative methods; network topology; telecommunication control; telecommunication networks; Gauss-Seidel scheme; Jacobi scheme; Nash equilibrium convergence; asynchronous transfer mode; broadband ATM-based networks; cost; cost functions optimization; experimental network; fairness property; game dynamics; guaranteed call level; multiuser networks; network topologies; noncooperative game; noncooperative users; performance measure; quality of service; resource reservation; user strategies interaction; virtual path bandwidth allocation; virtual path capacity allocation problem; Bandwidth; Channel allocation; Circuits; Convergence; Costs; Gaussian processes; Intelligent networks; Nash equilibrium; Quality of service; Resource management;

fLanguage

English

Journal_Title

Networking, IEEE/ACM Transactions on

Publisher

ieee

ISSN

1063-6692

Type

jour

DOI

10.1109/90.650145

Filename

650145