A red modified weighted moving average for soft real-time application
Joanna Domańska, Adam Domański, Dariusz Augustyn, Jerzy Klamka (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Displaying similar documents to “Sensitivity examination of the simulation result of discrete event dynamic systems with perturbation analysis.”
A red modified weighted moving average for soft real-time application
A Content-based Dynamic Load-Balancing Algorithm for Heterogeneous Web Server Cluster
Zhang Lin, Li Xiao-ping, Su Yuan (2010)
Computer Science and Information Systems
Similarity:
Self-tuning random early detection algorithm to improve performance of network transmission.
Chen, Jianyong, Hu, Cunying, Ji, Zhen (2011)
Mathematical Problems in Engineering
Similarity:
Modeling and optimization of M/G/1-type queueing networks: an efficient sensitivity analysis approach.
Tang, Liang, Xi, Hong-Sheng, Zhu, Jin, Yin, Bao-Qun (2010)
Mathematical Problems in Engineering
Similarity:
An improved ARED algorithm for congestion control of network transmission.
Chen, Jianyong, Hu, Cunying, Ji, Zhen (2010)
Mathematical Problems in Engineering
Similarity:
Transparent Scheduling of Composite Web Services
Dyachuk, Dmytro, Deters, Ralph (2007)
Serdica Journal of Computing
Similarity:
Composite Web Services (CWS) aggregate multiple Web Services in one logical unit to accomplish a complex task (e.g. business process). This aggregation is achieved by defining a workflow that orchestrates the underlying Web Services in a manner consistent with the desired functionality. Since CWS can aggregate atomic and other CWS they foster the development of service layers and reuse of already existing functionality. An important issue in the deployment of services is their run-time...
A threshold accepting approach to the open vehicle routing problem
Christos D. Tarantilis, George Ioannou, Chris T. Kiranoudis, Gregory P. Prastacos (2004)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this paper we consider the operational planning problem of physical distribution via a fleet of hired vehicles, for which the travelling cost is solely a function of the sequence of locations visited within all open delivery routes, while vehicle fixed cost is inexistent. The problem is a special class of vehicle routing and is encountered in the literature as the Open Vehicle Routing Problem (OVRP), since vehicles are not required to return to the depot. The goal is to distribute...
Suboptimal feedback control of TCP flows in computer network using random early discard (RED) mechanism.
Ahmed, N.U., Li, Cheng (2005)
Mathematical Problems in Engineering
Similarity:
Approximation approach to performance evaluation of proxy cache server systems.
Bérczes, Tamás (2008)
Annales Mathematicae et Informaticae
Similarity:
Allocating servers to facilities, when demand is elastic to travel and waiting times
Vladimir Marianov, Miguel Rios, Francisco Javier Barros (2005)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Public inoculation centers are examples of facilities providing service to customers whose demand is elastic to travel and waiting time. That is, people will not travel too far, or stay in line for too long to obtain the service. The goal, when planning such services, is to maximize the demand they attract, by locating centers and staffing them so as to reduce customers’ travel time and time spent in queue. In the case of inoculation centers, the goal is to maximize the people that travel...
A computational algorithm for the CPP/M/c retrial queue.
Van Do, Tien (2008)
Annales Mathematicae et Informaticae
Similarity:
Minimization of the total completion time for asynchronous transmission in a packet data-transmission system
Adam Piórkowski, Jan Werewka (2010)
International Journal of Applied Mathematics and Computer Science
Similarity:
The minimization of the total completion time for asynchronous transmission in distributed systems is discussed. Attention is focused on the problem of message scheduling on part of the sender. Messages to be sent form a queue, and the order in which they are to be sent has to be first established. The methods of scheduling messages, which minimize the factor of the total completion time, are presented herein. The message-scheduling problem becomes considerably complicated when the stream...