A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Sivaselvan, K.
- Stochastic Divination of Reckoning Enactment on Multi Class Queuing System
Authors
1 Department of Mathematics, Jeppiaar Engineering College, Chennai, IN
2 School of Advanced Science, Mathematics Division, VIT, University, Chennai, IN
Source
Indian Journal of Science and Technology, Vol 6, No 4 (2013), Pagination: 4294-4298Abstract
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 SeclusionReferences
- Mishra A (2002). Scalability in communication network, IEEE Networks, vol 16(4), 10-10
- Orda A and Sprinston A (2002). A scalable approach to the partition of QoS requirements in Unicast and Mulitcast, IEEE INFOCOM, vol 2, 685-694.
- Bettahar H, and Bouabdallah A (2002). A New approach for Delay-Constrained routing, Computer Communication, vol25(18) 1751-1764.
- Bhatti S N, and Crowcro J (2000). QoS-sensitive ows: Issues in IP packet handling, IEEE Internet Computing, vol4(4), 48-57.
- Ching W, Choi S et al. (2009). Optimal service capacities in a competitive multiple-server queueing environment, Complex Sciences, Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 4, 66-77.
- Hao F, and Zegura E W (2002). On scalable qos routing performance evaluation of topology aggregation, IEEE INFOCOM 2002, vol1(1), 147-156.
- Guérin R, and Orda A, (2002). Computing shortest paths for any number of hops, IEEE/ACM Transaction on Networking, vol 10(5), 613-620.
- Gupta P, and Stolyar A L (2006). Optimal throughput allocation in general random-access networks, Proceedings of 40th Annual Conference on Information Sciences and Systems, 1254- 1259.
- Halabi S, and McPherson D (2000). Internet Routing Architectures, 2nd edn, Cisco Press.
- Leonardi E, Mellia M et al. (2005). Joint optimal scheduling and routing for maximum network throughput, Proceeding IEEE INFOCOM 2005, 819-830.
- Lin X, and Shro N B (2004). An optimization based approach for quality of service routing in high-bandwidth networks, Presented at the IEEE INFOCOM, Hong Kong, China.
- Mao S, Panwar S S et al. (2006). On minimizing end-to-end delay with optimal trac partitioning, IEEE Transactions on Vehicular Technology, vol 55(2), 681-690.
- Montaser A (2002). Network Partitioning for QoS routing, Thesis, University of Bradford, UK.
- Orda and Sprintson A (2003). Prereckoning schemes for QoS routing, IEEE/ACM Transactions on Networking, vol 11(4), 578-591.
- Shen K, Zhang A et al. (2008). Operational analysis of processor Speed scaling, Proceeding SPAA ‘08 Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures.
- Deb S S and Woodward M E (2004). A new approach to scale quality of service routing algorithms, Globecom.
- Selvan K S and Vijayalakshmi C (2010). Algorithmic approach for the design of markovian queueing network with multiple closed chains, International Conference on TRENDZ information Sciences and Computing, Proceedings IEEE xplore, Sathyabama University TISC.
- Korkmaz T and Krunz M (2001). Multi-constrained optimal path selection, Proceedings of the IEEE INFOCOM, 834-843.
- Liu W, Lou W et al. (2005). An efficient quality of service routing algorithm for delay-sensitiveapplications, Computer Networks, vol 47(1), 87-104.
- Younis O, and Fahmy S (2003). Constraint-based routing in the internet: basic principles and recent research, IEEE Communication Society Surveys & Tutorials, vol 5(1), 42-56.
- Application of Markovian in Point to Point Networks with Multiple Controllers Using Nash Equilibrium
Authors
1 Mathematics Department, Jeppiaar Engineering College, Chennai, IN
2 Mathematics Department, Sathyabama University, Chennai, IN
Source
Networking and Communication Engineering, Vol 3, No 8 (2011), Pagination: 516-520Abstract
Congestion control is one of the most fundamental problems in computer networks and has been widely studied for decades. The flow control in computer communication networks is modeled by the application of a Markovian queuing system. The main aim of the flow control of Markovian queueing network with multiple controllers is (i) to maximize the average network throughput subject to a constraint on the average network delay (ii) under individual objectives where each users maximizes the corresponding average user throughput subject to the average user time delay constraint. The network optimization problems depend on the parameters of the network only through the conditional estimates of the total arrival and the total departure rates. Using linear programming problem, the network optimal flow control is showed to be a window mechanism. The optimal decentralized flow control under the user's performance in a multiple objective optimization problem is analyzed which leads to a game theoretic formulation with constraints. Structural constraints are obtained for the user optimization criterion under the results of separation theorem. The application of product form queueing is considered in the point to point packet switching network. Multiple routing chains are used to model the different routing behavior of packets. In point to point switching network, a packet can steps forward from one node to the next beside the route allocation. The performance measures which describe the packet transported by the network between the source and sink pairs. Nash equilibrium solution of this formulation is demonstrated to be a set of window-type mechanisms. The application of the Nash equilibrium concepts in decentralized flow control with throughput and time delay criteria which represents a behavior of a system are obtained.