R. E. Kooij

Details der Publikationsliste

Zeitraum

1989 - 2008

Anzahl

28

Co-Autoren

Calculating (2008)

R. E. Kooij, O. Østerbø

end-to-end queuing delay for real-time services on an IP network

SLA CALCULUS FOR END-TO-END QOS OF TCP-BASED APPLICATIONS IN A MULTI-DOMAIN ENVIRONMENT (2008)

R. E. Kooij, R. Yang

Next-generation communication services will be offered over distributed information and communication infrastructures consisting of a multitude of administrative domains, owned by different parties....

Applied Education (2008)

I. Hendrawan, R. E. Kooij

Abstract. For Internet service providers (ISPs) the proper dimensioning of Internet access lines is essential. Under-dimensioning generally leads to a less than acceptable end-to-end Quality of...

Limit cycles in the Holling-Tanner model (2006)

Gasull, A., Kooij, R. E., Torregrosa, J.

This paper deals with the following question: does the asymptotic stability of the positive equilibrium of the Holling-Tanner model imply it is also globally stable? We will show that the answer to...

The minimal spectral radius of graphs with a given diameter (2006)

Dam, E.R. Van, Kooij, R.E.

The spectral radius of a graph (i.e., the largest eigenvalue of its corresponding adjacency matrix) plays an important role in modeling virus propagation in networks. In fact, the smaller the...

Modeling Ping times in First Person Shooter games (2006)

N. Degr, D. De Vleeschauwer, R. E. Kooij

CWI is a founding member of ERCIM, the European Research Consortium for Informatics and Mathematics. CWI's research has a theme-oriented structure and is grouped into four clusters. Listed below...

Limit cycles in the Holling-Tanner model (1997)

A. Gasull, R. E. Kooij, J. Torregrosa

This paper deals with the following question: does the asymptotic stability of the positive equilibrium of the Holling-Tanner model imply it is also globally stable? We will show that the answer to...

The minimal spectral radius of graphs with a given diameter

Dam, E.R. Van, Kooij, R.E.

The spectral radius of a graph (i.e., the largest eigenvalue of its corresponding adjacency matrix) plays an important role in modeling virus propagation in networks. In fact, the smaller the...