Improving Queuing System Throughput Using Distributed Mean Value Analysis to Control Network Congestion
Read full paper at:
http://www.scirp.org/journal/PaperInformation.aspx?PaperID=53719#.VNByFSzQrzE
http://www.scirp.org/journal/PaperInformation.aspx?PaperID=53719#.VNByFSzQrzE
Author(s)
Faisal Shahzad1, Muhammad Faheem Mushtaq1, Saleem Ullah1*, M. Abubakar Siddique2, Shahzada Khurram1, Najia Saher1
Affiliation(s)
1Department of Computer Science & IT, The Islamia University of Bahawalpur, Bahawalpur, Pakistan.
2College of Computer Science, Chongqing University, Chongqing, China.
2College of Computer Science, Chongqing University, Chongqing, China.
ABSTRACT
In
this paper, we have used the distributed mean value analysis (DMVA)
technique with the help of random observe property (ROP) and palm
probabilities to improve the network queuing system throughput. In such
networks, where finding the complete communication path from source to
destination, especially when these nodes are not in the same region
while sending data between two nodes. So, an algorithm is developed for
single and multi-server centers which give more interesting and
successful results. The network is designed by a closed queuing network
model and we will use mean value analysis to determine the network
throughput (b) for its different values. For certain chosen values of
parameters involved in this model, we found that the maximum network
throughput for <span "=""><span "="">β≥0.7 remains
consistent in a single server case, while in multi-server case for β≥
0.5 throughput surpass the Marko chain queuing system.
Cite this paper
References
Shahzad,
F. , Mushtaq, M. , Ullah, S. , Siddique, M. , Khurram, S. and Saher, N.
(2015) Improving Queuing System Throughput Using Distributed Mean Value
Analysis to Control Network Congestion. Communications and Network, 7, 21-29. doi: 10.4236/cn.2015.71003.
| [1] | Jones, E.P.C., Li, L. and Ward, P.A.S. (2005) Practical Routing in Delay-Tolerant Networks. Proceedings of ACM SIGCOMM Workshop on Delay Tolerant Networking (WDTN), New York, 1-7. |
| [2] | Zhao, W., Ammar, M. and Zegura, E. (2005) Controlling the Mobility of Multiple Data Transport Ferries in a Delay-Tolerant Network. INFOCOM, 1407-1418. |
| [3] | Bambos,
N. and Michalidis, G. (2005) Queueing Networks of Random Link Topology:
Stationary Dynamics of Maximal Throughput Schedules. Queueing Systems,
50, 5-52. http://dx.doi.org/10.1007/s11134-005-0858-x |
| [4] | Kawanishi,
K. (2005) On the Counting Process for a Class of Markovian Arrival
Processes with an Application to a Queueing System. Queueing Systems,
49, 93-122. http://dx.doi.org/10.1007/s11134-005-6478-7 |
| [5] | Masuyama, H. and Takine, T. (2002) Analysis of an Infinite-Server Queue with Batch Markovian Arrival Streams. Queueing Systems, 42, 269-296. http://dx.doi.org/10.1023/A:1020575915095 |
| [6] | Armero, C. and Conesa, D. (2000) Prediction in Markovian Bulk Arrival Queues. Queueing Systems, 34, 327-335. http://dx.doi.org/10.1023/A:1019121506451 |
| [7] | Bertsimas,
D. and Mourtzinou, G. (1997) Multicalss Queueing System in Heavy
Traffic: An Asymptotic Approach Based on Distributional and
Conversational Laws. Operations Research, 45, 470-487. http://dx.doi.org/10.1287/opre.45.3.470 |
| [8] | Reiser, M. (1977) Numerical Methods in Separable Queuing Networks. Studies in Management SCI, 7, 113-142. |
| [9] | Chandy, K.M., Howard, J., Keller, T.W. and Towsley, D.J. (1973) Local Balance, Robustness, Poisson Departures and the Product Forms in Queueing Networks. Research Notes from Computer Science Department, University of Texas at Austin, Austin. |
| [10] | Knadler Jr., C.E. (1991) The Robustness of Separable Queueing Network Models. In: Nelson, B.L., David Kelton, W. and Clark, G.M., Eds., Proceedings of the 1991 Winter Simulation Conference, 661-665. eww150203lx |
评论
发表评论