- Abstract:
-
We consider a random sequence of calls between nodes in a complete network with link capacities. Each call first tries the direct link. If that link is saturated, then the 'First-fit dynamic alternative routing algorithm' sequentially selects up to d random two-link alternative routes, and assigns the call to the first route with spare capacity on each link, if there is such a route. The 'Balanced dynamic alternative routing algorithm' simultaneously selects d random two-link alternative rout...
Expand abstract - Publication status:
- Published
- Journal:
- PROBABILITY THEORY AND RELATED FIELDS
- Volume:
- 125
- Issue:
- 4
- Pages:
- 457-482
- Publication date:
- 2003-04-05
- DOI:
- EISSN:
-
1432-2064
- ISSN:
-
0178-8051
- URN:
-
uuid:a3d8411e-9162-4671-b517-60dfbac9eb32
- Source identifiers:
-
102299
- Local pid:
- pubs:102299
- Language:
- English
- Copyright date:
- 2003
Journal article
On-line routing of random calls in networks
Actions
Authors
Bibliographic Details
Item Description
Terms of use
Metrics
Altmetrics
Dimensions
If you are the owner of this record, you can report an update to it here: Report update to this record