In this study, a Markovian fluid flow system with two stages separated by a finite buffer is considered. Fluid flow models have been analyzed extensively to evaluate the performance of production, computer, and telecommunication systems. Recently, we developed a methodology to analyze general Markovian continuous flow systems with a finite buffer. The flexibility of this methodology allows us t...

High bandwidth requirements in multimedia transmission make the efficient use of limited network resource a challenging task, especially when multiple clients make their requests to the server simultaneously. In this paper, we propose a self-adjusted network transmission mechanism for multiple clients. Instead of assigning a fixed bandwidth for each client, the server determines the transmissio...

ÐInput buffered switch architecture has become attractive for implementing high performance routers and expanding use of the Internet sees an increasing need for quality of service. It is challenging to provide a scheduling technique that is both highly efficient and fair in resource allocation. In this paper, we first introduce an iterative fair scheduling(i FS) scheme for input buffered switc...

Maintenance problems are crucial aspect of nowadays industrial problems. However, the quest of the efficient periodicity of maintenance for all components of a system is far from an easy task to accomplish when considering all the antagonistic criteria of the maintenance and production views of a production system. Thus, the objective is to simultaneously ensure a low frequency of failures by a...

We consider a production control problem in a manufacturing system with failure-prone machines and a constant demand rate. The objective is to minimise a discounted inventory holding and backlog cost over an infinite planning horizon. The availability of the machines is improved through a corrective maintenance strategy. The decision variables are the production and the machine repair rates, wh...

Although deadlock avoidance issue has attracted much attention and has been extensively studied, most of the existing results assume reliable machines, which makes it difficult to apply existing deadlock avoidance algorithms to a real manufacturing system with unreliable machines. This paper presents the results to apply existing deadlock avoidance algorithms to systems with unreliable machines...

This paper is a case study of a general method for designing generators of repeatable non-Poisson sequences of pseudorandom pulses. A class of normal distributions and some classes of skew distributions are derived. Block diagrams and design guides are given. The study is based both on analytical and simulation approaches. Applications of the proposed system may be found in the field of hardwar...

We consider online scheduling so as to maximize the minimum load, using a reordering buffer which can store some of the jobs before they are assigned irrevocably to machines. For m identical machines, we show an upper bound of Hm−1 + 1 for a buffer of size m − 1. A competitive ratio below Hm is not possible with any finite buffer size, and it requires a buffer of size Ω̃(m) to get a ratio ofO(lo...

Incorporating promising techniques, including buffering, priority, de-allocation, preemption, and threshold control on the buffer into the resource allocation design for the general packet radio service (GPRS) network, four resource allocation strategies are proposed in this paper, i.e., strategies RAS1, RAS2, RASth1, and RASth2. For the four strategies, analytic models are built to obtain perf...

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 ...