Open Access Open Access  Restricted Access Subscription or Fee Access

An Optimal Probabilistic Traffic Engineering Scheme for Heterogeneous Networks

Chinmay Chakraborty, S.S. Pathak, Rajarshi Roy, Saswat Chakrabarti

Abstract


A probabilistic traffic engineering scheme in terms of packet routing procedure for two gateway models with N trunks is proposed and analyzed for heterogeneous network. For trafficconsidered as Poisson process of arrival rateλ for SIP based packet switched network to the circuit-switched public switched telephone networks (PSTN). Analysis reporting is presented for the end-to-end performance. The theoretical results are supplemented by numerical work. The main objective is that to maximize the quality of services. An efficient routing scheme for explicitly solving the problem is presented and specific examples are analyzed. It is shown by analysis and simulation that weighted symmetric probabilistic routing optimizes a cost function which is a linear combination of loss and delay. As a consequence of this optimal probabilistic routing the good QoS performance is achieved.


Keywords


Session Initiation Protocol, PSTN, Packet Routing, Weighted Cost Function

Full Text:

PDF

References


David M. Rose, Yurii M. Suhov, Vvedenskaya b, “An optimal probabilistic routing policy for a large packet-switched network”, Journal of Comm. Statist. Stochastic Models, 14(5), 1998, pp. 1027-1050.

Christos G. Cassandras, Michelle Hruby Kallmes and Don Towsley,“Optimal routing and flow control in networks with real time traffic”IEEE INFOCOM, Apr 1989, pp. 784-791 vol.3, 23-27.

Yu Z., Wang H., Li R. and Zeng Y., "Call routing with weighted random selection and endpoint admission control for VOIP traffic", International Conf. on Comm. & Networks (CHINACOM), Beijing, China, Oct. 25-

, 2006.

D. Bertsekas and R. Gallager, Data Networks, 2nd ed. Englewood Cliffs,

NJ: Prentice-Hall, 1992.

Maple getting started guide, Available: http://www.maplesoft.com.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.