default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenny Van Houdt
Person information
- affiliation: University of Antwerp, Belgium
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j81]Benny Van Houdt
:
On the performance evaluation of distributed join-idle-queue load balancing with and without token withdrawals. Perform. Evaluation 165: 102427 (2024)- [j80]Nicolas Gast, Benny Van Houdt:
Approximations to Study the Impact of the Service Discipline in Systems with Redundancy. Proc. ACM Meas. Anal. Comput. Syst. 8(1): 14:1-14:33 (2024) - [j79]Sewoong Oh, Ramesh K. Sitaraman, Benny Van Houdt:
POMACS V8, N3, December 2024 Editorial. Proc. ACM Meas. Anal. Comput. Syst. 8(3): 29:1 (2024) - [c54]Nicolas Gast, Benny Van Houdt:
Approximations to Study the Impact of the Service Discipline in Systems with Redundancy. SIGMETRICS/Performance (Abstracts) 2024: 1-2 - [i13]Nicolas Gast, Benny Van Houdt:
Approximations to Study the Impact of the Service Discipline in Systems with Redundancy. CoRR abs/2401.07713 (2024) - [i12]Nils Charlet, Benny Van Houdt:
Tail Optimality and Performance Analysis of the Nudge-M Scheduling Algorithm. CoRR abs/2403.06588 (2024) - 2023
- [j78]Grzegorz Kielanski, Tim Hellemans, Benny Van Houdt:
Join-Up-To(m): improved hyperscalable load balancing. Queueing Syst. Theory Appl. 105(3): 291-316 (2023) - [j77]Grzegorz Kielanski, Benny Van Houdt:
Performance Analysis of Work Stealing Strategies in Large-Scale Multithreaded Computing. ACM Trans. Model. Comput. Simul. 33(4): 15:1-15:23 (2023) - [j76]Benny Van Houdt:
On the Cost of Near-Perfect Wear Leveling in Flash-Based SSDs. ACM Trans. Model. Perform. Evaluation Comput. Syst. 8(1-2): 1-22 (2023) - [j75]Tim Hellemans, Grzegorz Kielanski, Benny Van Houdt:
Performance of Load Balancers With Bounded Maximum Queue Length in Case of Non-Exponential Job Sizes. IEEE/ACM Trans. Netw. 31(4): 1626-1641 (2023) - [c53]Benny Van Houdt:
On the Performance Evaluation of Distributed Join-Idle-Queue Load Balancing. MASCOTS 2023: 1-8 - [c52]Benny Van Houdt:
On the Maximum Queue Length of the Hyper Scalable Load Balancing Push Strategy. QEST 2023: 127-142 - [c51]Benny Van Houdt:
On the Stochastic and Asymptotic Improvement of First-Come First-Served and Nudge Scheduling. SIGMETRICS (Abstracts) 2023: 97-98 - 2022
- [j74]Benny Van Houdt:
Simple analytical solutions for the , , and related queues. J. Appl. Probab. 59(4): 1129-1143 (2022) - [j73]Tim Hellemans, Benny Van Houdt:
Performance analysis of load balancing policies with memory. Perform. Evaluation 153: 102259 (2022) - [j72]Tim Hellemans, Benny Van Houdt:
Open problems in refined mean field approximations. Queueing Syst. Theory Appl. 100(3-4): 301-303 (2022) - [j71]Tim Hellemans, Benny Van Houdt:
Improved Load Balancing in Large Scale Systems Using Attained Service Time Reporting. IEEE/ACM Trans. Netw. 30(1): 341-353 (2022) - [i11]Tim Hellemans, Grzegorz Kielanski, Benny Van Houdt:
Performance of Load Balancers with Bounded Maximum Queue Length in case of Non-Exponential Job Sizes. CoRR abs/2201.03905 (2022) - [i10]Benny Van Houdt:
On the stochastic and asymptotic improvement of First-Come First-Served and Nudge scheduling. CoRR abs/2206.10428 (2022) - 2021
- [j70]Tim Hellemans, Benny Van Houdt:
Mean Waiting Time in Large-Scale and Critically Loaded Power of d Load Balancing Systems. Proc. ACM Meas. Anal. Comput. Syst. 5(2): 19:1-19:34 (2021) - [j69]Grzegorz Kielanski, Benny Van Houdt:
On the Asymptotic Insensitivity of the Supermarket Model in Processor Sharing Systems. Proc. ACM Meas. Anal. Comput. Syst. 5(2): 22:1-22:28 (2021) - [j68]Benny Van Houdt:
On the Stochastic and Asymptotic Improvement of First-Come First-Served and Nudge Scheduling. Proc. ACM Meas. Anal. Comput. Syst. 6(3): 50:1-50:22 (2021) - [j67]Nikki Sonenberg, Grzegorz Kielanski, Benny Van Houdt:
Performance Analysis of Work Stealing in Large-scale Multithreaded Computing. ACM Trans. Model. Perform. Evaluation Comput. Syst. 6(2): 6:1-6:28 (2021) - [c50]Grzegorz Kielanski, Benny Van Houdt:
Performance Analysis of Work Stealing Strategies in Large Scale Multi-threaded Computing. QEST 2021: 329-348 - [c49]Grzegorz Kielanski, Benny Van Houdt:
On the Asymptotic Insensitivity of the Supermarket Model in Processor Sharing Systems. SIGMETRICS (Abstracts) 2021: 29-30 - [c48]Tim Hellemans, Benny Van Houdt:
Mean Waiting Time in Large-Scale and Critically Loaded Power of d Load Balancing Systems. SIGMETRICS (Abstracts) 2021: 53-54 - 2020
- [j66]Ignace Van Spilbeeck, Benny Van Houdt:
On the impact of job size variability on heterogeneity-aware load balancing. Ann. Oper. Res. 293(1): 371-399 (2020) - [c47]Illés Antal Horváth, Ziv Scully, Benny Van Houdt:
Mean Field Analysis of Join-Below-Threshold Load Balancing for Resource Sharing Servers. SIGMETRICS (Abstracts) 2020: 41-42 - [c46]Tim Hellemans, Benny Van Houdt:
Performance Analysis of Load Balancing Policies with Memory. VALUETOOLS 2020: 27-34 - [c45]Robin Verschoren, Benny Van Houdt:
How to improve the performance of the d-choices garbage collection algorithm in flash-based SSDs. VALUETOOLS 2020: 180-187 - [i9]Tim Hellemans, Benny Van Houdt:
Performance Analysis of Load Balancing Policies with Memory. CoRR abs/2002.06906 (2020) - [i8]Tim Hellemans, Benny Van Houdt:
Heavy Traffic Analysis of the Mean Response Time for Load Balancing Policies in the Mean Field Regime. CoRR abs/2004.00876 (2020) - [i7]Tim Hellemans, Benny Van Houdt:
Improved Load Balancing in Large Scale Systems using Attained Service Time Reporting. CoRR abs/2011.08250 (2020)
2010 – 2019
- 2019
- [j65]Tim Hellemans, Robert N. Boute, Benny Van Houdt:
Analysis of lead time correlation under a base-stock policy. Eur. J. Oper. Res. 276(2): 519-535 (2019) - [j64]Benny Van Houdt:
Global Attraction of ODE-based Mean Field Models with Hyperexponential Job Sizes. Proc. ACM Meas. Anal. Comput. Syst. 3(2): 23:1-23:23 (2019) - [j63]Tim Hellemans, Tejas Bodas, Benny Van Houdt:
Performance Analysis of Workload Dependent Load Balancing Policies. Proc. ACM Meas. Anal. Comput. Syst. 3(2): 35:1-35:35 (2019) - [j62]Illés Horváth, Ziv Scully, Benny Van Houdt:
Mean Field Analysis of Join-Below-Threshold Load Balancing for Resource Sharing Servers. Proc. ACM Meas. Anal. Comput. Syst. 3(3): 57:1-57:21 (2019) - [j61]Tim Hellemans, Benny Van Houdt:
Performance of Redundancy(d) with Identical/Independent Replicas. ACM Trans. Model. Perform. Evaluation Comput. Syst. 4(2): 9:1-9:28 (2019) - [j60]Robin Verschoren, Benny Van Houdt:
On the Endurance of the d-Choices Garbage Collection Algorithm for Flash-Based SSDs. ACM Trans. Model. Perform. Evaluation Comput. Syst. 4(3): 13:1-13:23 (2019) - [j59]Benny Van Houdt:
Randomized Work Stealing Versus Sharing in Large-Scale Systems With Non-Exponential Job Sizes. IEEE/ACM Trans. Netw. 27(5): 2137-2149 (2019) - [c44]Tim Hellemans, Tejas Bodas, Benny Van Houdt:
Performance Analysis of Workload Dependent Load Balancing Policies. SIGMETRICS (Abstracts) 2019: 7-8 - [c43]Benny Van Houdt:
Global Attraction of ODE-based Mean Field Models with Hyperexponential Job Sizes. SIGMETRICS (Abstracts) 2019: 59-60 - 2018
- [j58]Raïsa Carmen, Inneke Van Nieuwenhuyse, Benny Van Houdt:
Inpatient boarding in emergency departments: Impact on patient delays and system capacity. Eur. J. Oper. Res. 271(3): 953-967 (2018) - [j57]Benny Van Houdt:
Editorial PEVA. Perform. Evaluation 119: 2 (2018) - [j56]Tim Hellemans, Benny Van Houdt:
On the Power-of-d-choices with Least Loaded Server Selection. Proc. ACM Meas. Anal. Comput. Syst. 2(2): 27:1-27:22 (2018) - [j55]Tim Hellemans, Benny Van Houdt:
Analysis of Redundancy(d) with Identical Replicas. SIGMETRICS Perform. Evaluation Rev. 46(3): 74-79 (2018) - [c42]Ignace Van Spilbeeck, Benny Van Houdt:
On the Impact of Job Size Variability on Heterogeneity-Aware Load Balancing. QTNA 2018: 193-215 - [c41]Nicolas Gast, Benny Van Houdt:
A Refined Mean Field Approximation. SIGMETRICS (Abstracts) 2018: 113 - [c40]Tim Hellemans, Benny Van Houdt:
On the Power-of-d-choices with Least Loaded Server Selection. SIGMETRICS (Abstracts) 2018: 114 - [i6]Tim Hellemans, Benny Van Houdt:
On the Power-of-d-choices with Least Loaded Server Selection. CoRR abs/1802.05420 (2018) - [i5]Benny Van Houdt:
Randomized Work Stealing versus Sharing in Large-scale Systems with Non-exponential Job Sizes. CoRR abs/1810.13186 (2018) - [i4]Benny Van Houdt:
Global attraction of ODE-based mean field models with hyperexponential job sizes. CoRR abs/1811.05239 (2018) - 2017
- [j54]Wouter Minnebo, Tim Hellemans, Benny Van Houdt:
On a class of push and pull strategies with single migrations and limited probe rate. Perform. Evaluation 113: 42-67 (2017) - [j53]Nicolas Gast, Benny Van Houdt:
TTL approximations of the cache replacement algorithms LRU(m) and h-LRU. Perform. Evaluation 117: 33-57 (2017) - [j52]Nicolas Gast, Benny Van Houdt:
A Refined Mean Field Approximation. Proc. ACM Meas. Anal. Comput. Syst. 1(2): 33:1-33:28 (2017) - [j51]Miklós Telek, Benny Van Houdt:
Response Time Distribution of a Class of Limited Processor Sharing Queues. SIGMETRICS Perform. Evaluation Rev. 45(3): 143-155 (2017) - [j50]Benny Van Houdt:
Explicit Back-Off Rates for Achieving Target Throughputs in CSMA/CA Networks. IEEE/ACM Trans. Netw. 25(2): 765-778 (2017) - [j49]Kristen Gardner, Mor Harchol-Balter, Alan Scheller-Wolf, Benny Van Houdt:
A Better Model for Job Redundancy: Decoupling Server Slowdown and Job Size. IEEE/ACM Trans. Netw. 25(6): 3353-3367 (2017) - [c39]Benny Van Houdt:
Free Energy Approximations for CSMA Networks. MASCOTS 2017: 121-131 - [e2]Andrea Marin, Benny Van Houdt, Giuliano Casale, Dorina C. Petriu, Sabina Rossi:
Proceedings of the 11th EAI International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2017, Venice, Italy, December 05-07, 2017. ACM 2017 [contents] - [i3]Benny Van Houdt:
Free Energy Approximations for CSMA networks. CoRR abs/1703.10500 (2017) - 2016
- [j48]Benny Van Houdt:
On the power of asymmetry and memory in flash-based SSD garbage collection. Perform. Evaluation 97: 1-15 (2016) - [j47]Robbe Block, Benny Van Houdt:
Spatial fairness in multi-channel CSMA line networks. Perform. Evaluation 103: 69-85 (2016) - [j46]Nicolas Gast, Benny Van Houdt:
Transient and steady-state regime of a family of list-based cache replacement algorithms. Queueing Syst. Theory Appl. 83(3-4): 293-328 (2016) - [c38]Robin Verschoren, Benny Van Houdt:
Analytic models for flash-based SSD performance when subject to trimming. MSST 2016: 1-14 - [c37]Robin Verschoren, Benny Van Houdt:
On the Impact of Garbage Collection on Flash-Based SSD Endurance. INFLOW@OSDI 2016 - [c36]Benny Van Houdt:
Explicit Back-off Rates for Achieving Target Throughputs in CSMA/CA Networks. SIGMETRICS 2016: 377-379 - [c35]Nicolas Gast, Benny Van Houdt:
Asymptotically Exact TTL-Approximations of the Cache Replacement Algorithms LRU(m) and h-LRU. ITC 2016: 157-165 - [e1]Gul Agha, Benny Van Houdt:
Quantitative Evaluation of Systems - 13th International Conference, QEST 2016, Quebec City, QC, Canada, August 23-25, 2016, Proceedings. Lecture Notes in Computer Science 9826, Springer 2016, ISBN 978-3-319-43424-7 [contents] - [i2]Benny Van Houdt:
Explicit back-off rates for achieving target throughputs in CSMA/CA networks. CoRR abs/1602.08290 (2016) - 2015
- [j45]Robbe Block, Benny Van Houdt:
Spatial Fairness in Multi-Channel CSMA Line Networks. EAI Endorsed Trans. Future Intell. Educ. Environ. 1(5): e5 (2015) - [j44]Ignace Van Spilbeeck, Benny Van Houdt:
Performance of rate-based pull and push strategies in heterogeneous networks. Perform. Evaluation 91: 2-15 (2015) - [c34]Gino T. Peeters, Benny Van Houdt:
On the capacity of a random access channel with successive interference cancellation. ICC Workshops 2015: 2051-2056 - [c33]Nicolas Gast, Benny Van Houdt:
Transient and Steady-state Regime of a Family of List-based Cache Replacement Algorithms. SIGMETRICS 2015: 123-136 - [c32]Wouter Minnebo, Benny Van Houdt:
Analysis of Rate-Based Pull and Push Strategies with Limited Migration Rates in Large Distributed Networks. VALUETOOLS 2015: 196-203 - 2014
- [j43]Robbe Block, Gino T. Peeters, Benny Van Houdt:
A branching process approach to compute the delay and energy efficiency of tree algorithms with free access. Comput. Networks 58: 13-28 (2014) - [j42]Robert N. Boute, Stephen M. Disney, Marc Lambrecht, Benny Van Houdt:
Coordinating lead times and safety stocks under autocorrelated demand. Eur. J. Oper. Res. 232(1): 52-63 (2014) - [j41]Ann M. Noblesse, Robert N. Boute, Marc Lambrecht, Benny Van Houdt:
Characterizing order processes of continuous review (s, S) and (r, nQ) policies. Eur. J. Oper. Res. 236(2): 534-547 (2014) - [j40]Peter Buchholz, Benny Van Houdt:
Editorial. Perform. Evaluation 79: 1 (2014) - [j39]Benny Van Houdt:
On the necessity of hot and cold data identification to reduce the write amplification in flash-based SSDs. Perform. Evaluation 82: 1-14 (2014) - [j38]Benny Van Houdt:
A mean field model for a class of garbage collection algorithms in flash-based solid state drives. Queueing Syst. Theory Appl. 77(2): 149-176 (2014) - [j37]Wouter Minnebo, Benny Van Houdt:
A Fair Comparison of Pull and Push Strategies in Large Distributed Networks. IEEE/ACM Trans. Netw. 22(3): 996-1006 (2014) - [c31]Robbe Block, Benny Van Houdt:
Spatial Fairness in Multi-Channel CSMA Line Networks. VALUETOOLS 2014 - 2013
- [j36]Gábor Horváth, Benny Van Houdt:
Departure process analysis of the multi-type MMAP[K]/PH[K]/1 FCFS queue. Perform. Evaluation 70(6): 423-439 (2013) - [j35]Benny Van Houdt:
Performance of garbage collection algorithms for flash-based solid state drives with hot/cold data. Perform. Evaluation 70(10): 692-703 (2013) - [c30]Wouter Minnebo, Benny Van Houdt:
Improved Rate-Based Pull and Push Strategies in Large Distributed Networks. MASCOTS 2013: 141-150 - [c29]Benny Van Houdt:
A mean field model for a class of garbage collection algorithms in flash-based solid state drives. SIGMETRICS 2013: 191-202 - [c28]Benny Van Houdt:
Analysis of the d-choices garbage collection algorithm with memory in flash-based SSDs. VALUETOOLS 2013: 11-19 - 2012
- [j34]Benny Van Houdt:
Analysis of the adaptive MMAP[K]/PH[K]/1 queue: A multi-type queue with adaptive arrivals and general impatience. Eur. J. Oper. Res. 220(3): 695-704 (2012) - [j33]Benny Van Houdt:
A matrix geometric representation for the queue length distribution of multitype semi-Markovian queues. Perform. Evaluation 69(7-8): 299-314 (2012) - [j32]Benny Van Houdt, Juan F. Pérez:
The impact of dampening demand variability in a production/inventory system with multiple retailers (abstract only). SIGMETRICS Perform. Evaluation Rev. 39(4): 30 (2012) - [j31]Dario Bini, Beatrice Meini, S. Steffé, Juan F. Pérez, Benny Van Houdt:
SMCSolver and Q-MAM: tools for matrix-analytic methods. SIGMETRICS Perform. Evaluation Rev. 39(4): 46 (2012) - [c27]Gábor Horváth, Benny Van Houdt:
A Multi-layer Fluid Queue with Boundary Phase Transitions and Its Application to the Analysis of Multi-type Queues with General Customer Impatience. QEST 2012: 23-32 - [c26]Benny Van Houdt, Luca Bortolussi:
Fluid limit of an asynchronous optical packet switch with shared per link full range wavelength conversion. SIGMETRICS 2012: 113-124 - [c25]Wouter Minnebo, Benny Van Houdt:
Pull versus push mechanism in large distributed networks: Closed form results. ITC 2012: 1-8 - 2011
- [j30]Benny Van Houdt, Johan van Leeuwaarden:
Triangular M/G/1-Type and Tree-Like Quasi-Birth-Death Markov Chains. INFORMS J. Comput. 23(1): 165-171 (2011) - [j29]Juan F. Pérez, Benny Van Houdt:
Quasi-birth-and-death processes with restricted transitions and its applications. Perform. Evaluation 68(2): 126-141 (2011) - [j28]Juan F. Pérez, Benny Van Houdt:
The effect of partial conversion and fiber delay lines in an OBS switch with a large number of wavelengths. Photonic Netw. Commun. 21(1): 64-77 (2011) - [j27]Benny Van Houdt:
Load balancing and the power of preventive probing. SIGMETRICS Perform. Evaluation Rev. 39(2): 65-67 (2011) - [c24]Benny Van Houdt, Juan F. Pérez:
Impact of Dampening Demand Variability in a Production/Inventory System with Multiple Retailers. MAM 2011: 227-250 - [c23]Benny Van Houdt:
Performance Comparison of Aggressive Push and Traditional Pull Strategies in Large Distributed Systems. QEST 2011: 265-274 - 2010
- [j26]Sophie Hautphenne, Benny Van Houdt:
On the link between Markovian trees and tree-structured Markov chains. Eur. J. Oper. Res. 201(3): 791-798 (2010) - [j25]Benny Van Houdt, Chris Develder, Juan F. Pérez, Mario Pickavet, Bart Dhoedt:
Mean Field Calculation for Optical Grid Dimensioning. JOCN 2(6): 355-367 (2010) - [j24]Juan F. Pérez, Benny Van Houdt:
A mean field model for an optical switch with a large number of wavelengths and centralized partial conversion. Perform. Evaluation 67(11): 1044-1058 (2010) - [j23]Gino T. Peeters, Benny Van Houdt:
Interference Cancellation Tree Algorithms with k-Signal Memory Locations. IEEE Trans. Commun. 58(11): 3056-3061 (2010) - [c22]Benny Van Houdt:
A Phase-Type Representation for the Queue Length Distribution of a Semi-Markovian Queue. QEST 2010: 49-58 - [c21]Gino T. Peeters, Benny Van Houdt:
Design and analysis of multi-carrier multiple access systems without feedback. ITC 2010: 1-8
2000 – 2009
- 2009
- [j22]Wouter Rogiest, Joke Lambert, Dieter Fiems, Benny Van Houdt, Herwig Bruneel, Chris Blondia:
A unified model for synchronous and asynchronous FDL buffers allowing closed-form solution. Perform. Evaluation 66(7): 343-355 (2009) - [j21]Gino T. Peeters, R. Bocklandt, Benny Van Houdt:
Multiple access algorithms without feedback using combinatorial designs. IEEE Trans. Commun. 57(9): 2724-2733 (2009) - [j20]Juan F. Pérez, Benny Van Houdt:
Wavelength allocation in an optical switch with a fiber delay line buffer and limited-range wavelength conversion. Telecommun. Syst. 41(1): 37-49 (2009) - [j19]Gino T. Peeters, Benny Van Houdt:
On the maximum stable throughput of tree algorithms with free access. IEEE Trans. Inf. Theory 55(11): 5087-5099 (2009) - [c20]Juan F. Pérez, Benny Van Houdt:
Dimensioning an OBS Switch with Partial Wavelength Conversion and Fiber Delay Lines via a Mean Field Model. INFOCOM 2009: 2651-2655 - [c19]Juan F. Pérez, Benny Van Houdt:
Exploiting Restricted Transitions in Quasi-Birth-and-Death Processes. QEST 2009: 123-132 - [c18]Dario Bini, Beatrice Meini, S. Steffé, Benny Van Houdt:
Structured Markov chains solver: tool extension. VALUETOOLS 2009: 20 - 2008
- [j18]Benny Van Houdt, Jeroen Van Velthoven, Chris Blondia:
QBD Markov chains on binomial-like trees and its application to multilevel feedback queues. Ann. Oper. Res. 160(1): 3-18 (2008) - [j17]Joke Lambert, Benny Van Houdt, Chris Blondia:
Queues in DOCSIS cable modem networks. Comput. Oper. Res. 35(8): 2482-2496 (2008) - [c17]Joke Lambert, Wouter Rogiest, Benny Van Houdt, Dieter Fiems, Chris Blondia, Herwig Bruneel:
A Hessenberg Markov Chain for Fast Fibre Delay Line Length Optimization. ASMTA 2008: 101-113 - [c16]Benny Van Houdt, Gino T. Peeters:
FCFS tree algorithms with interference cancellation and single signal memory requirements. ICT 2008: 1-6 - [c15]Juan F. Pérez, Jeroen Van Velthoven, Benny Van Houdt:
Q-MAM: a tool for solving infinite queues using matrix-analytic methods. VALUETOOLS 2008: 16 - [c14]Gino T. Peeters, Benny Van Houdt:
Improved high maximum stable throughput FCFS tree algorithms with interference cancellation. VALUETOOLS 2008: 40 - 2007
- [j16]Robert N. Boute, Stephen M. Disney, Marc Lambrecht, Benny Van Houdt:
An integrated production and inventory model to dampen upstream demand variability in the supply chain. Eur. J. Oper. Res. 178(1): 121-142 (2007) - [j15]Gino T. Peeters, Benny Van Houdt, Chris Blondia:
A multiaccess tree algorithm with free access, interference cancellation and single signal memory requirements. Perform. Evaluation 64(9-12): 1041-1052 (2007) - [c13]Gino T. Peeters, Benny Van Houdt, Chris Blondia:
Optimal Batch Scheduling in DVB-S2 Satellite Networks. GLOBECOM 2007: 4607-4612 - [c12]Jeroen Van Velthoven, Benny Van Houdt, Chris Blondia:
Simultaneous Transient Analysis of QBD Markov Chains for all Initial Configurations using a Level Based Recursion. QEST 2007: 79-90 - [c11]Joke Lambert, Benny Van Houdt, Chris Blondia:
A policy iteration algorithm for Markov decision processes skip-free in one direction. VALUETOOLS 2007: 75 - [i1]Joke Lambert, Benny Van Houdt, Chris Blondia:
A policy iteration algorithm for Markov decision processes skip-free in one direction. Numerical Methods for Structured Markov Chains 2007 - 2006
- [j14]Jeroen Van Velthoven, Benny Van Houdt, Chris Blondia:
On the probability of abandonment in queues with limited sojourn and waiting times. Oper. Res. Lett. 34(3): 333-338 (2006) - [j13]Benny Van Houdt, Chris Blondia:
Analyzing priority queues with 3 classes using tree-like processes. Queueing Syst. Theory Appl. 54(2): 99-109 (2006) - [c10]Jeroen Van Velthoven, Benny Van Houdt, Chris Blondia:
The Impact of Buffer Finiteness on the Loss Rate in a Priority Queueing System. EPEW 2006: 211-225 - [c9]Jeroen Van Velthoven, Benny Van Houdt, Chris Blondia:
Transient analysis of tree-Like processes and its application to random access systems. SIGMETRICS/Performance 2006: 181-190 - 2005
- [j12]Benny Van Houdt, Attahiru Sule Alfa:
Response time in a tandem queue with blocking, Markovian arrivals and phase-type services. Oper. Res. Lett. 33(4): 373-381 (2005) - [j11]Dessislava Nikolova, Benny Van Houdt, Chris Blondia:
Dynamic Bandwidth Allocation Algorithms for Ethernet Passive Optical Networks with Threshold Reporting. Telecommun. Syst. 28(1): 31-52 (2005) - [c8]Joke Lambert, Benny Van Houdt, Chris Blondia:
Dimensioning the Contention Channel of DOCSIS Cable Modem Networks. NETWORKING 2005: 342-357 - [c7]Benny Van Houdt, Chris Blondia:
QBDs with Marked Time Epochs: a Framework for Transient Performance Measures. QEST 2005: 210-219 - 2004
- [j10]Chris Blondia, Benny Van Houdt:
Throughput of Q-Ary Splitting Algorithms for Contention Resolution in Communication Networks. Commun. Inf. Syst. 4(2): 135-164 (2004) - [j9]Nikolaos Laoutaris, Benny Van Houdt, Ioannis Stavrakakis:
Optimization of a packet video receiver under different levels of delay jitter: an analytical approach. Perform. Evaluation 55(3-4): 251-275 (2004) - [j8]Benny Van Houdt, Chris Blondia:
Robustness of Q-ary collision resolution algorithms in random access systems. Perform. Evaluation 57(3): 357-377 (2004) - [j7]Chris Develder, Benny Van Houdt, Chris Blondia, Mario Pickavet, Piet Demeester:
Analytical MMAP-Based Bounds for Packet Loss in Optical Packet Switching with Recirculating FDL Buffers. Photonic Netw. Commun. 8(2): 149-161 (2004) - [c6]Benny Van Houdt, Koenraad Laevens, Joke Lambert, Chris Blondia, Herwig Bruneel:
Channel utilization and loss rate in a single-wavelength fibre delay line (FDL) buffer. GLOBECOM 2004: 1900-1906 - 2003
- [j6]Benny Van Houdt, Chris Blondia:
Robustness Properties of FS-ALOHA++: A Contention Resolution Algorithm for Dynamic Bandwidth Allocation. Mob. Networks Appl. 8(3): 237-253 (2003) - [j5]Benny Van Houdt, R. B. Lenin, Chris Blondia:
Delay Distribution of (Im)Patient Customers in a Discrete Time D-MAP/PH/1 Queue with Age-Dependent Service Times. Queueing Syst. Theory Appl. 45(1): 59-73 (2003) - 2002
- [c5]Kimon P. Kontovasilis, Sabine Wittevrongel, Herwig Bruneel, Benny Van Houdt:
Performance of Telecommunication Systems: State of the Art. Communication Systems: The State of the Art (IFIP World Computer Congress) 2002: 61-94 - 2001
- [b1]Benny Van Houdt:
Performance evaluation of contention resolution algorithms in random access systems. University of Antwerp, Belgium, 2001 - [j4]Benny Van Houdt, Chris Blondia, Olga Casals, Jorge García-Vidal:
Performance Analysis of a MAC Protocol for Broadband Wireless ATM Networks with Quality of Service Provisioning. J. Interconnect. Networks 2(1): 103-130 (2001) - 2000
- [j3]Benny Van Houdt, Chris Blondia:
Performance Evaluation of the Identifier Splitting Algorithm with Polling in Wireless ATM Networks. Int. J. Wirel. Inf. Networks 7(2): 91-103 (2000) - [j2]Benny Van Houdt, Chris Blondia:
Analysis of an identifier splitting algorithm combined with polling (ISAP) for contention resolution in a wireless access network. IEEE J. Sel. Areas Commun. 18(11): 2345-2355 (2000)
1990 – 1999
- 1999
- [j1]David Vázquez-Cortizo, Jorge García-Vidal, Chris Blondia, Benny Van Houdt:
FIFO by Sets ALOHA (FS-ALOHA): A Collision Resolution Algorithm for the Contention Channel in Wireless ATM Systems. Perform. Evaluation 36-37(1-4): 401-427 (1999) - [c4]Llorenç Cerdà, Olga Casals, Benny Van Houdt, Chris Blondia:
Performance Evaluation of the Conformance Definition for the ABR Service in ATM Networks. Broadband Communications 1999: 209-222 - [c3]Benny Van Houdt, Chris Blondia, Olga Casals, Jorge García-Vidal:
Packet Level Performance Characteristics of a MAC Protocol for Wireless ATM LANs. LCN 1999: 14-23 - [c2]Benny Van Houdt, Chris Blondia, Olga Casals, Jorge García-Vidal, D. Vazquez:
Performance Evaluation of a MAC Protocol for Wireless ATM Networks Supporting the ATM Service Categories. WOWMOM 1999: 10-17 - 1998
- [c1]Chris Blondia, Olga Casals, Benny Van Houdt:
Buffer analysis of the explicit rate congestion control mechanism for the ABR service category in ATM networks. PICS 1998: 177-188
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
