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

類似資料