- document
- Van Mieghem, P.F.A. (author), Kuipers, F.A. (author) journal article 2003
- document
- Kuipers, F.A. (author), Van Mieghem, P.F.A. (author) conference paper 2003
- document
- Van Mieghem, P.F.A. (author), Kuipers, F.A. (author), Korkmaz, T (author), Krunz, M (author), Curado, M (author), Monteiro, E (author), Masip-Bruin, X (author), Sole-Pareta, J (author), Sanchez-Lopez, S (author) book chapter 2003
- document
- Guo, Y. (author), Kuipers, F.A. (author), Van Mieghem, P.F.A. (author) journal article 2003
- document
- Kuipers, F. (author), Van Mieghem, P. (author), Korkmaz, T. (author), Krunz, M. (author) journal article 2002
- document
- Kuipers, F.A. (author), Van Mieghem, P.F.A. (author) journal article 2002
- document
- Kuipers, F.A. (author), Van Mieghem, P.F.A. (author), Korkmaz, T (author), Krunz, M (author) journal article 2002
- document
- Janic, M (author), Kuipers, F.A. (author), Zhou, X (author), Van Mieghem, P.F.A. (author) conference paper 2002
- document
-
Kuipers, F. (author), Van Mieghem, P. (author)QoS routing is expected to be an essential building block of a future, efficient and scalable QoS-aware network architecture. We present SAMCRA, an exact QoS routing algorithm that guarantees to find a feasible path if such a path exists. The complexity of SAMCRA is analyzed. Because SAMCRA is an exact algorithm, most findings can be applied to...conference paper 2001
- document
-
Begtasevic, F. (author), Van Mieghem, P. (author)End-to-end quality of service is very likely to depend on the hopcount, the number of traversed routers. The hopcount also enhances our understanding of properties of the Internet topology. In this paper we present the results of the measurements of the hopcount from a source at Delft towards several destinations spread over three continents....conference paper 2001
- document
- Van Mieghem, P. (author), Hooghiemstra, G. (author), van der Hofstad, R. (author) journal article 2001
- document
- Van Mieghem, P.F.A. (author), de Neve, H (author), Kuipers, F.A. (author) journal article 2001
- document
- Kuipers, F.A. (author), Van Mieghem, P.F.A. (author) conference paper 2001
- document
- Van Mieghem, P. (author) public lecture 1999
- document
-
Hooghiemstra, G. (author), Van Mieghem, P. (author)Both the hopcount HN (the number of links) and the weight WN (the sum of the weights on links) of the shortest path between two arbitrary nodes in the complete graph KN with i.i.d. exponential link weights is computed. We consider the joint distribution of the pair (HN,WN) and derive, after proper scaling, the joint limiting distribution. One of...journal article
- document
-
Li, C. (author), Wang, H. (author), Van Mieghem, P. (author)The largest eigenvalue ? 1 of the adjacency matrix powerfully characterizes dynamic processes on networks, such as virus spread and synchronization. The minimization of the spectral radius by removing a set of links (or nodes) has been shown to be an NP-complete problem. So far, the best heuristic strategy is to remove links/nodes based on the...conference paper
- document
-
Van Mieghem, P. (author), Tang, S. (author)We model the weight (e.g. delay, distance or cost) from an arbitrary node to the nearest (in weight) peer in a peer-to-peer (P2P) network. The exact probability generating function and an asymptotic analysis is presented for a random graph with i.i.d. exponential link weights. The asymptotic distribution function is a Fermi-Dirac distribution...journal article
- document
-
Blenn, N. (author), Doerr, C. (author), Van Kester, B. (author), Van Mieghem, P. (author)As Online Social Networks (OSNs) become an intensive sub- ject of research for example in computer science, networking, social sci- ences etc., a growing need for valid and useful datasets is present. The time taken to crawl the network is however introducing a bias which should be minimized. Usual ways of addressing this problem are sampling...conference paper
- document
-
Beshir, A.A. (author), Kuipers, F.A. (author), Van Mieghem, P. (author), Orda, A. (author)In WDM networks, survivable routing and wavelength assignment (SRWA) involves assigning link-disjoint primary and backup lightpaths. In the on-line SRWA problem, a sequence of requests arrive and each request is either accepted or rejected based only on the input sequence seen so far. For special networks, we establish on-line algorithms with...conference paper
- document
-
Beshir, A. (author), Fernando Kuipers, F. (author), Orda, A. (author), Van Mieghem, P. (author)Wavelength Division Multiplexing (WDM) optical networks offer a large amount of bandwidth using multiple, but independent wavelength channels (or lightpaths), each operating at several Gb/s. Since the traffic between users is usually only a fraction of the capacity offered by a wavelength, several independent traffic streams can be groomed...conference paper