Остановите войну!
for scientists:
default search action
Benny Van Houdt
- > Home > Persons > Benny Van Houdt
Publications
- 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) - 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 - 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
- [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) - [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) - 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) - 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
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 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint