Searched for:
(1 - 20 of 65)

Pages

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
Fallica, B. (author), Lu, Y. (author), Kuipers, F.A. (author), Kooij, R. (author), Van Mieghem, P. (author)
Peer-to-Peer (P2P) file sharing has become immensely popular in the Internet. Recently, there has been a growing interest in academic and commercial enviornments for live streaming using P2P technology. A number of new P2P digital television (P2PTV) applications have emerged. Such P2PTV applications are developed with proprietary technologies...
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
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
Lu, Y. (author), Mol, J.D.D. (author), Kuipers, F.A. (author), Van Mieghem, P. (author)
Recently, there has been a growing interest in academic and commercial environments for Video-on-Demand (VoD) using Peer-to-Peer (P2P) technology. Unlike centralized solutions for VoD services, P2P technology lets the clients distribute video content among themselves. In this paper, we propose an analytical model for P2PVoD and we compare that...
conference paper
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
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
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
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
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
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
Searched for:
(1 - 20 of 65)

Pages