Networkdecentralized robust congestion control with node traffic splitting
(2014) 2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014 In IEEE 53rd Annual Conference on Decision and Control (CDC 2014) p.29012906 Abstract
We consider a traffic control problem defined on a network graph, whose nodes represent buffers and whose arcs represent flow channels. We consider network models with a peculiar aspect: each element of the flow arriving at each node must be redirected towards a precise other node of the network, hence each buffer is naturally split in several queues, characterized according to statistics about the flow splitting at the nodes. Precisely, each node is modelled as a Markov chain, in which some states are specifically associated with the arcs leaving the node: state j represents the amount of traffic waiting to be directed through arc j. We show that such a network can be stabilized by means of a networkdecentralized control, in which the... (More)
We consider a traffic control problem defined on a network graph, whose nodes represent buffers and whose arcs represent flow channels. We consider network models with a peculiar aspect: each element of the flow arriving at each node must be redirected towards a precise other node of the network, hence each buffer is naturally split in several queues, characterized according to statistics about the flow splitting at the nodes. Precisely, each node is modelled as a Markov chain, in which some states are specifically associated with the arcs leaving the node: state j represents the amount of traffic waiting to be directed through arc j. We show that such a network can be stabilized by means of a networkdecentralized control, in which the flow through each arc is controlled by an agent which only knows the congestion situation at the nodes it connects. The main result is that the proposed networkdecentralized strategy is robust (namely it assures stability under all possible values of the Markov chain parameters) provided that zero is a simple eigenvalue for all the Markov chains, which includes the irreducible case.
(Less)
 author
 Blanchini, Franco; Giordano, Giulia ^{LU} and Montessoro, Pier Luca
 publishing date
 201412
 type
 Chapter in Book/Report/Conference proceeding
 publication status
 published
 subject
 in
 IEEE 53rd Annual Conference on Decision and Control (CDC 2014)
 pages
 6 pages
 publisher
 Institute of Electrical and Electronics Engineers Inc.
 conference name
 2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014
 external identifiers

 scopus:84931826364
 ISBN
 9781467360890
 DOI
 10.1109/CDC.2014.7039835
 language
 English
 LU publication?
 no
 id
 25204bb4dc514613b4e2bc2005378f3a
 date added to LUP
 20160706 15:27:11
 date last changed
 20161129 11:31:27
@inproceedings{25204bb4dc514613b4e2bc2005378f3a, abstract = {<p>We consider a traffic control problem defined on a network graph, whose nodes represent buffers and whose arcs represent flow channels. We consider network models with a peculiar aspect: each element of the flow arriving at each node must be redirected towards a precise other node of the network, hence each buffer is naturally split in several queues, characterized according to statistics about the flow splitting at the nodes. Precisely, each node is modelled as a Markov chain, in which some states are specifically associated with the arcs leaving the node: state j represents the amount of traffic waiting to be directed through arc j. We show that such a network can be stabilized by means of a networkdecentralized control, in which the flow through each arc is controlled by an agent which only knows the congestion situation at the nodes it connects. The main result is that the proposed networkdecentralized strategy is robust (namely it assures stability under all possible values of the Markov chain parameters) provided that zero is a simple eigenvalue for all the Markov chains, which includes the irreducible case.</p>}, author = {Blanchini, Franco and Giordano, Giulia and Montessoro, Pier Luca}, booktitle = {IEEE 53rd Annual Conference on Decision and Control (CDC 2014) }, isbn = {9781467360890}, language = {eng}, pages = {29012906}, publisher = {Institute of Electrical and Electronics Engineers Inc.}, title = {Networkdecentralized robust congestion control with node traffic splitting}, url = {http://dx.doi.org/10.1109/CDC.2014.7039835}, year = {2014}, }