Abstract
The proposed method of moments is an approximation scheme consisting of a simple iteration algorithm which converges to the network's point-to-point blocking probabilities. The following are the key steps. First, the total traffic stream (obtained by combining the individually offered overflow and Poissonian streams under the assumption of independence) offered to any trunk (channel) group in the network is approximated by a renewal process of a specific type.The total overflow from the trunk group is obtained using the generalized Erlang loss function. After suitably apportioning the lost load among the individually offered streams, each stream's blocking on the trunk group is computed. Finally, a point-to-point probability linear graph is constructed from the alternate routing scheme and the point-point-to-point blocking is computed assuming independent blocking in the links. Numerical results are presented for a simple three-node network with Poissonian point-to-point demand and comparison is made between the three-moment methods and simulation. The results indicate that the three-moment method is sufficiently accurate for engineering purposes.
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.
