Showing papers on "Server published in 1970"

On the Optimality of Single-Server Queuing Systems

Abstract: This paper considers optimal design models for queuing systems in which the decision variables are the number of servers and the mean rate at which each serves, the total cost per unit time of operating the system is the sum of a service cost per unit time and a waiting cost per unit time, and the optimality criterion is long-run expected average cost per unit time. It is shown that a single-server system is optimal for a wide class of arrival processes and service-time distributions, and for a wide variety of waiting-cost functions.

Two-Server Markovian Queues with Balking: Heterogeneous vs. Homogeneous Servers

Abstract: This paper analyses a Markovian queuing system with balking and two heterogeneous servers determines the capacity of the slower server and obtains the optimal service rates that minimize the average characteristics of the heterogeneous system. The heterogeneous system is compared with a corresponding homogeneous system and a condition showing the efficiency of the heterogeneous system is obtained, this condition involving only the traffic intensity and the service rates. A cost model is discussed and various tables and graphs representing the average characteristics of both the systems are given.

Multiple channel queues in heavy traffic. III: random server selection

Abstract: As in [4] and [5], we study service facilities with r arrival channels and s service channels. However, here we assume that customers, immediately upon arrival, randomly select one of the s service channels. Successive customers make this choice independently, choosing server i with probability p i , p 1 + · · · + p s = 1. Customers are then served by the servers they select in order of their arrival without defections. The average processing rates as well as the server selection probabilities may vary from server to server, but again we assume the r arrival channels are independent and independent of the service channels. The service channels are not independent, however, because of the random server selection. For simplicity, we only consider a single queueing system; the extension to sequences follows immediately using the argument of [5].

Neighbor Replica Distribution Technique for Cluster Server Systems

Abstract: Data replication increases the reliability and availability of a web server cluster. However, different data replication techniques have different reliability levels. In this paper, Neighbor Replica Distribution Technique (NRDT) has been proposed to improve the reliability of a web cluster server. This technique provides high reliability by imposing a neighbor logical structure on data copies. Data from one server will be replicated to its neighboring servers and vice versa in the case of failure. The algorithm of NRDT data replica scheme based on the asynchronous replication results in a higher reliability. It shows that this technique provides a convenient approach to high reliability for web server cluster.

Combined delay- and loss-queuing system

Abstract: The paper presents a detailed study of a combined delay- and loss-queuing system which has limited waiting capacity. The queuing system considered is one with Poisson input, exponential servers and first-come-first-served queue discipline. The stationary-state probabilities of the system and the distribution function of the waiting time are obtained in explicit form. It is shown that many results obtained by other workers can be derived from those presented in the paper. In addition, the operational control of queuing systems is also discussed.

Analysis Of Job Scheduling Algorithm For An E-Business Model In A Cloud Computing Environment Via GI/G/3/N/K Queuing Model

Abstract: Conventional e-Business models using the Client/Server architecture has always been complex, thorny and expensive. The quantity and assortment of hardware, software and middleware technologies used in order to run them was intimidating. With the emergence of Cloud computing, the technologies needed for an e-Businesses application are managed by experienced third parties who offer servers, storage management, network technologies, and virtualization technologies. This manuscript presents the accomplishment of the job scheduling algorithm developed for an emblematic e-Business model using GI/G/3/n/k queuing theory perception. Finally, the associated simulations and numeral results are provided, to assurance the Quality of Service (QoS) for all throughput of system.

Steady-State Solution of the Queuing System Eu/M/s with Batch Service

Abstract: This paper develops the steady-state solution for the queuing system with s parallel servers when arrivals are serviced in batches of size Q. The service time for all servers is exponentially distributed and the customer interarrival times are Erlangian of degree u.

Views For The Development Of The Port OfThessaloniki Based On The Cost Of The ServingProcess

Abstract: In this paper an analysis of the serving process in the Port of Thesaloniki is presented using as instruments the methods of Queuing Theory and Mathematical Statistics. The aim is to estimate the serving cost and find the optimal number of servers in order that the cost would be the minimum. To achieve this goal the port is modelled as a serving mechanism. By processing a large amount of data, the approximate distributions of the arrival flow and serving time are estimated and tested. Also, the idle server cost and the cost of ships waiting to be served are defined. Then we find the model of Queuing Theory, which best describes our serving model. It is shown that the number of servers in the Port of Thessaloniki at the present is sufficient in one part and exceeds the optimal in the other parts. Based also on results from forecasting techniques we conclude that the further development of this port must not continue with increasing the number of the servers.

Ubu Films Sydney Underground Movies 1965 1970

Abstract: ubu films sydney underground movies 1965 1970 is available in our book collection an online access to it is set as public so you can get it instantly. Our book servers spans in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Merely said, the ubu films sydney underground movies 1965 1970 is universally compatible with any devices to read.

Technology Based On Distributed GIS Tools:An Approach For Sustainable Planning

Abstract: An information system such as GIS is the main instrument supporting decisions about complex problems in sustainable development, where geographic, orographic, rural growth, geological, geo-social, etc. data make up recurrent and important elements of planning. Many problems and territorial activities have spread characteristics, so that both analysis and management/control systems should hold in account this distinctive feature by specific design oriented to distributed objects and functions. In order to put in evidence these spread characteristics, we will introduce one example of data measures and links for application in the fields: farm activity support, natural park management and control. In particular we will focus on two systems: the remote multi-detection device and GIS. Collection of sequential data, spread on the territory, determines important choices on: structure of detection device, data transmission, links, communication channels, communication protocols, data consistency, pre/postelaboration of data, etc. Distributed architecture of Terrapack32M GIS includes: special tools, communication server module and radio-control interfaced by different layers (DCOM, JAVA, .NET). Interoperability extended to linked applications and, in our case study, improved stages of: remote connection, update data servers and data correlations.