Network calculus is a deterministic queuing theory that has gained increasing attention in recent time. Founded on min-plus algebra it resorts to intuitive convolution formulae for efficient concatenation of servers and derivation of related performance bounds. Yet, the pessimistic worst-case analysis of deterministic network calculus gave rise to probabilistic counterparts that aim at utilizin...

cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. it merges a lot of physical resources and offers them to users as services according to service level agreement. therefore, resource management alongside with task scheduling has direct influence on cloud networks’ performance and efficiency. presenting a proper scheduling ...

in this work, response surface methodology (rsm) and artificial neural network (ann) were used to predict the decolorization efficiency of reactive red 33 (rr 33) by o3/uv process in a bubble column reactor. the effects of four independent variables including time (20-60 min), superficial gas velocity (0.06-0.18 cm/s), initial concentration of dye (50-150 ppm) and ph (3-11) were investigated us...

We address questions raised by Lobo et al. in 2012 regarding the NP-hard problem of finding an optimal allocation of workers to machine groups in a job shop so as to minimize Lmax, the maximum job lateness. Lobo et al. formulated a lower bound on Lmax given a worker allocation, and an algorithm to find an allocation yielding the smallest such lower bound. In this article we establish optimality...

  We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...

—Nowadays distributed computing approach has become very popular due to several advantages over the centralized computing approach as it also offers high performance computing at a very low cost. Each router implements some queuing mechanism for resources allocation in a best possible optimize manner and governs with packet transmission and buffer mechanism. In this paper, different types of qu...

In this paper, we use both fuzzy optimization and normal simulation methods to solve fuzzy web planning model problems, which are queuing system problems for designing web servers. We apply fuzzy probabilities to the queuing system models with customers arrival rate λ and servers’ service rate μ, and then compute fuzzy system performance variables, including Utilization, Number (of requests) in...

The automatic allocation of enterprise workload to resources can be enhanced by being able to make what-if response time predictions whilst different allocations are being considered. We experimentally investigate an historical and a layered queuing performance model and show how they can provide a good level of support for a dynamic − urgent cloud environment. Using this we define, implement a...