Searched for:
(41 - 60 of 65)

Pages

document
Dhillon, S.S. (author), Van Mieghem, P. (author)
conference paper 2007
document
Coenen, T.J.M. (author), Goering, P.T.H. (author), Jehangir, A. (author), Van den Berg, J.L. (author), Boucherie, R.J. (author), Heemstra de Groot, S.M. (author), Heijenk, G.J. (author), Dhillon, S.S. (author), Lu, W. (author), Lo, A. (author), Van Mieghem, P.F.A (author), Niemegeers, I.G.M.M. (author)
Personal Networks (PNs) are future communication systems that combine wireless and infrastructure based networks to provide users a variety of services anywhere and anytime. PNs introduce new design challenges due to the heterogeneity of the involved technologies, the need for self-organization, the dynamics of the PN composition, the...
conference paper 2006
document
Jamakovic, A. (author), Kooij, R.E. (author), Van Mieghem, P. (author), Van Dam, E.R. (author)
conference paper 2006
document
Jamakovic, A. (author), Van Mieghem, P. (author)
conference paper 2006
document
Van der Hofstad, R. (author), Hooghiemstra, G. (author), Van Mieghem, P. (author)
We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to m uniformly chosen nodes in the complete graph of size N with i.i.d. exponential link weights. We rely on the fact that the full shortest path tree to all destinations (i.e., m = N ? 1) is a uniform recursive...
conference paper 2006
document
Jamakovic, A. (author), Wang, H. (author), Van Mieghem, P. (author)
conference paper 2006
document
Zhou, X. (author), Kooij, R.E. (author), Uijterwaal, H. (author), Van Mieghem, P. (author)
conference paper 2006
document
Kuipers, F.A. (author), Orda, A. (author), Raz, D. (author), Van Mieghem, P. (author)
conference paper 2006
document
Zhou, X. (author), Muller, F. (author), Kooij, R.E. (author), Van Mieghem, P. (author)
conference paper 2006
document
Avallone, S. (author), Kuipers, F. (author), Ventre, G. (author), Van Mieghem, P. (author)
conference paper 2006
document
Avallone, S. (author), Kuipers, F.A. (author), Ventre, G. (author), Van Mieghem, P. (author)
The problem of finding multi-constrained paths has been addressed by several QoS routing algorithms. While they generally satisfy the application requirements, they often do not consider the perspective of service providers. Service providers aim at maximizing the throughput and the number of accepted requests. These goals have been addressed by...
conference paper 2005
document
Janic, M. (author), Cempaka Wangi, N.I. (author), Zhou, X. (author), Van Mieghem, P. (author)
conference paper 2005
document
Zhou, X. (author), Van Mieghem, P. (author)
conference paper 2005
document
Hekmat, R. (author), Van Mieghem, P. (author)
conference paper 2005
document
Avallone, S. (author), Kuipers, F.A. (author), Ventre, G. (author), Van Mieghem, P. (author)
conference paper 2005
document
Kuipers, F.A. (author), Wang, H. (author), Van Mieghem, P. (author)
conference paper 2005
document
Van Mieghem, P. (author)
conference paper 2005
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
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
Searched for:
(41 - 60 of 65)

Pages