CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Analysis of the Analytical and Simulations Results with the Network Model and Dynamic Priority of Limited Buffer

by Fathollah Dadgar Arablou, Aliyev Alakbar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 127 - Number 13
Year of Publication: 2015
Authors: Fathollah Dadgar Arablou, Aliyev Alakbar
10.5120/ijca2015906576

Fathollah Dadgar Arablou, Aliyev Alakbar . Analysis of the Analytical and Simulations Results with the Network Model and Dynamic Priority of Limited Buffer. International Journal of Computer Applications. 127, 13 ( October 2015), 17-20. DOI=10.5120/ijca2015906576

@article{ 10.5120/ijca2015906576,
author = { Fathollah Dadgar Arablou, Aliyev Alakbar },
title = { Analysis of the Analytical and Simulations Results with the Network Model and Dynamic Priority of Limited Buffer },
journal = { International Journal of Computer Applications },
issue_date = { October 2015 },
volume = { 127 },
number = { 13 },
month = { October },
year = { 2015 },
issn = { 0975-8887 },
pages = { 17-20 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume127/number13/22789-2015906576/ },
doi = { 10.5120/ijca2015906576 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:19:49.294608+05:30
%A Fathollah Dadgar Arablou
%A Aliyev Alakbar
%T Analysis of the Analytical and Simulations Results with the Network Model and Dynamic Priority of Limited Buffer
%J International Journal of Computer Applications
%@ 0975-8887
%V 127
%N 13
%P 17-20
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The problem of choosing optimal parameters for dynamic priorities in the case of the various types of service requests with linearly decreasing function of priorities, The results of analysis and simulations models of distributed computer networks with dynamic priorities and a limited buffer residence time requirements of the network is limited. The network constraint violation results in a loss requirements. A comparative analysis of the results of analytical and simulation models are conducted to verify the adequacy of the analytical models.

References
  1. Kleinrock L. queuing theory. M .: Mechanical Engineering, 1979.1997.
  2. Pitts J.M., Schormans J.A. Introduction to ATM design and performance.NY: John Wiley & Sons., 1997.
  3. Communication seti.- Kleinrock L. M .: Science, 1970, c.256..-pp.1184-1189.
  4. Mammadli EM, Slipchenko AI, Husidman V.B.Modeli organization dispatch many CPU computing real-time systems. Automation and Remote Control, M.: 1991s.167-175.vol. 138. - pp.7-29.
  5. Ismaylov BG, FA Dadgar Analysis of the characteristics of the networks with dynamic priorities and a limited buffer. Information tehnologiimodelirovaniya and management. Voronezh, №3 (81) 2013 s.292-296.
  6. Kelton W. Lowe A.Imitatsionnoe simulation. Classic S.S. The 3rd edition of St. Petersburg .: Peter, Kiev: BHV Publishing Group, 2004 to -847.
  7. Kim Ji Song, A.Z.Melikov, BG Ismailov Optimal dynamic assignment of priorities in queuing systems with two types of applications and Riga. AVT №6,2008, s57-65.
  8. Chao H.J., Peckan I.H. Queue management with multiple delay and loss priorities for ATM switches // Proc. ICC'94,1994.-pp.1184-1189.
  9. Ismayilov BG design a distributed network of service production facilities and gas treatment // M .: Gas promyshlennost.NTS. 2001, №1. s.29-35.
  10. Communication seti.- Kleinrock L. M .: Science, 1970.
Index Terms

Computer Science
Information Sciences

Keywords

Service dynamic priorities Optimization Dynamic priorities Priority

Powered by PhDFocusTM