One-dimensional circuit-switched networks (Q580828): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1214/aop/1176992089 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016454220 / rank
 
Normal rank

Revision as of 18:10, 19 March 2024

scientific article
Language Label Description Also known as
English
One-dimensional circuit-switched networks
scientific article

    Statements

    One-dimensional circuit-switched networks (English)
    0 references
    0 references
    1987
    0 references
    In a one-dimensional (linear) circuit-switched network arriving calls request for an interconnection between two nodes of the network. If such a ``route'' which consists of a sequence of successive circuits is not available the call is lost. (The constraint on the availability originates from the finite capacity condition for the links between two neighboured nodes.) Calls for different routes arrive in independent Poisson processes. The stochastic process describing the number of occupied routes for each type of route has a well-known ``product form'' steady-state distribution. A much more complicated problem is to describe the process which records the joint number of occupied circuits on the links of the network. The author proves that under some restrictions on the arrival intensities the steady state of that process is an inhomogeneous Markov chain which additionally can be identified to be a quasistationary distribution of a suitable homogeneous Markov chain. Under the additional restriction that each link comprises one circuit the steady-state distribution can be reduced in an analogous way to distributions obtained from alternating renewal processes.
    0 references
    0 references
    circuit-switched network
    0 references
    steady-state distribution
    0 references
    quasistationary distribution
    0 references
    alternating renewal processes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references