Cart (Loading....) | Create Account
Close category search window
 

Recursive Formulas for the Calculation of Point-to-Point Congestion

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Gaudreau, M. ; Bell Northern Res. Ltd., Ottawa, Ont., Canada

This paper presents recursive formulas for calculating the point-to-point congestion in a circuit-switched telecommunication network. This congestion value is derived from the individual blocking probabilities of each link, with or without regard to switch blocking. The approach is valid for alternate routing plans with a fixed sequence of route selection, using a link-by-link call setup procedure. The formulas presented here contrast with conventional procedures in that no probability linear graph is constructed. Rather, all paths connecting any two nodes are generated by a simple recursive relation.

Published in:

Communications, IEEE Transactions on  (Volume:28 ,  Issue: 3 )

Date of Publication:

Mar 1980

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.