Abstract
Unlike certain service protection methods for mixed traffic streams, such as the class-limitation method, the trunk reservation scheme cannot be based on a product form property of a stationary probability distribution vector. Rather, the analysis of the trunk reservation scheme requires solving, by purely numerical methods, a set of balance equations, Ax = 0, often of very high order. Since the coefficient matrix is typically sparse, it is natural to apply iterative methods to this task. Many such methods have been incorporated in program package NSPCG, developed at the Center for Numerical Analysis at the University of Texas at Austin. In this paper we report our experience in applying the NSPCG package to a typical system arising from the trunk reservation scheme.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
