International Journal of Advanced Networking and Applications

Diwakar Shukla ¹, Sharad Gangele ², Rahul Singhai ³, Kapil Verma ⁴

Affiliations
1 Department of Mathematics and Statistics, Sagar University, Sagar-470003, M. P., IN
2 Department of Computer Science, M.P. Bhoj (Open) University, Kolar Road, Bhopal, M. P., IN
3 International Institute of Professional Studies, Devi Ahilya University, Indore, (M.P.), IN
4 Department of Computer Science, M.P. Bhoj (Open) University, Kolar Road, Bhopal, M.P., IN

Abstract

There are many browsers available in the market but only a few are liked and used by many. Every browser has a predefined level of popularity in the market. This paper considers the setup of only two browsers installed in a computer system and a user prefers to any one of them and if fails, switches to the other one. Elasticties of browser sharing are derived, index formation and graphical study are performed to compare the simulated output.

Keywords

Markov Chains (MC), Transition Probability Matrix (TPM), Quality of Service (QOS), Browser Failure (BF).

Full Text

   

Diwakar Shukla ¹, Rahul Singhai ²

Affiliations
1 Department of Mathematics and Statistics, Sagar University, Sagar-470003, M.P., IN
2 International Institute of Professional Studies, D.A.V.V., Indore (M.P.), IN

Abstract

In present days of growing information technology, many browsers available for surfing and web mining. A user has option to use any of them at a time to mine out the desired website. Every browser has pre-defined level of popularity and reputation in the market. This paper considers the setup of only two browsers in a computer system and a user prefers to any one, if fails, switches to the other one. The behavior of user is modeled through Markov chain procedure and transition probabilities are calculated. The quitting to browsing is treated as a parameter of variation over the popularity. Graphical study is performed to explain the inter relationship between user behavior parameters and browser market popularity parameters. If rate of a company is lowest in terms of browser failure and lowest in terms of quitting probability then company enjoys better popularity and larger user proportion.

Keywords

Markov Chains (MC), Transition Probability Matrix (TPM), Quality of Service (QOS), Browser Failure (BF).

Full Text

   

D. Shukla ¹, Saurabh Jain ², Rahul Singhai ², R. K. Agarwal ³

Affiliations
1 Dept. of Mathematics and Statistics, Dr. H.S. Gour University, Sagar-470003 (M.P.), IN
2 Dept. of Comp. and Applications, Dr. H.S. Gour University, Sagar-470003 (M.P.), IN
3 Indira Gandhi Engineering College, Sagar, IN

Abstract

In the literature of Round-Robin scheduling scheme, each job is processed, one after the another after giving a fix quantum. In case of First-come first-served, each process is executed, if the previously arrived processed is completed. Both these scheduling schemes are used in this paper as its special cases. A Markov chain model is used to compare several scheduling schemes of the class. An index measure is defined to compare the model based efficiency of different scheduling schemes. One scheduling scheme which is the mixture of FIFO and round robin is found efficient in terms of model based study. The system simulation procedure is used to derive the conclusion of the content.

Keywords

Process Scheduling, Markov Chain Model, State of System, Deadlock State, Process Queue, First-In First-Out (FIFO), Round-Robin Scheduling, Transition Probability Matrix.

Full Text