Network-decentralized robust congestion control with node traffic splitting
(2014) 2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014 p.2901-2906- 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 network-decentralized 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 network-decentralized 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 network-decentralized 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
- organization
- publishing date
- 2014-12
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- IEEE 53rd Annual Conference on Decision and Control (CDC 2014)
- article number
- 7039835
- pages
- 6 pages
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- 2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014
- conference location
- Los Angeles, United States
- conference dates
- 2014-12-15 - 2014-12-17
- external identifiers
-
- scopus:84991872515
- ISBN
- 9781467360890
- DOI
- 10.1109/CDC.2014.7039835
- language
- English
- LU publication?
- no
- id
- 25204bb4-dc51-4613-b4e2-bc2005378f3a
- date added to LUP
- 2016-07-06 15:27:11
- date last changed
- 2022-05-02 04:21:03
@inproceedings{25204bb4-dc51-4613-b4e2-bc2005378f3a,
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 network-decentralized 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 network-decentralized 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 = {{2901--2906}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
title = {{Network-decentralized robust congestion control with node traffic splitting}},
url = {{http://dx.doi.org/10.1109/CDC.2014.7039835}},
doi = {{10.1109/CDC.2014.7039835}},
year = {{2014}},
}