Using relaxational dynamics to reduce network congestion
We study the effects of relaxational dynamics on congestion pressure in scale free networks by analyzing the properties of the corresponding gradient networks (Z. Toroczkai, K. E. Bassler, Nature bf 428, 716 (2004)). Using the Family model (F. Family, J. Phys. A, bf 19, L441 (1986)) from surface-gro...
Main Authors: | , , , , , |
---|---|
Format: | Journal article |
Published: |
2008
|
_version_ | 1797050437169315840 |
---|---|
author | López, E Piontti, A La Rocca, C Torozckai, Z Braunstein, L Macri, P |
author_facet | López, E Piontti, A La Rocca, C Torozckai, Z Braunstein, L Macri, P |
author_sort | López, E |
collection | OXFORD |
description | We study the effects of relaxational dynamics on congestion pressure in scale free networks by analyzing the properties of the corresponding gradient networks (Z. Toroczkai, K. E. Bassler, Nature bf 428, 716 (2004)). Using the Family model (F. Family, J. Phys. A, bf 19, L441 (1986)) from surface-growth physics as single-step load-balancing dynamics, we show that the congestion pressure considerably drops on scale-free networks when compared with the same dynamics on random graphs. This is due to a structural transition of the corresponding gradient network clusters, which self-organize such as to reduce the congestion pressure. This reduction is enhanced when lowering the value of the connectivity exponent lambda towards 2. |
first_indexed | 2024-03-06T18:05:08Z |
format | Journal article |
id | oxford-uuid:012ffa78-0685-400a-9f13-ab191546d2b0 |
institution | University of Oxford |
last_indexed | 2024-03-06T18:05:08Z |
publishDate | 2008 |
record_format | dspace |
spelling | oxford-uuid:012ffa78-0685-400a-9f13-ab191546d2b02022-03-26T08:33:31ZUsing relaxational dynamics to reduce network congestionJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:012ffa78-0685-400a-9f13-ab191546d2b0Saïd Business School - Eureka2008López, EPiontti, ALa Rocca, CTorozckai, ZBraunstein, LMacri, PWe study the effects of relaxational dynamics on congestion pressure in scale free networks by analyzing the properties of the corresponding gradient networks (Z. Toroczkai, K. E. Bassler, Nature bf 428, 716 (2004)). Using the Family model (F. Family, J. Phys. A, bf 19, L441 (1986)) from surface-growth physics as single-step load-balancing dynamics, we show that the congestion pressure considerably drops on scale-free networks when compared with the same dynamics on random graphs. This is due to a structural transition of the corresponding gradient network clusters, which self-organize such as to reduce the congestion pressure. This reduction is enhanced when lowering the value of the connectivity exponent lambda towards 2. |
spellingShingle | López, E Piontti, A La Rocca, C Torozckai, Z Braunstein, L Macri, P Using relaxational dynamics to reduce network congestion |
title | Using relaxational dynamics to reduce network congestion |
title_full | Using relaxational dynamics to reduce network congestion |
title_fullStr | Using relaxational dynamics to reduce network congestion |
title_full_unstemmed | Using relaxational dynamics to reduce network congestion |
title_short | Using relaxational dynamics to reduce network congestion |
title_sort | using relaxational dynamics to reduce network congestion |
work_keys_str_mv | AT lopeze usingrelaxationaldynamicstoreducenetworkcongestion AT pionttia usingrelaxationaldynamicstoreducenetworkcongestion AT laroccac usingrelaxationaldynamicstoreducenetworkcongestion AT torozckaiz usingrelaxationaldynamicstoreducenetworkcongestion AT braunsteinl usingrelaxationaldynamicstoreducenetworkcongestion AT macrip usingrelaxationaldynamicstoreducenetworkcongestion |