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...
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | Journal article |
| منشور في: |
2008
|