Routing and dynamic resource assignment joint game: a non-cooperative model for QoS routing

Abstract

In this paper we present an innovative game theoretic non-cooperative model for the quality of service (QoS) routing in communication networks implementing a differentiated service model for the QoS support. The proposed model allows us to solve a joint problem of non-cooperative QoS routing and dynamic capacity allocation over a network of parallel links. This problem is solved by playing a Nash game taking place among players belonging to two categories: (i) the category of individual users, whose objectives are to ship their macroflows from the source node to the destination node, by suitably splitting them over the parallel links, and (ii) the category of capacity players, whose task is to partition and to assign to the classes of traffic upon which the macroflows are mapped, the dynamic portion of capacity over each link. One of the main innovative aspects of our model is that the allocation of the dynamic portion of capacity to each class of traffic over each link is realised during the actual operation of the network, i.e. in conjunction with the QoS routing. Extensive simulation results validate the proposed model, show some of its interesting properties and highlight the remarkable performance enhancements that it achieves with respect to the other results present in the literature

A distributed multi-path algorithm for wireless ad-hoc networks based on Wardrop routing

“…As with other algorithms aimed at managing ad hoc network resources (e.g., congestion control ( [13], [20]), load balancing ( [14], [23]), admission control ( [15], [22])), a wide research has been carried out so far and is available in *Research supported by the EU FP7-SPA SWIPE project, under Grant Agreement n° 312826.…”

An any‐sink energy‐efficient routing protocol in multi‐hop wireless sensor networks for planetary exploration

“…the nodes also act as relays for the traffic generated by other nodes), instead of a star topology (or a one-level clustered topology) as commonly happens in WSNs. Multi-hop protocols suitable for standard fixed networks [12][13][14][15] or mobile ad hoc networks (MANETs) [16][17][18][19][20][21] are, however, not optimized for WSNs, which are characterized by very strict constraints, especially regarding the scarcity of computational, bandwidth and energy resources. Moreover, differently from the protocols used in MANETs, WSNs normally consider static nodes.…”

Joint QoS Routing and Dynamic Capacity Dimensioning with Elastic Traffic: A Game Theoretical Perspective

“…Very few works have considered the joint problem of non-cooperative routing and capacity allocation in communications networks, especially in parallel links networks [6], [7]. However, these works present the following limitations: 1) in [6], [7], users have a fixed amount of traffic to ship between the source and the destination nodes, while, in our work, users are characterized by elastic traffic demands; the amount of traffic transmitted into the network depends therefore on the user perceived utility in sending his traffic and the disutility due to link congestion. 2) No service differentiation is envisaged in [7], and capacity allocation is performed off-line during the network design phase.…”