An O(n) Telephony Gateway Selection Methodology for IP-PSTN Packet Routing
Chinmay Chakraborty, S. S. Pathak, Saswat Chakrabarti · 2009
A new algorithm named minimum blocking probability and cost (MBPC) is proposed to select a telephony gateway to complete a given ongoing call in order to achieve minimum blocking probability for packet routing from Internet Protocol to PSTN networks. This algorithm is simpler than any other existing one. The model is validated through simulation. In fact, this work can be applied to getting end-to-end better performance while packet routing decision is the only basis of getting periodic updates from gateways. The end-to-end delay for completion of a call is also measured. The call blocking probability over telephony gateway is easily computable. This in turn, help a location server (LS) predict the best path on the basis of least utilized and/or maximum weight.