An End-to-End Approach to the Resequencing Problem
From MaRDI portal
Recommendations
Cited in
(16)- Algorithms of placing recovery points
- A mean-field limit for a class of queueing networks
- Effects of service disciplines in \(G/GI/s\) queueing systems
- Permutations generated by token passing in graphs
- The customer response times in the processor sharing queue are associated
- Packet reordering in networks with heavy-tailed delays
- Tails for (max, plus) recursions under subexponentiality
- Stochastic bounds in Fork-Join queueing systems under full and partial mapping
- A. B. Clarke's Tandem Queue Revisited—Sojourn Times
- On the Large Deviations of Resequencing Queue Size: 2-M/M/1 Case
- Queues with resequencing a survey and recent results
- On the influence of resequencing on the regularity of service
- Festschrift for Erol Gelenbe's 70th birthday
- EROL GELENBE: A CAREER IN MULTI-DISCIPLINARY PROBABILITY MODELS
- A FINITE CAPACITY RESEQUENCING MODEL WITH MARKOVIAN ARRIVALS
- Analysis of dual-hop and multiple relays cooperative truncated ARQ with relay selection in WSNs
This page was built for publication: An End-to-End Approach to the Resequencing Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765229)
