Application of stochastic model on routing technique in multi class queueing network

Abstract

In communication networks, the network size is growing hasty and the computation effort to finds a path between the source -destination pairs is increased massively. Multiple paths may exists between the source-destination nodes which direct that traffic load variations, overhead, response time take place. Routing plays a vital role on the performance and functionality of computer networks. Routing networks means identifying a path in the network that optimizes a certain criterion which is called as Quality of Service (QoS) routing and it is failure in the environment of large scale networks The storage and updating cost of routing procedure is prohibitive as the number of nodes in the network gets large. Stochastic techniques have assumed a prominent role in computer graphics, because of their success in modeling a variety of complex and natural phenomena. The usefulness of a particular stochastic model depends on both its computational advantages and on the extent to which can be adjusted to describe different phenomena. Network isolation is a key solution for improving the scalability problem in large networks. The main aim of isolation is minimizing the computation effort by maximizing the probability of having a path between source-destination pairs in the network. This paper deals with the specification and analysis of routing procedures that are effective for large hoard and promote packet switched computer networks. The new concept of stochastic isolation method introduced to resolve the scalability in Quality of Service routing algorithm. Graphical representation shows that how the new method improves the performance measure in terms of reduction in computational effort. © 2012 Springer-Verlag GmbH Berlin Heidelberg.