Novel Mechanism Control Algorithm for Wired Network
Abstract
Problem statement: A critical issue in wireless network where the data can hack by the person and we add a novel encryption mechanism to protect the data transfer from client to server and vice versa. Approach: We present a queuing model of a client and server that uses for bulk arrival service. The arrival of data requests is assumed to Markov Poisson Distributed Process (MPDP) and the events are considered in the server for process sharing. We obtained the parameter of service rate, arrival rate, expected waiting time and expected busy period. We also derive the expression for the data value of threshold. Results: The total number of packets request processed, there was no time limit to arrivals, while compared to m/m/1 model. Our model m/m (1,b)/1 was more efficient to find response and request time in between client and server. Conclusions: Our proposed simulation model validated through Java programming.
DOI: https://doi.org/10.3844/jcssp.2011.1426.1431
Copyright: © 2011 V. B. Kirubanand and S. Palaniammal. This is an open access article distributed under the terms of the
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 2,930 Views
- 2,446 Downloads
- 0 Citations
Download
Keywords
- Client server
- queuing petri nets
- novel encryption
- bulk service rule
- Markov Poisson Distributed Process (MPDP)
- encryption technique
- wired device
- data transaction
- vice versa
- file server