Benny Van Houdt
Benny Van Houdt
Professor of Computer Science, University of Antwerp
Dirección de correo verificada de - Página principal
Citado por
Citado por
An integrated production and inventory model to dampen upstream demand variability in the supply chain
RN Boute, SM Disney, MR Lambrecht, B Van Houdt
European Journal of Operational Research 178 (1), 121-142, 2007
Structured Markov chains solver: software tools
DA Bini, B Meini, S Steffe, B Van Houdt
Proceeding from the 2006 workshop on Tools for solving structured Markov …, 2006
A better model for job redundancy: Decoupling server slowdown and job size
K Gardner, M Harchol-Balter, A Scheller-Wolf, B Van Houdt
IEEE/ACM transactions on networking 25 (6), 3353-3367, 2017
A mean field model for a class of garbage collection algorithms in flash-based solid state drives
B Van Houdt
ACM SIGMETRICS Performance Evaluation Review 41 (1), 191-202, 2013
Transient and steady-state regime of a family of list-based cache replacement algorithms
N Gast, B Van Houdt
Proceedings of the 2015 ACM SIGMETRICS International Conference on …, 2015
Performance of garbage collection algorithms for flash-based solid state drives with hot/cold data
B Van Houdt
Performance Evaluation 70 (10), 692-703, 2013
Performance evaluation of a production/inventory system with periodic review and endogenous lead times
RN Boute, MR Lambrecht, B Van Houdt
Naval Research Logistics (NRL) 54 (4), 462-473, 2007
A win–win solution for the bullwhip problem
RN Boute, SM Disney, MR Lambrecht, B Van Houdt
Production Planning and Control 19 (7), 702-711, 2008
Designing replenishment rules in a two-echelon supply chain with a flexible or an inflexible capacity strategy
RN Boute, SM Disney, MR Lambrecht, B Van Houdt
International Journal of Production Economics 119 (1), 187-198, 2009
Stability and performance of stack algorithms for random access communication modeled as a tree structured QBD Markov chain
B Van Houdt, C Blondia
Taylor & Francis Group 17 (3), 247-270, 2001
Asymptotically exact TTL-approximations of the cache replacement algorithms LRU (m) and h-LRU
N Gast, B Van Houdt
2016 28th International Teletraffic Congress (ITC 28) 1, 157-165, 2016
A fair comparison of pull and push strategies in large distributed networks
W Minnebo, B Van Houdt
IEEE/ACM Transactions on Networking 22 (3), 996-1006, 2013
Delay distribution of (im) patient customers in a discrete time D-MAP/PH/1 queue with age-dependent service times
B Van Houdt, RB Lenin, C Blondia
Queueing systems 45 (1), 59-73, 2003
The waiting time distribution of a type k customer in a discrete-time MMAP [K]/PH [K]/c (c= 1, 2) queue using QBDs
B Van Houdt#, C Blondia
Taylor & Francis Group 20 (1), 55-69, 2004
Dynamic bandwidth allocation algorithms in EPON: a simulation study
D Nikolova, B Van Houdt, CL Blondia
OptiComm 2003: Optical Networking and Communications 5285, 369-380, 2003
Triangular M/G/1-type and tree-like quasi-birth-death Markov chains
B Van Houdt, JSH van Leeuwaarden
INFORMS Journal on Computing 23 (1), 165-171, 2011
A unified model for synchronous and asynchronous FDL buffers allowing closed-form solution
W Rogiest, J Lambert, D Fiems, B Van Houdt, H Bruneel, C Blondia
Performance Evaluation 66 (7), 343-355, 2009
On the power-of-d-choices with least loaded server selection
T Hellemans, B Van Houdt
Proceedings of the ACM on Measurement and Analysis of Computing Systems 2 (2 …, 2018
Dynamic bandwidth allocation algorithms for Ethernet passive optical networks with threshold reporting
D Nikolova, B Van Houdt, C Blondia
Telecommunication Systems 28 (1), 31-52, 2005
Approximated transient queue length and waiting time distributions via steady state analysis
B Van Houdt, C Blondia
Stochastic Models 21 (2-3), 725-744, 2005
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20