Comments on a Two Queue Network

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A two-enqueuer queue

The question of whether all shared objects with consensus number 2 belong to Common2, the class of objects that can be implemented from two-process consensus and atomic registers, was first posed by Herlihy. In the absence of general results, several researchers have obtained implementations for restricted-concurrency versions of FIFO queue. We present the first Common2 algorithm for a queue wi...

متن کامل

A Heuristic Method on Extended Two-Stage Network Structures

Data Envelopment Analysis (DEA) as a non–parametric method is used to measure relative performance of organizational units. The aim of this paper is to develop a new model to evaluate the efficiency of a general two-stage network structures proposed by Li et al.  (2012) for measuring the performance of Decision Making Units (DMUs). In addition, this paper expands the work of Li et al. (2012) an...

متن کامل

Marginal congestion cost on a dynamic network with queue spillbacks

We formulate an empirical model of congestion for a network where queues may form and spill back from one link to another. Its purpose is to disentangle the dynamic effect that a marginal vehicle, on a given link and at a given time, has on the distribution of travel times experienced there and on connected links. We estimate a dynamic model, based on an unusually complete and accurate dataset ...

متن کامل

On the optimal control of a two-queue polling model

This paper deals with two M/M/1 queues served by a single server with threshold switching. Our main goal is to solve the Poisson equation and, as a result, give expressions for the long-run expected average cost of holding units and switching actions of the server, and the bias vector.

متن کامل

Queue length synchronization in a communication network

Traffic flows on networks have been the subject of intensive study [1]. We study this problem in the context of a two dimensional lattice of nodes and hubs. When many messages flow on the lattice, hubs which lie on many message paths tend to get congested. We rank the hubs by their coefficient of betweenness centrality (CBC) [2] which is defined as the number of messages Nk running through a gi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Statistics and Probability

سال: 2017

ISSN: 1927-7040,1927-7032

DOI: 10.5539/ijsp.v6n6p43