Routing in circuit-switched networks: optimization, shadow prices and decentralization (Q3787260)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4050711
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Routing in circuit-switched networks: optimization, shadow prices and decentralization |
scientific article; zbMATH DE number 4050711 |
Statements
Routing in circuit-switched networks: optimization, shadow prices and decentralization (English)
0 references
1988
0 references
decentralized control
0 references
circuit-switched network
0 references
product-form steady state
0 references
performance measures
0 references
adaptive routing scheme
0 references
A circuit-switched network is considered where calls are admitted only if all links needed for the complete transmission of the call are available. Calls which find at least one of the links they will use not free are lost. The arriving calls form independent Poisson processes, the call holding times may be generally distributed. Although a product-form steady state for the system is known, for practical purposes one often needs approximations for evaluating performance measures either due to the complexity of the system or due to the need of describing the dynamic behaviour of the system. An approximation is used to attack questions of optimization for the network. Defining the rate of return from the network by the revenue obtained from accepted calls, it turns out that this rate of return has a local character in a way that changing the arrival rates for some route will change the network return only through changing the return from calls on neighbouring links. This local structure is used to introduce a decentralized adaptive routing scheme for the calls which in addition may be adapted to the actual load carried by the links.
0 references