Indian Journal of Science and Technology

Abstract

Stochastic systems play a prominent role in computer graphics, because of their success in modeling a variety of complex and natural phenomena. 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. The main aim of seclusion is minimizing the reckoning 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 which are effective for large hoard and promote packet switched computer networks. The new concept of stochastic seclusion method is introduced to resolve the scalability in QoS routing algorithm. A queue discipline in multiclass network is analyzed. An optimization algorithm is designed for seclusion strategy using stochastic technique in which the routing functions in the network are being increased. Numerical calculations and graphical representation shows that the proposed method improves the performance measure in terms of reduction in reckoning effort.
Keywords: Routing, Scalability, Reckoning Effort, Large Networks, Quality of Service, Network Seclusion