Balanced routing of random calls
We consider an online routing problem in continuous time, where calls have Poisson arrivals and exponential durations. The first-fit dynamic alternative routing algorithm sequentially selects up to $d$ random two-link routes between the two endpoints of a call, via an intermediate node, and assigns...
Главные авторы: | Luczak, M, McDiarmid, C |
---|---|
Формат: | Journal article |
Опубликовано: |
2008
|
Схожие документы
-
On-line routing of random calls in networks
по: Luczak, M, и др.
Опубликовано: (2003) -
Bisecting sparse random graphs.
по: Luczak, M, и др.
Опубликовано: (2001) -
On the maximum queue length in the supermarket model
по: Luczak, M, и др.
Опубликовано: (2006) -
On the power of two choices: Balls and bins in continuous time
по: Luczak, M, и др.
Опубликовано: (2005) -
Asymptotic distributions and chaos for the supermarket model
по: Luczak, M, и др.
Опубликовано: (2007)