DocumentCode
2336494
Title
A Theoretical Framework for Hierarchical Routing Games
Author
Kamble, Vijay ; Altman, Eitan ; El-Azouzi, Rachid ; Sharma, Vinod
Author_Institution
Dept. of Ind. Eng. & Manage., IIT Kharagpur, Kharagpur, India
fYear
2010
fDate
14-19 March 2010
Firstpage
1
Lastpage
5
Abstract
Most theoretical research on routing games in telecommunication networks has so far dealt with reciprocal congestion effects between routed entities. Yet in networks that support differentiation between flows, the congestion experienced by a packet depends on its priority level. Another differentiation is made by compressing the packets in the low priority flow while leaving the high priority flow intact. In this paper we study such kind of routing scenarios for the case of non-atomic users and we establish conditions for the existence and uniqueness of equilibrium.
Keywords
game theory; telecommunication network routing; hierarchical routing games; nonatomic users; priority flow; reciprocal congestion effects; telecommunication networks; Ad hoc networks; Communications Society; Delay; Engineering management; Game theory; Industrial engineering; Routing; Telecommunication congestion control; Telecommunication network management; Telecommunication traffic;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM, 2010 Proceedings IEEE
Conference_Location
San Diego, CA
ISSN
0743-166X
Print_ISBN
978-1-4244-5836-3
Type
conf
DOI
10.1109/INFCOM.2010.5462222
Filename
5462222
Link To Document