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.
|Number of pages||8|
|Journal||Lecture Notes in Computer Science|
|Publication status||Published - 2004|