#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2008

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Paul Beekhuizen, Jacques Resing
- Perform. Eval.
- 2009

Due to the increasing number of modules on chips, e.g., memory blocks, processors, etc., traditional buses between such modules no longer suffice. As an alternative paradigm, so-called Networks on Chips (NoCs) are emerging, where modules are connected using switches or routers. These networks resemble telecommunication networks such as LANs or ATM networks.… (More)

- Paul Beekhuizen, Jacques Resing
- VALUETOOLS
- 2009

We devise an approximation of the marginal queue length distribution in discrete-time polling systems with batch arrivals and fixed packet sizes. The polling server uses the Bernoulli service discipline and Markovian routing. The 1-limited and exhaustive service disciplines are special cases of the Bernoulli service discipline, and traditional cyclic… (More)

- Paul Beekhuizen, Dee Denteneer, Jacques Resing
- Queueing Syst.
- 2008

We consider a discrete-time tree network of polling servers where all packets are routed to the same node (called node 0), from which they leave the network. All packets have unit size and arrive from the exterior according to independent batch Bernoulli arrival processes. The service discipline of each node is work-conserving and the service discipline of… (More)

- Marc Aoun, Paul Beekhuizen, Antonios Argyriou
- 2010 IEEE International Symposium on Network…
- 2010

With network coding, two data packets are transformed into one by a simple XOR-operation. The transformed packet is transmitted and each original packet can be retrieved at its destination node through a similar XOR-operation. Network coding is an important research topic as it radically challenges existing networking paradigms. In this paper we provide an… (More)

- Paul Beekhuizen, Dee Denteneer, Ivo J. B. F. Adan
- Annals OR
- 2008

We study a single-router Network-on-Chip modelled as a tandem queueing network. The first node is a geo/D/1 queue (K fixed) representing a network interface, and the second node is a ./G/1 queue representing the packet switch. If K > 1 we have train arrivals at the second node. If K = 1 the arrival process of the second node reduces to a Bernoulli process.… (More)

- Paul Beekhuizen, Dee Denteneer, Jacques Resing
- VALUETOOLS
- 2008

We consider a tree network of polling stations operating in discrete-time. Packets arrive from external sources to the network according to batch Bernoulli arrival processes. We assume that all nodes have a service discipline that is HoL-based. The class of HoL-based service disciplines contains for instance the Bernoulli and limited service disciplines,… (More)

- Marc Aoun, Paul Beekhuizen, Antonios Argyriou, Dee Denteneer, Peter van der Stok
- Perform. Eval.
- 2012

We provide an analytical study of the impact of packet skipping and opportunistic network coding on the timely communication of messages through a single network element. In a first step, we consider a single-server queueing system with Poisson arrivals, exponential service times, and a single buffer position. Packets arriving at a network node have a fixed… (More)

- Paul Beekhuizen, Jacques Resing
- International Teletraffic Congress
- 2011

We consider a saturated tree network with flow control. The network consists of two layers of polling stations, and all polling stations use the random polling service discipline. We obtain the equilibrium distribution of the network using a Markov chain approach. This equilibrium distribution can be used to efficiently compute the division of throughput… (More)

- Rajendra B C Kumar, Kuda Nageswara Rao, +9 authors Werner R. W. Scheinhardt
- 2015

In this paper, a three stage communication network model with two stage homogeneous bulk arrivals and dynamic bandwidth allocation under equilibrium condition is developed and analyzed. Consider a Communication network in which three nodes are in tandem and the messages arrive to the first node are converted into number of packets and stored in first buffer… (More)

- ‹
- 1
- ›