Local search with congestion in complex communication networks

Alex Arenas; Leon Danon; Albert Díaz-Guilera; Roger Guimerà

Local search with congestion in complex communication networks

Alex Arenas^*, Leon Danon, Albert Díaz-Guilera, Roger Guimerà

^*Corresponding author for this work

Bristol Medical School (PHS)

Research output: Contribution to journal › Article (Academic Journal) › peer-review

8 Citations (Scopus)

Abstract

We present a formalism that is able to cope with search and congestion simultaneously. This formalism avoids the problem of simulating the dynamics of the search-communication process which turns out to be impracticable, specially close to the congestion point where search costs (time) diverge.

Original language	English
Pages (from-to)	1078-1085
Number of pages	8
Journal	Lecture Notes in Computer Science
Volume	3038
Publication status	Published - 2004

Handle.net

Persistent link

Cite this

@article{9d297fae94584129947222e870926fd4,

title = "Local search with congestion in complex communication networks",

abstract = "We present a formalism that is able to cope with search and congestion simultaneously. This formalism avoids the problem of simulating the dynamics of the search-communication process which turns out to be impracticable, specially close to the congestion point where search costs (time) diverge.",

author = "Alex Arenas and Leon Danon and Albert D{\'i}az-Guilera and Roger Guimer{\`a}",

year = "2004",

language = "English",

volume = "3038",

pages = "1078--1085",

journal = "Lecture Notes in Computer Science ",

issn = "0302-9743",

publisher = "Springer Berlin Heidelberg",

}

TY - JOUR

T1 - Local search with congestion in complex communication networks

AU - Arenas, Alex

AU - Danon, Leon

AU - Díaz-Guilera, Albert

AU - Guimerà, Roger

PY - 2004

Y1 - 2004

N2 - We present a formalism that is able to cope with search and congestion simultaneously. This formalism avoids the problem of simulating the dynamics of the search-communication process which turns out to be impracticable, specially close to the congestion point where search costs (time) diverge.

AB - We present a formalism that is able to cope with search and congestion simultaneously. This formalism avoids the problem of simulating the dynamics of the search-communication process which turns out to be impracticable, specially close to the congestion point where search costs (time) diverge.

UR - http://www.scopus.com/inward/record.url?scp=33644777108&partnerID=8YFLogxK

M3 - Article (Academic Journal)

AN - SCOPUS:33644777108

VL - 3038

SP - 1078

EP - 1085

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -

Local search with congestion in complex communication networks

Abstract

Handle.net

Other files and links

Fingerprint

Cite this