Loss network
In queueing theory, a loss network is a stochastic model of a telephony network in which calls are routed around a network between nodes. The links between nodes have finite capacity and thus some calls arriving may find no route available to their destination. These calls are lost from the network, hence the name loss networks. The loss network was first studied by Erlang for a single telephone link. Frank Kelly was awarded the Frederick W. Lanchester Prize for his 1991 paper Loss Networks where he demonstrated the behaviour of loss networks can exhibit hysteresis.
known for
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Loss network
In queueing theory, a loss network is a stochastic model of a telephony network in which calls are routed around a network between nodes. The links between nodes have finite capacity and thus some calls arriving may find no route available to their destination. These calls are lost from the network, hence the name loss networks. The loss network was first studied by Erlang for a single telephone link. Frank Kelly was awarded the Frederick W. Lanchester Prize for his 1991 paper Loss Networks where he demonstrated the behaviour of loss networks can exhibit hysteresis.
has abstract
In queueing theory, a loss net ...... tworks can exhibit hysteresis.
@en
Wikipage page ID
38,246,589
page length (characters) of wiki page
Wikipage revision ID
993,301,342
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
In queueing theory, a loss net ...... tworks can exhibit hysteresis.
@en
label
Loss network
@en