- 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
-
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
- 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. (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
- Guo, Y. (author), Kuipers, F.A. (author), Van Mieghem, P.F.A. (author) journal article 2003
- document
- Van Mieghem, P.F.A. (author), Kuipers, F.A. (author) journal article 2003
- document
- Kuipers, F. (author), Korkmaz, T. (author), Krunz, M. (author), Van Mieghem, P. (author) journal article 2004
- document
- Kuipers, F.A. (author), Korkmaz, T. (author), Krunz, M. (author), Van Mieghem, P.F.A. (author) journal article 2004
- document
- Van Mieghem, P. (author), Van Langen, S. (author) journal article 2005
- document
- Van Mieghem, P. (author), Magdalena, S.M. (author) journal article 2005
- document
- Kuipers, F.A. (author), Van Mieghem, P.F.A. (author) journal article 2005
- document
- Kuipers, F.A. (author), Van Mieghem, P. (author) journal article 2005
- document
-
Kuipers, F.A. (author), Van Mieghem, P.F.A. (author)Finding a path in a network based on multiple constraints (the MCP problem) is often considered an integral part of quality of service (QoS) routing. QoS routing with constraints on multiple additive measures has been proven to be NP-complete. This proof has dramatically influenced the research community, resulting into the common belief that...journal article 2005
- document
- Kuipers, F.A. (author), Van Mieghem, P.F.A. (author) journal article 2005
- document
-
Masip-Bruin, X (author), Yannuzzi, M (author), Domingo-Pascual, J (author), Fonte, A (author), Curado, M (author), Monteiro, E (author), Kuipers, F.A. (author), Van Mieghem, P.F.A. (author), Avallone, S (author), Ventre, G (author), Aranda-Gutiérrez, P (author), Hollick, M (author), Steinmetz, R (author), Iannone, L (author), Salamatian, K (author)Quality of Service Routing is at present an active and remarkable research area, since most emerging network services require specialized Quality of Service (QoS) functionalities that cannot be provided by the current QoS-unaware routing protocols. The provisioning of QoS based network services is in general terms an extremely complex problem,...journal article 2006
- document
- Wang, H. (author), Martin Hernandez, J. (author), Van Mieghem, P. (author) journal article 2008
- document
- Lu, Y (author), Fallica, B (author), Kuipers, F.A. (author), Kooij, Robert (author), Van Mieghem, P.F.A. (author) journal article 2009