Using program package NSPCG to analyze the trunk reservation service protection method (Q1317088): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q591449
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Ilya S. Molchanov / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NSPCG / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CRAIG / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LSQR / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0305-0548(94)90060-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072203368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking Probabilities for Trunk Reservation Policy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3923308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>N</i>/<i>G</i>/1 queue and its detailed analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3943082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical solution of sparse singular systems of equations arising from ergodic markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Methods for Queuing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3909906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Taxonomy for Conjugate Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized conjugate directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems / rank
 
Normal rank

Latest revision as of 13:36, 22 May 2024

scientific article
Language Label Description Also known as
English
Using program package NSPCG to analyze the trunk reservation service protection method
scientific article

    Statements

    Using program package NSPCG to analyze the trunk reservation service protection method (English)
    0 references
    0 references
    0 references
    29 August 1994
    0 references
    The purpose of this paper is to illustrate how program package NSPCG, developed at the Center for Numerical Analysis at the University of Texas at Austin, can be applied to solve the sparse, singular systems that arise in the analysis of continuous-time Markov chains. The technical system chosen as a case study is an integrated digital network of ISDN type. The trunk reservation scheme is used to provide service protection for one or more mixed traffic streams. For this strategy, the authors construct a Markov model of the system and solve the associated singular system of equations using a variety of iterative methods from the NSPCG package. Many numerical results are given and compared with respect to computing time and rate of convergence.
    0 references
    0 references
    0 references
    0 references
    0 references
    Markov chains
    0 references
    digital network
    0 references
    numerical results
    0 references
    rate of convergence
    0 references
    0 references
    0 references
    0 references
    0 references