34 search results - page 1 / 7 » Parking functions, valet functions and priority queues |
101
Voted
DM
1999
14 years 9 months ago
1999
We construct a bijection between labeled trees and allowable pairs of permutations sorted by a priority queue. These are also the pairs of permutations that avoid the pattern pairs...
113
click to vote
INFOCOM
1993
IEEE
15 years 2 months ago
1993
IEEE
We propose a new service discipline, called the RateControlledStatic-Priority (RCSP) queueingdiscipline, that can provide throughput, delay, delay jitter, and loss free guarantees...
PE
2006
Springer
14 years 10 months ago
2006
Springer
In this paper, we investigate a simplified head-of-the-line with priority jumps (HOL-PJ) scheduling discipline. Therefore, we consider a discrete-time single-server queueing syste...
QUESTA
2007
14 years 9 months ago
2007
Obtaining (tail) probabilities from a transform function is an important topic in queueing theory. To obtain these probabilities in discrete-time queueing systems, we have to inve...
PE
2008
Springer
14 years 10 months ago
2008
Springer
We present the transient analysis of the system content in a two-class discrete-time MX /D/1 priority queue. In particular, we derive an expression for the generating function of ...