An End-to-End Approach to the Resequencing Problem
From MaRDI portal
Publication:3765229
DOI10.1145/828.1883zbMath0628.68020OpenAlexW2075493275WikidataQ56992516 ScholiaQ56992516MaRDI QIDQ3765229
Erol Gelenbe, François Baccelli, Brigitte Plateau
Publication date: 1984
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00076464/file/RR-0097.pdf
distributed systemsperformance analysiscommunication systemsconsistency controlpacket-switching networksserialization
Related Items
Stochastic bounds in Fork-Join queueing systems under full and partial mapping ⋮ Algorithms of placing recovery points ⋮ Permutations generated by token passing in graphs ⋮ FESTSCHRIFT FOR EROL GELENBE'S 70TH BIRTHDAY ⋮ EROL GELENBE: A CAREER IN MULTI-DISCIPLINARY PROBABILITY MODELS ⋮ A. B. Clarke's Tandem Queue Revisited—Sojourn Times ⋮ A FINITE CAPACITY RESEQUENCING MODEL WITH MARKOVIAN ARRIVALS ⋮ Queues with resequencing a survey and recent results ⋮ A mean-field limit for a class of queueing networks ⋮ Tails for (max, plus) recursions under subexponentiality ⋮ Analysis of dual-hop and multiple relays cooperative truncated ARQ with relay selection in WSNs ⋮ The customer response times in the processor sharing queue are associated ⋮ Effects of service disciplines in \(G/GI/s\) queueing systems
