Results 241 to 250 of about 34,905 (300)
Some of the next articles are maybe not open access.
Management Science, 2004
We consider a monopolist expert offering a service with a “credence” characteristic. A credence service is one in which the customer cannot verify, even after a purchase, whether or not the amount of prescribed service was appropriate; examples include legal, medical, or consultancy services, and car repair. This creates an incentive for the expert to
Laurens Debo +2 more
openaire +2 more sources
We consider a monopolist expert offering a service with a “credence” characteristic. A credence service is one in which the customer cannot verify, even after a purchase, whether or not the amount of prescribed service was appropriate; examples include legal, medical, or consultancy services, and car repair. This creates an incentive for the expert to
Laurens Debo +2 more
openaire +2 more sources
Power analysis of Input-Queued and Crosspoint-Queued crossbar switches
2009 Canadian Conference on Electrical and Computer Engineering, 2009Crossbar switches are fundamental building blocks of digital networks such as the Internet. An Input-Queued (IQ) crossbar switch includes a set of queues at the input side of the switch, combined with an unbuffered switching matrix with N2 crosspoints. A Crosspoint-Queued (XQ) crossbar switch contains a FIFO queue at each of the NxN crosspoints of the ...
Jian Wang, Ted H. Szymanski
openaire +2 more sources
Operations Research, 1967
The equivalence of two concepts of the capacity is developed. Capacity is the limiting load ratio (arrival rate measured in service rate units) for stable behavior. It is also defined as the expected output rate of the system operated under a saturation load.
openaire +1 more source
The equivalence of two concepts of the capacity is developed. Capacity is the limiting load ratio (arrival rate measured in service rate units) for stable behavior. It is also defined as the expected output rate of the system operated under a saturation load.
openaire +1 more source
Operations Research, 1968
Bounds are found for various measures of performance in certain classes of the GI//G1 queue. First, the mean wait in queue is found in terms of the mean and variance of the interarrival, service, and idle distributions. Bounds on the idle time moments lead to bounds on the mean wait and number in queue.
openaire +2 more sources
Bounds are found for various measures of performance in certain classes of the GI//G1 queue. First, the mean wait in queue is found in terms of the mean and variance of the interarrival, service, and idle distributions. Bounds on the idle time moments lead to bounds on the mean wait and number in queue.
openaire +2 more sources
Journal of the ACM, 1992
Summary: Fair queueing is a novel queueing discipline with important applications to data networks that support variable-size packets and to systems where the cost of preempting jobs from service is high. The discipline controls a single server shared by \(N\) job arrival streams with each stream allotted a separate queue.
Albert G. Greenberg, Neal Madras
openaire +3 more sources
Summary: Fair queueing is a novel queueing discipline with important applications to data networks that support variable-size packets and to systems where the cost of preempting jobs from service is high. The discipline controls a single server shared by \(N\) job arrival streams with each stream allotted a separate queue.
Albert G. Greenberg, Neal Madras
openaire +3 more sources
Bell System Technical Journal, 1981
Priority service disciplines are widely used in computer and communications systems. Many such systems can be modeled by queuing networks, but presently developed theory does not allow solution of these models when priority service disciplines are present. For priority queuing networks that have a homogeneity property, we give some explicit results for
openaire +1 more source
Priority service disciplines are widely used in computer and communications systems. Many such systems can be modeled by queuing networks, but presently developed theory does not allow solution of these models when priority service disciplines are present. For priority queuing networks that have a homogeneity property, we give some explicit results for
openaire +1 more source
Transportation Science, 1972
A queuing model is presented in which delay stems from a disparity between the order at which service is provided to customers and the order at which they may leave the system. Consider, for example, wives waiting in cars—single file—for the arrival of their husbands by a common train.
E. Hauer, J. G. C. Templeton
openaire +1 more source
A queuing model is presented in which delay stems from a disparity between the order at which service is provided to customers and the order at which they may leave the system. Consider, for example, wives waiting in cars—single file—for the arrival of their husbands by a common train.
E. Hauer, J. G. C. Templeton
openaire +1 more source
The Output of Multiserver Queuing Systems
Operations Research, 1978We derive a recurrence relation for ξn, the time until the nth departure measured from T0, any well-defined instant in time. While the recurrence, valid for the G/G/s queue, is generally not easy to work with, in certain cases we can use it to obtain the distribution and moments of ξn.
openaire +1 more source
Estimation in Multiserver Queuing Simulations
Operations Research, 1974This paper presents methods for computing point and interval estimates of descriptors of simulated queuing systems. The methods, which rely on the renewal process representation of certain processes, extend the results of Crane and Iglehart, and the author. In particular, the paper shows that computation of three sample quantities suffices to generate
openaire +3 more sources
Queuing Analysis of Satellite Networks
Operations Research, 1970This paper models satellite communications systems by means of bipartite graphs. It assumes stochastic inputs and time delay is the factor of interest. The paper formulates the model and describes the routing and digital transmission schemes, assuming the network links to be synchronized. Messages may be transmitted only in the synchronized time slots,
openaire +3 more sources