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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Dynamic Analysis of Priority with Linear Decreasing Function of a Priority in the Service System with Four Types of Application

by Fathollah Dadgar Arablou
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 124 - Number 15
Year of Publication: 2015
Authors: Fathollah Dadgar Arablou
10.5120/ijca2015905555

Fathollah Dadgar Arablou . Dynamic Analysis of Priority with Linear Decreasing Function of a Priority in the Service System with Four Types of Application. International Journal of Computer Applications. 124, 15 ( August 2015), 6-12. DOI=10.5120/ijca2015905555

@article{ 10.5120/ijca2015905555,
author = { Fathollah Dadgar Arablou },
title = { Dynamic Analysis of Priority with Linear Decreasing Function of a Priority in the Service System with Four Types of Application },
journal = { International Journal of Computer Applications },
issue_date = { August 2015 },
volume = { 124 },
number = { 15 },
month = { August },
year = { 2015 },
issn = { 0975-8887 },
pages = { 6-12 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume124/number15/22178-2015905555/ },
doi = { 10.5120/ijca2015905555 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:14:29.232184+05:30
%A Fathollah Dadgar Arablou
%T Dynamic Analysis of Priority with Linear Decreasing Function of a Priority in the Service System with Four Types of Application
%J International Journal of Computer Applications
%@ 0975-8887
%V 124
%N 15
%P 6-12
%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, performed experiments and obtained results. These results can be used to develop algorithms of functioning nodes for data and their software. In this paper we propose a method for solving the problem of choosing the optimal values of these coefficients that minimize the total value of the queue length in systems with four types of applications.

References
  1. Pitts J.M., Schormans J.A. Introduction to ATM design and performance. NY: John Wiley & Sons., 1997.
  2. Chao H.J., Peckan I.H. Queue management with multiple delay and loss priorities for ATM switches // Proc. ICC'94,1994.-pp.1184-1189.
  3. Lee Y., Choi BDQueueing system with multiple delay and loss priorities for ATM networks // Information systems .2001.- vol. 138. - pp.7-29.
  4. Kim C.S., Melikov A.Z., Ponomarenko L.A. Approximation method for performance analysis of queuing system with multimedia traffics // Applied and Comput. Math.2007.-vol.6, no.2.- pp.218-226.
  5. 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.
  6. Melikov AZ, Ismayilov BG Optimization of hierarchical structures of data networks // Math. ANAS, Series of Physical-Technical and Mathematical nauk.1997. №6 s.69-73.
  7. Ismayilov BG design a distributed network of service production facilities and gas treatment // M .: Gas promyshlennost.NTS. 2001, №1. s.29-35.
  8. Communication seti.- Kleinrock L. M .: Science, 1970.
Index Terms

Computer Science
Information Sciences

Keywords

Service dynamic priorities Optimization Dynamic priorities Priority.

Powered by PhDFocusTM