Stationary analysis of the “Shortest Queue First” service policy: The asymmetric case (Q4976518): Difference between revisions

@@ Property / OpenAlex ID @@
+W1504118992
@@ Property / OpenAlex ID: W1504118992 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.3496
@@ Property / arXiv ID: 1305.3496 / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence between processor sharing and service in random order.
+Normal rank
@@ Property / cites work @@
+A two-queue, one-server model with priority for the longer queue
+Normal rank
@@ Property / cites work @@
+Random walks in the quarter plane with zero drift: an explicit criterion for the finiteness of the associated group
+Normal rank
@@ Property / cites work @@
+Two queues in parallel
@@ Property / cites work: Two queues in parallel / rank @@
+Normal rank
@@ Property / cites work @@
+Rate conservation laws for multidimensional processes of bounded variation with applications to priority queueing systems
+Normal rank
@@ Property / cites work @@
+Two Parallel Queues with Infinite Servers and<i>Join the Shortest Queue</i>Discipline
+Normal rank
@@ Property / cites work @@
+Stationary analysis of the shortest queue first service policy
+Normal rank
@@ Property / cites work @@
+Q3748518
@@ Property / cites work: Q3748518 / rank @@
+Normal rank