Searched for: department%3A%22Network%255C%2BArchitectures%255C%2Band%255C%2BServices%22
(61 - 80 of 86)
- document
-
Tang, S. (author), Wang, H. (author), Van Mieghem, P. (author)We revisit the peer selection problem of finding the most nearby peer from an initiating peer. The metrics to assess the closeness between peers are hopcount and delay, respectively. Based on a dense graph model with i.i.d regular link weight, we calculate the probability density function to reach a peer with minimum hopcount and asymptotically...report 2008
- document
-
Agrawal, D.K. (author), Kleiberg, T. (author), Papp, S. (author), Kooij, R.E. (author), Van Mieghem, P. (author)Quality of Service (QoS) support in the current internet is indispensable because of QoS-sensitive real-time applications such as Voice-over-IP, IP-TV, video conferencing, online gaming etc. Since the introduction of the Differentiated Services (Diff-Serv) architecture there has been considerable work reported in literature on its performance...conference paper 2007
- document
-
Lua, E.K. (author), Zhou, X. (author)Peer-to-Peer (P2P) overlay networks can be utilized to deploy massive Internet overlay services such as multicast, content distribution, file sharing, etc. efficiently without any underlying network support. The crucial step to meet this objective is to design network-aware overlay network topologies connecting all nodes that offer promising...conference paper 2007
- document
- Van Mieghem, P. (author) conference paper 2007
- document
-
Van der Hofstad, R. (author), Hooghiemstra, G. (author), Van Mieghem, P. (author)The minimal weight of the shortest path tree in a complete graph with independent and exponential (mean 1) random link weights, is shown to converge to a Gaussian distribution. We prove a conditional central limit theorem and show that the condition holds with probability converging to 1.conference paper 2007
- document
-
Degrande, N. (author), De Vleeschauer, D. (author), Kooij, R.E. (author), Mandjes, M.R.H. (author)In First Person Shooter (FPS) games the Round Trip Time (RTT), i.e., the sum of the network delay from client to server and the network delay from server to client, impacts the gamer’s performance considerably. Game client software usually has a built-in process to measure this RTT (also referred to as ping time), and therefore gamers do not...conference paper 2006
- document
-
Baken, N. (author), Van Belleghem, N. (author), Van Boven, E. (author), De Korte, A. (author)Networks are omnipresent and universal. Mankind, for example, forms a social network. Today, information and communications technology (ICT) exponentially accelerates the interaction between the human nodes of this global social network. In that way, ICT appears to evoke a phase transformation, similar to the physical phase transitions of a...conference paper 2006
- document
-
Lemstra, W. (author), Arnbak, J. (author)Naast de ingreep van de overheid in de industriestructuur hebben technologische ontwikkelingen geleid tot paradigmatische veranderingen in de telecommunicatiesector. Dit leidt tot nieuwe uitdagingen voor de regulering van de sector en, door de toenemende invloed van het internet op ons economisch en sociaal handelen, tot de noodzaak het...conference paper 2006
- 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
-
Houben, S.A. (author), Baken, N. (author), Herve, P. (author), Smets, R. (author)We examined efficiency within wireless access options for mobile devices and discovered that a classic pitfall is revisited. As with the proliferation of services in incumbents’ portfolios, leading to a number of coexisting so-called ‘stove-pipes’, we see an isomorphic phenomenon evolving in multimodal mobile devices, leading to an inefficient...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
-
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
-
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
-
Blenn, N. (author), Charalampidou, K. (author), Doerr, C. (author)The wide-spread popularity of online social networks and the resulting availability of data to researchers has enabled the investigation of new research questions, such as the analysis of information diffusion and how individuals are influencing opinion formation in groups. Many of these new questions however require an automatic assessment of...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.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
- document
-
Haddadi, H. (author), Uhlig, S. (author), Moore, A. (author), Mortier, R. (author), Rio, M. (author)Despite the large number of papers on network topology modeling and inference, there still exists ambiguity about the real nature of the Internet AS and router level topology. While recent findings have illustrated the inaccuracies in maps inferred from BGP peering and traceroute measurements, existing topology models still produce static...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
Searched for: department%3A%22Network%255C%2BArchitectures%255C%2Band%255C%2BServices%22
(61 - 80 of 86)