scispace - formally typeset
Topic

Queue

About: Queue is a(n) research topic. Over the lifetime, 26504 publication(s) have been published within this topic receiving 358237 citation(s).

...read more

Papers
  More

Journal ArticleDOI: 10.1145/322186.322195
Martin Reiser1, Stephen S. Lavenberg1Institutions (1)
01 Apr 1980-Journal of the ACM
Abstract: It is shown that mean queue sizes, mean waiting times, and throughputs in closed multiple-chain queuing networks which have product-form solution can be computed recursively without computing product terms and normalization constants. The resulting computational procedures have improved properties (avoidance of numerical problems and, in some cases, fewer operations) compared to previous algorithms. Furthermore, the new algorithms have a physically meaningful interpretation which provides the basis for heuristic extensions that allow the approximate solution of networks with a very large number of closed chains, and which is shown to be asymptotically valid for large chain populations.

...read more

Topics: Mean value analysis (56%), Product-form solution (55%), Gordon–Newell theorem (55%) ...read more

1,163 Citations


Journal ArticleDOI: 10.1086/261329
Abstract: It is sometimes argued that bribery is inefficient because bureaucrats may cause delays for attracting more bribes. This hypothesis is examined in the context of a queue where customers having different values of time are ranked by their bribe payments to the queue's server. The Nash equilibrium strategies of the customers are derived. It is shown that the server is unlikely to slow down the allocation process when bribery is allowed. The model does not have stringent informational requirements, and the equilibrium outcome minimizes the average value of time costs of the queue. It also suggests a useful auctioning procedure.

...read more

Topics: Nash equilibrium (55%), Queue (53%), Queueing theory (51%) ...read more

1,124 Citations


Journal ArticleDOI: 10.2307/2312102
Topics: Fork–join queue (68%), Queue (54%)

1,042 Citations


Journal ArticleDOI: 10.1017/S0305004100036781
01 Jul 1962-
Abstract: Here we shall mention only the results referring to stability. The definitions of the various quantities Tn, Sn, SNn, and the basic hypotheses made concerning their structure will be found in §§ 2·1, 3·1 or 4·1. For convenience we shall introduce some further terminology in this section. The single-server queues {SNn, Tn} arising in connexion with queues in series will be called the component queues, and the queue {Sn, sTn} implicit in the discussion of many-server queues will be called the consolidated queue. We have already in § 2.33 called the single-server queue {Sn, Tn} critical if E(S0-T0) = 0. We shall now call it subcritical if E(S0 − To) > 0 and supercritical if E(S0 − T0) < 0. A system of queues in series is subcritical if each component queue is subcritical, critical if (at least) one component queue is critical and the rest are subcritical, and supercritical if (at least) one component queue is supercritical. A many-server queue will be described in these terms according to the character of its consolidated queue. Finally, a single-server queue {Sn, Tn} will be said to be of type M if it has the property considered in Corollary 1 to Theorem 5: the sequences {Sn} and {Tn} are independent of each other, and one is composed of mutually independent non-constant random variables.Single-server queues:(i) Subcritical: stable (Theorem 3).(ii) Supercritical: unstable (Theorem 2).(iii) Critical: stable, properly substable, or unstable (examples in §2·33, including one due to Lindley); unstable if type M (Theorem 5, Corollary 1).Queues in series:(i) Subcritical: stable (Theorem 7).(ii) Supercritical: unstable (Theorem 7).(iii) Critical: stable, properly substable, or unstable, if the component queues are substable (examples in § 3·2); unstable if any component queue is unstable (Theorem 7), and in particular if any critical component queue is of type M (Theorem 7, Corollary).Many-server queues:(i) Subcritical: stable or properly substable (Theorem 8, and example in § 4·3).(ii) Supercritical: unstable (Theorem 8).(iii) Critical: stable, properly substable, or unstable, if consolidated queue is substable (examples in § 4·3); unstable if consolidated queue unstable (Theorem 8), and in particular if this is of type M (Theorem 8, Corollary).From Lemma 1 it follows that none of these queues can be properly substable if all the servers are initially unoccupied.

...read more

Topics: Queue management system (60%), Bulk queue (57%), Multilevel queue (56%) ...read more

1,033 Citations


Open accessJournal ArticleDOI: 10.1109/65.923940
S. Athuraliya1, Steven H. Low1, V.H. Li2, Qinghe Yin2Institutions (2)
01 May 2001-IEEE Network
Abstract: We describe a new active queue management scheme, random exponential marking (REM), that aims to achieve both high utilization and negligible loss and delay in a simple and scalable manner. The key idea is to decouple the congestion measure from the performance measure such as loss, queue length, or delay. While the congestion measure indicates excess demand for bandwidth and must track the number of users, the performance measure should be stabilized around their targets independent of the number of users. We explain the design rationale behind REM and present simulation results of its performance in wireline and wireless networks.

...read more

Topics: Active queue management (63%), Weighted random early detection (59%), Queue (56%) ...read more

1,022 Citations


Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20227
2021567
20201,113
20191,492
20181,401
20171,255

Top Attributes

Show by:

Topic's top 5 most impactful authors

Onno Boxma

113 papers, 1.9K citations

Herwig Bruneel

105 papers, 942 citations

Michel Mandjes

79 papers, 815 citations

Ward Whitt

54 papers, 2.3K citations

Eytan Modiano

43 papers, 754 citations

Network Information
Related Topics (5)
Queueing theory

21.4K papers, 438.8K citations

97% related
Scheduling (computing)

78.6K papers, 1.3M citations

89% related
Markov chain

51.9K papers, 1.3M citations

88% related
Heuristic (computer science)

28K papers, 596K citations

87% related
Markov process

29.7K papers, 738.2K citations

86% related