Computational schemes for two exponential servers where the first has a finite buffer (Q3016174): Difference between revisions

@@ Property / cites work @@
+Optimal Routing Among ⋅/M/1 Queues with Partial Information
+Normal rank
@@ Property / cites work @@
+On the Advantage of Being the First Server
@@ Property / cites work: On the Advantage of Being the First Server / rank @@
+Normal rank
@@ Property / cites work @@
+The age of the arrival process in the G/M/1 and M/G/1 queues
+Normal rank
@@ Property / cites work @@
+A push-pull network with infinite supply of work
@@ Property / cites work: A push-pull network with infinite supply of work / rank @@
+Normal rank
@@ Property / cites work @@
+The Differential Equations of Birth-and-Death Processes, and the Stieltjes Moment Problem
+Normal rank
@@ Property / cites work @@
+Fast algorithms for the characteristic polynomial
@@ Property / cites work: Fast algorithms for the characteristic polynomial / rank @@
+Normal rank
@@ Property / cites work @@
+Spectral properties of the tandem Jackson network, seen as a quasi-birth-and-death process
+Normal rank
@@ Property / cites work @@
+Q5690365
@@ Property / cites work: Q5690365 / rank @@
+Normal rank
@@ Property / cites work @@
+A general class of Markov processes with explicit matrix-geometric solutions
+Normal rank