"uuid","repository link","title","author","contributor","publication year","abstract","subject topic","language","publication type","publisher","isbn","issn","patent","patent status","bibliographic note","access restriction","embargo date","faculty","department","research group","programme","project","coordinates"
"uuid:afa57467-7ef9-41d5-a816-bf598c01cdd5","http://resolver.tudelft.nl/uuid:afa57467-7ef9-41d5-a816-bf598c01cdd5","Symbolic Regression on Network Properties","Märtens, M. (TU Delft Network Architectures and Services); Kuipers, F.A. (TU Delft Embedded and Networked Systems); Van Mieghem, P.F.A. (TU Delft Network Architectures and Services)","McDermott, James (editor); Castelli, Mauro (editor); Sekanina, Lukas (editor); Wolf, Ina (editor); García-Sánchez, Pablo (editor)","2017","Networks are continuously growing in complexity, which creates challenges for determining their most important characteristics. While analytical bounds are often too conservative, the computational effort of algorithmic approaches does not scale well with network size. This work uses Cartesian Genetic Programming for symbolic regression to evolve mathematical equations that relate network properties directly to the eigenvalues of network adjacency and Laplacian matrices. In particular, we show that these eigenvalues are powerful features to evolve approximate equations for the network diameter and the isoperimetric number, which are hard to compute algorithmically. Our experiments indicate a good performance of the evolved equations for several real-world networks and we demonstrate how the generalization power can be influenced by the selection of training networks and feature sets.","Cartesian genetic programming; Complex networks; Symbolic regression","en","conference paper","Springer International Publishing AG","","","","","","","","","","Network Architectures and Services","","",""
"uuid:f7e950ac-b071-4749-a2bb-0844c4097371","http://resolver.tudelft.nl/uuid:f7e950ac-b071-4749-a2bb-0844c4097371","Designing virus-resistant networks: A game-formation approach","Trajanovski, S.; Kuipers, F.A.; Hayel, Y.; Altman, E.; Van Mieghem, P.","","2015","Forming, in a decentralized fashion, an optimal network topology while balancing multiple, possibly conflicting objectives like cost, high performance, security and resiliency to viruses is a challenging endeavor. In this paper, we take a game-formation approach to network design where each player, for instance an autonomous system in the Internet, aims to collectively minimize the cost of installing links, of protecting against viruses, and of assuring connectivity. In the game, minimizing virus risk as well as connectivity costs results in sparse graphs. We show that the Nash Equilibria are trees that, according to the Price of Anarchy (PoA), are close to the global optimum, while the worst-case Nash Equilibrium and the global optimum may significantly differ for small infection rate and link installation cost. Moreover, the types of trees, in both the Nash Equilibria and the optimal solution, depend on the virus infection rate, which provides new insights into how viruses spread: for high infection rate tau , the path graph is the worst- and the star graph is the best-case Nash Equilibrium. However, for small and intermediate values of tau , trees different from the path and star graphs may be optimal.","","en","conference paper","IEEE","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:5c80616a-87ba-478d-8428-45f807f473f3","http://resolver.tudelft.nl/uuid:5c80616a-87ba-478d-8428-45f807f473f3","A network approach for power grid robustness against cascading failures","Wang, X.; Koc, Y.; Kooij, R.E.; Van Mieghem, P.","","2015","Cascading failures are one of the main reasons for blackouts in electrical power grids. Stable power supply requires a robust design of the power grid topology. Currently, the impact of the grid structure on the grid robustness is mainly assessed by purely topological metrics, that fail to capture the fundamental properties of the electrical power grids such as power flow allocation according to Kirchhoff’s laws. This paper deploys the effective graph resistance as a metric to relate the topology of a grid to its robustness against cascading failures. Specifically, the effective graph resistance is deployed as a metric for network expansions (by means of transmission line additions) of an existing power grid. Four strategies based on network properties are investigated to optimize the effective graph resistance, accordingly to improve the robustness, of a given power grid at a low computational complexity. Experimental results suggest the existence of Braess’s paradox in power grids: bringing an additional line into the system occasionally results in decrease of the grid robustness. This paper further investigates the impact of the topology on the Braess’s paradox, and identifies specific sub-structures whose existence results in Braess’s paradox in power grids. Careful assessment of the design and expansion choices of grid topologies incorporating the insights provided by this paper optimizes the robustness of a power grid, while avoiding the Braess’s paradox in the system.","","en","conference paper","RNDM","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:26d4989c-b5bb-4b75-b27a-2e91e09a517a","http://resolver.tudelft.nl/uuid:26d4989c-b5bb-4b75-b27a-2e91e09a517a","Critical regions and region-disjoint paths in a network","Trajanovski, S.; Kuipers, F. A.; Van Mieghem, P.; Ili?, A.; Crowcroft, J.","","2013","Due to the importance of communication networks to society, it is pertinent that these networks can withstand failures. Improving the robustness of a network usually requires installing redundant resources, which is very costly. Network providers are consequently less inclined to take robustness measures against failures that are unlikely to manifest, like several failures coinciding simultaneously in different geographic regions of their network. Protecting against single regional failures is more realistic. Network robustness, in terms of connectivity properties, also requires survivability algorithms to quickly reroute traffic affected by a network failure. In this paper, we consider a network embedded in a plane and study the problem of finding a circular region with radius r in that plane that would cause the biggest network degradation if all nodes within that particular region were to be destroyed. We propose a polynomial time algorithm for finding such critical regions. In addition, we develop a region-aware network augmentation technique to decrease the impact of a critical region failure. We subsequently consider the region-disjoint paths problem, which asks for two paths with minimum total weight between a source (s) and a destination (d) that cannot both be cut by a single circular regional failure of radius r (unless that failure includes s and d). We prove that the region-disjoint paths problem is NP-hard and propose and evaluate a heuristic algorithm for it.","survivability; region-disjoint paths; determining critical regions; network augmentation","en","conference paper","IEEE","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Intelligent Systems","","","",""
"uuid:0e9209fa-8798-4698-8315-81cf20686263","http://resolver.tudelft.nl/uuid:0e9209fa-8798-4698-8315-81cf20686263","Finding critical regions in a network","Trajanovski, S.; Kuipers, F. A.; Van Mieghem, P.","","2013","It is important that our vital networks (e.g., infrastructures) are robust to more than single-link failures. Failures might for instance affect a part of the network that resides in a certain geographical region. In this paper, considering networks embedded in a two-dimensional plane, we study the problem of finding a critical region - that is, a part of the network that can be enclosed by a given elementary figure (a circle, ellipse, rectangle, square, or equilateral triangle) with a predetermined size - whose removal would lead to the highest network disruption. We determine that there is a polynomial number of non-trivial positions for such a figure that need to be considered and, subsequently, we propose a polynomial-time algorithm for the problem. Simulations on realistic networks illustrate that different figures with equal area result in different critical regions in a network.","geographical failures; critical regions; network robustness; computational geometry","en","conference paper","IEEE","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Intelligent Systems","","","",""
"uuid:8541de17-9875-4182-974a-6666d1a5c697","http://resolver.tudelft.nl/uuid:8541de17-9875-4182-974a-6666d1a5c697","Second-order mean-field susceptible-infected-susceptible epidemic threshold","Cator, E.; Van Mieghem, P.","","2012","","","en","conference paper","American Physical Society","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services (NAS) Group","","","",""
"uuid:5ef03603-9045-4bdf-a1db-4842f2f82def","http://resolver.tudelft.nl/uuid:5ef03603-9045-4bdf-a1db-4842f2f82def","Do greedy assortativity optimization algorithms produce good results?","Winterbach, W.; De Ridder, D.; Wang, H.J.; Reinders, M.; Van Mieghem, P.","","2012","","","en","conference paper","EDP sciences","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services (NAS) Group","","","",""
"uuid:edc5128a-4715-4d31-ab19-1e0b69adbd63","http://resolver.tudelft.nl/uuid:edc5128a-4715-4d31-ab19-1e0b69adbd63","How Much do Your Friends Tell About You?: Reconstructing Private Information from the Friendship Graph","Blenn, N.; Doerr, C.; Shadravan, N.; Van Mieghem, P.","","2012","After the early land rush and fast exponential growth of online social networking platforms, concerns about how data placed in online social networks may be exploited and abused have begun to appear among mainstream users. Social networking sites have responded to these new public sentiments by introducing privacy filters to their site, allowing users to specify which aspects of their profile are visible to whom. In this paper, we demonstrate that such an approach to privacy and informational self-determination is largely futile: as we form social relations and build networks with those alike us, much of who we are and what we do can be reconstructed from unhidden parts of the social graph.","Privacy; OSN; Friendship Graph","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services (NAS) Group","","","",""
"uuid:f14313e2-4ded-4e8d-aac4-b305d4bd050f","http://resolver.tudelft.nl/uuid:f14313e2-4ded-4e8d-aac4-b305d4bd050f","Gossip-based counting in dynamic networks","Van de Bovenkamp, R.; Kuipers, F.; Van Mieghem, P.","","2012","We propose Gossipico, a gossip algorithm to average, sum or find minima and maxima over node values in a large, distributed, and dynamic network. Unlike previous work, Gossipico provides a continuous estimate of, for example, the number of nodes, even when the network becomes disconnected. Gossipico converges quickly due to the introduction of a beacon mechanism that directs messages to an autonomously selected beacon node. The information spread through the network shows a percolation-like phase-transition and allows information to propagate along near-shortest paths. Simulations in various different network topologies (ranging in size up to one million nodes) illustrate Gossipico’s robustness against network changes and display a near-optimal count time. Moreover, in a comparison with other related gossip algorithms, Gossipico displays an improved and more stable performance over various classes of networks.","gossip-algorithms; network dynamics; node counting","en","conference paper","Springer","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services Group (NAS)","","","",""
"uuid:b3041dfa-2075-4d62-914a-4281e2760df5","http://resolver.tudelft.nl/uuid:b3041dfa-2075-4d62-914a-4281e2760df5","Epidemic phase transition of the SIS type in networks","Van Mieghem, P.","","2012","","","en","conference paper","EDP Sciences,","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services (NAS) Group","","","",""
"uuid:866c9b9d-3cd5-4263-989c-d8cf39742f2c","http://resolver.tudelft.nl/uuid:866c9b9d-3cd5-4263-989c-d8cf39742f2c","Optimization of network protection against virus spread","Gourdin, E.; Omic, J.; Van Mieghem, P.","","2011","The effect of virus spreading in a telecommunication network, where a certain curing strategy is deployed, can be captured by epidemic models. In the N-intertwined model proposed and studied in [1], [2], the probability of each node to be infected depends on the curing and infection rate of its neighbors. In this paper, we consider the case where all infection rates are equal and different values of curing rates can be deployed within a given budget, in order to minimize the overall infection of the network. We investigate this difficult optimization together with a related problem where the curing budget must be minimized within a given level of network infection. Some properties of these problems are derived and several solution algorithms are proposed. These algorithms are compared on two real world network instances, while Erdos-Renyi graphs and some special graphs such as the cycle, the star, the wheel and the complete bipartite graph are also addressed.","","en","conference paper","nextgenerationinfrastructures.eu","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services (NAS) Group","","","",""
"uuid:88779372-e79b-46d6-8768-ca31701bc4b7","http://resolver.tudelft.nl/uuid:88779372-e79b-46d6-8768-ca31701bc4b7","Are Friends Overrated?: A Study for the Social Aggregator Digg.com","Doerr, C.; Tang, S.; Blenn, N.; Van Mieghem, P.","","2011","The key feature of online social networks is the ability of users to become active, make friends and interact with those around them. Such interaction is typically perceived as critical to these platforms; therefore, a significant share of research has investigated the characteristics of social links, friendship relations, community structure, searching for the role and importance of individual members. In this paper, we present results from a multi-year study of the online social network Digg.com, indicating that the importance of friends and the friend network in the propagation of information is less than originally perceived. While we note that users form and maintain social structure, the importance of these links and their contribution is very low: Even nearly identically interested friends are only activated with a probability of 2% and only in 50% of stories that became popular we find evidence that the social ties were critical to the spread.","","en","conference paper","Springer-Verlag","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures & Services (NAS)","","","",""
"uuid:184d1254-2bb2-4205-818e-7824de728c59","http://resolver.tudelft.nl/uuid:184d1254-2bb2-4205-818e-7824de728c59","Correlating the topology of a metabolic network with its growth capacity","Winterbach, W.; Wang, H.; Reinders, M.; Van Mieghem, P.; De Ridder, D.","","2010","","","en","conference paper","ICST","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures & Services (NAS)","","","",""
"uuid:a5e4ab47-eed4-4180-b346-da086e826a02","http://resolver.tudelft.nl/uuid:a5e4ab47-eed4-4180-b346-da086e826a02","Metabolic network destruction: Relating topology to robustness","Winterbach, W.; Wang, H.; Reinders, M.; Van Mieghem, P.; De Ridder, D.","","2010","Biological networks exhibit intriguing topological properties such as small-worldness. In this paper, we investigate whether the topology of a metabolic network is related to its robustness. We do so by perturbing a metabolic system in silico, one reaction at a time and studying the correlations between growth, as predicted by flux balance analysis, and a number of topological metrics, as computed from three network representations of the metabolic system. We find that a small number of metrics correlate with growth and that only one of the network representations stands out in terms of correlated metrics. The most correlated metrics point to the importance of hub nodes in this network: so-called ""currency metabolites"". Since they are responsible for interconnecting distant functional modules in the network, they are important points in the networks for predicting if reaction removal affects growth. Source code and data are available upon request.","metabolic networks; ux balance analysis; network topology; robustness","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:e88b5296-34e9-4711-b6de-2bc11e61e3f2","http://resolver.tudelft.nl/uuid:e88b5296-34e9-4711-b6de-2bc11e61e3f2","Pandemics and networks: The case of the Mexican flu","Omic, J.; Van Mieghem, P.","","2010","The recent widespread of the new Mexican flu and SARS show the high dependency on contemporary traveling patterns. The air transport network is recognized as an important channel of epidemic propagation for different diseases. In order to predict epidemic spreading and the influence of protection measures, a mathematical model of the Susceptible - Infected - Susceptible (SIS) type is used. We compare three different networks, namely the air transport network (in the USA and Europe), Erdos- Renyi (ER) graphs and complete bi-partite networks in the light of graph theoretical results based on the N-intertwined model. Using the spreading parameters of the Mexican flu estimated in Mexico City, we determine the necessary speed of countermeasures such that the epidemic is stopped. Restructuring of the air transport in the case of the USA transport network does not improve protection, while in the case of the European transport network the number of infected nodes is reduced for 10%.","pandemics; networks; phase transition; Mexican flu","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services (NAS)","","","",""
"uuid:d3efa41b-855d-4789-b5be-ce842e07212d","http://resolver.tudelft.nl/uuid:d3efa41b-855d-4789-b5be-ce842e07212d","Impairment-aware path selection and regenerator placement in translucent optical networks","Kuipers, F.A.; Beshir, A.A.; Orda, A.; Van Mieghem, P.","","2010","Physical impairments, such as noise and signal distortions, negatively affect the quality of information transfer in optical networks. The effect of physical impairments predominantly augments with distance and bit rate of the signal to the point that it becomes detrimental to the information transfer. To reverse the effect of physical impairments, the signal needs to be regenerated at nodes that have regeneration capabilities. Regenerators are costly and are, therefore, usually only sparsely placed in the network, in which case it is referred to as a translucent network. This paper deals with two problems in translucent networks, namely: (1) how to incorporate impairment awareness in the routing algorithms, and (2) how many regenerators to place inside the network and where. We propose exact and heuristic algorithms for impairment-aware path selection and, through simulations, show that our heuristic T IARA is computationally efficient and performs very close to our exact algorithm EIARA. Subsequently, we propose a greedy algorithm for placing regenerators that, contrary to previous proposals, is suitable for multiple impairment metrics, has polynomial complexity for a single impairment metric, and is cheaper in terms of the number of regenerators needed.","optical signal impairments; regenerator placement; impairment-aware routing; translucent networks","en","conference paper","IEEE","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:9b7984ed-6a61-42d6-8e51-c39e6224234b","http://resolver.tudelft.nl/uuid:9b7984ed-6a61-42d6-8e51-c39e6224234b","Network protection against worms and cascading failures using modularity partitioning","Omic, J.; Hernandez, J.M.; Van Mieghem, P.","","2010","Communication networks are prone to virus and worms spreading and cascading failures. Recently, a number of social networking worms have spread over public Web sites. Another example is error propagation in routing tables, such as in BGP tables. The immunization and error curing applied to these scenarios are not fast enough. There have been studies on the effect of isolating and curing network elements, however, the proposed strategies are limited to node removals. This paper proposes a link isolation strategy based on the quarantining of susceptible clusters in the network. This strategy aims to maximize the epidemic control while minimizing the impact on the clusters performance. We empirically study the influence of clustering on robustness against epidemics in several real-world and artificial networks. Our results show an average curing rate improvement above 50% for the studied real-world networks under analysis.","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures & Services (NAS)","","","",""
"uuid:6bd04fb9-453f-4bce-926b-f1bd79903776","http://resolver.tudelft.nl/uuid:6bd04fb9-453f-4bce-926b-f1bd79903776","Fiedler’s Clustering on m?dimensional Lattice Graphs","Trajanovski, S.; Van Mieghem, P.","","2010","We consider the partitioning of m-dimensional lattice graphs using Fiedler’s approach [1], that requires the determination of the eigenvector belonging to the second smallest eigenvalue of the Laplacian. We examine the general m-dimensional lattice and, in particular, the special cases: the 1-dimensional path graph PN and the 2-dimensional lattice graph. We determine the size of the clusters and the number of links, which are cut by this partitioning as a function of Fiedler’s threshold.","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures & Services (NAS)","","","",""
"uuid:70afa9c3-d3b2-43ec-9bf8-35ceae3fc345","http://resolver.tudelft.nl/uuid:70afa9c3-d3b2-43ec-9bf8-35ceae3fc345","Measurement study of multi-party video conferencing","Lu, Y.; Zhao, Y.; Kuipers, F.A.; Van Mieghem, P.","","2010","More and more free multi-party video conferencing applications are readily available over the Internet and both Server-to-Client (S/C) or Peer-to-Peer (P2P) technologies are used. Investigating their mechanisms, analyzing their system performance, and measuring their quality are important objectives for researchers, developers and end users. In this paper, we take four representative video conferencing applications and reveal their characteristics and different aspects of Quality of Experience. Based on our observations and analysis, we recommend to incorporate the following aspects when designing video conferencing applications: 1) Traffic load control/balancing algorithms to better use the limited bandwidth resources and to have a stable conversation; 2) Use traffic shaping policy or adaptively re-encode streams in real time to limit the overall traffic. This work is, to our knowledge, the first measurement work to study and compare mechanisms and performance of existing free multi-party video conferencing systems.","","en","conference paper","Springer","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:f6c51c6c-bfaf-4eda-98ab-8c32c8cb20f7","http://resolver.tudelft.nl/uuid:f6c51c6c-bfaf-4eda-98ab-8c32c8cb20f7","Self-Organization of Internet Paths","Kleiberg, T.; Van Mieghem, P.","","2009","The Internet consists of a constantly evolving complex hierarchical architecture where routers are grouped into autonomous systems (ASes) that interconnect to provide global connectivity. Routing is generally performed in a decentralized fashion, where each router determines the route to the destination based on the information gathered from neighboring routers. Consequently, the impact of a route update broadcasted by one router may affect many other routers, causing an avalanche of update messages broadcasted throughout the network. In this paper we analyze an extensive dataset with measurements on Internet routes between a set of highly stable testboxes for a period of five years. The measurements provide insight into the coherence between routing events in the Internet and we argue that the routing dynamics exhibit self-organized criticality (SOC). The SOC property provides an explanation for the power-law behavior that we observe in the operational times of routes","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:0f1ff826-f1c9-48fa-b2ec-9a4b2b67a1d1","http://resolver.tudelft.nl/uuid:0f1ff826-f1c9-48fa-b2ec-9a4b2b67a1d1","Heterogenous protection in regular and complete bi-partite networks","Omic, J.S.; Kooij, R.E.; Van Mieghem, P.","","2009","We examine the influence of heterogeneous curing rates for a SIS model, used for malware spreading on the Internet, information dissemination in unreliable networks, and propagation of failures in networks. The topology structures considered are the regular graph which represents the homogenous network structures and the complete bi-partite graph which represents the hierarchical network structures. We find the threshold in a regular graph with m different curing rates. Further, we consider a complete bi-partite graph with 2 curing rates and find the threshold for any distribution of curing rates among nodes. In addition, we consider the optimization problem and show that the minimum sum of the curing rates that satisfies the threshold equation is equal to the number of links in the graph. The optimization problem is simplified by assuming fixed curing rates ?1, ?2 and optimization of the distribution of curing rates among different sets of nodes.","virus spread; epidemic threshold; heterogeneous networks","en","conference paper","Springer","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:bdfed41d-c6bb-441d-a9b9-974a1e3f6c25","http://resolver.tudelft.nl/uuid:bdfed41d-c6bb-441d-a9b9-974a1e3f6c25","Topology dynamics in a P2PTV network","Tang, S.; Lu, Y.; Martín Hernández, J.; Kuipers, F.A.; Van Mieghem, P.","","2009","In recent years, a number of commercial peer-to-peer TV (P2PTV) applications have been launched. Yet, their mechanisms and characteristics are unknown. In this paper, we study SopCast, a typical proprietary P2PTV system. Treating SopCast as a black box, we perform a set of experiments that are suitable to analyze SopCast in depth. We attempt to disclose the SopCast protocol. The dynamic nature of the SopCast overlay, in terms of node degree, is also addressed in this paper. Our approaches in analyzing the SopCast mechanism and characterizing its topological properties reveal important design insights in SopCast, and may help to better understand similar P2PTV systems.","","en","conference paper","springer","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:f2f2f510-b00a-4363-a2ea-0f88554ea63e","http://resolver.tudelft.nl/uuid:f2f2f510-b00a-4363-a2ea-0f88554ea63e","Protecting against network infections: A game theoretic perspective","Omic, J.; Orda, A.; Van Mieghem, P.","","2009","Security breaches and attacks are critical problems in today’s networking. A key-point is that the security of each host depends not only on the protection strategies it chooses to adopt but also on those chosen by other hosts in the network. The spread of Internet worms and viruses is only one example. This class of problems has two aspects. First, it deals with epidemic processes, and as such calls for the employment of epidemic theory. Second, the distributed and autonomous nature of decision-making in major classes of networks (e.g., P2P, adhoc, and most notably the Internet) call for the employment of game theoretical approaches. Accordingly, we propose a unified framework that combines the N-intertwined, SIS epidemic model with a noncooperative game model. We determine the existence of a Nash equilibrium of the respective game and characterize its properties. We show that its quality, in terms of overall network security, largely depends on the underlying topology. We then provide a bound on the level of system inefficiency due to the noncooperative behavior, namely, the “price of anarchy” of the game. We observe that the price of anarchy may be prohibitively high, hence we propose a scheme for steering users towards socially efficient behavior.","","en","conference paper","IEEE","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:ff66e490-db59-4e3c-b6e2-926da4f074df","http://resolver.tudelft.nl/uuid:ff66e490-db59-4e3c-b6e2-926da4f074df","Algebraic Connectivity Optimization via Link Addition","Wang, H.; Van Mieghem, P.","","2008","","algebraic connectivity; synchronization; optimization; link addition","en","conference paper","ICST","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:9426fb39-a92e-41e0-9a82-5075d08a7b35","http://resolver.tudelft.nl/uuid:9426fb39-a92e-41e0-9a82-5075d08a7b35","The Effect of Peer Selection with Hopcount or Delay Constraint on Peer-to-Peer Networking","Tang, S.; Wang, H.; Van Mieghem, P.","","2008","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:8c791107-4c91-4be5-81c7-eef81d107bbb","http://resolver.tudelft.nl/uuid:8c791107-4c91-4be5-81c7-eef81d107bbb","On the Robustness of Complex Networks by Using the Algebraic Connectivity","Jamakovic, A.; Van Mieghem, P.","","2008","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:702a8660-bf4e-4a4c-8286-32cdc17756ca","http://resolver.tudelft.nl/uuid:702a8660-bf4e-4a4c-8286-32cdc17756ca","On the Quality of Experience of SopCast","Fallica, B., Lu, Y.; Kuipers, F.A.; Kooij, R.; Van Mieghem, P.","","2008","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:6f1950b7-bf98-459b-9ff0-fc5419ac3729","http://resolver.tudelft.nl/uuid:6f1950b7-bf98-459b-9ff0-fc5419ac3729","DeSiNe: A flow-level QoS simulator of Networks","Kleiberg, T.; Fu, B.; Kuipers, F.A.; Avallone, S.; Quoitin, B.; Van Mieghem, P.","","2008","","simulation; computer networks; quality-of-service","en","conference paper","ACM","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:f85399d1-3393-4b68-9edb-ead52aea3a0d","http://resolver.tudelft.nl/uuid:f85399d1-3393-4b68-9edb-ead52aea3a0d","E2E blocking probability of IPTV and P2PTV","Lu, Y.; Kuipers, F.A.; Janic, M.; Van Mieghem, P.","","2008","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:a879cf66-598b-4cfb-bd9c-b6abd8474707","http://resolver.tudelft.nl/uuid:a879cf66-598b-4cfb-bd9c-b6abd8474707","To Update Network State or Not?","Fu, B.; Kuipers, F.A.; Van Mieghem, P.","","2008","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:f219628b-8878-453c-b0fe-d016745cbe47","http://resolver.tudelft.nl/uuid:f219628b-8878-453c-b0fe-d016745cbe47","Quantifying the Quality of Service of Streaming Media in Differentiated Services Networks","Agrawal, D.K.; Kleiberg, T.; Papp, S.; Kooij, R.E.; Van Mieghem, P.","","2007","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 evaluation. However, none of them have addressed the basic issue of quantification of QoS for supporting streaming media. The main contribution in this paper is the quantification of the QoS of streaming media in terms of Mean Opinion Score (MOS) values. A test bed has been implemented using off-the-shelf components. The experimental results and MOS values are used to show that in a DiffServ Assured Forwarding network architecture, with class based weighted fair queue scheduling discipline, the QoS of streaming media is not compromised when the load exceeds the reserved capacity, even in case of congestion.","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:a86335f4-36d3-495e-a195-5593271d312a","http://resolver.tudelft.nl/uuid:a86335f4-36d3-495e-a195-5593271d312a","A new type of lower bound for the largest eigenvalue of a symmetric matrix","Van Mieghem, P.","","2007","","largest eigenvalue; symmetrical matrix; spectra of graphs; Lagrange series; perturbation theory","en","conference paper","Elsevier","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services (NAS) Group","","","",""
"uuid:c7dbeaeb-af0a-4bca-9d67-f9a9fd96239c","http://resolver.tudelft.nl/uuid:c7dbeaeb-af0a-4bca-9d67-f9a9fd96239c","The Weight of the Shortest Path Tree","Van der Hofstad, R.; Hooghiemstra, G.; Van Mieghem, P.","","2007","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.","","en","conference paper","Wiley-Blackwell","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services Group","","","",""
"uuid:abb66a4a-4d08-4652-9f16-ae697c85f6cf","http://resolver.tudelft.nl/uuid:abb66a4a-4d08-4652-9f16-ae697c85f6cf","Shifting the Link Weights in Networks","Wang, H.; Van Mieghem, P.","","2007","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:a6a2c297-d7d9-4129-8ec8-19ec31f1d8d2","http://resolver.tudelft.nl/uuid:a6a2c297-d7d9-4129-8ec8-19ec31f1d8d2","Ant Routing in Mobile Ad Hoc Networks","Dhillon, S.S.; Arbona, X.; Van Mieghem, P.","","2007","","","en","conference paper","IEEE Computer Society Press","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:ee8d18fb-b846-4009-baa2-67a65ffc32d3","http://resolver.tudelft.nl/uuid:ee8d18fb-b846-4009-baa2-67a65ffc32d3","A Qualitative Comparison of Power Law Generators","Martin Hernandez, J.; Kleiberg, T.; Wang, H.; Van Mieghem, P.","","2007","","network topology; internet; power law; graphs; algorithms","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:7f7a15ec-f151-4aa9-9e23-a147aa63faf5","http://resolver.tudelft.nl/uuid:7f7a15ec-f151-4aa9-9e23-a147aa63faf5","Searching with Multiple Random Walk Queries","Dhillon, S.S.; Van Mieghem, P.","","2007","","","en","conference paper","IEEE","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:50689b82-502c-49b6-b265-311a592f1642","http://resolver.tudelft.nl/uuid:50689b82-502c-49b6-b265-311a592f1642","Constructing the Overlay Network by Tuning Link Weights","Wang, H.; Van Mieghem, P.","","2007","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:11873b00-2322-4697-9b81-ecab3aee4c5c","http://resolver.tudelft.nl/uuid:11873b00-2322-4697-9b81-ecab3aee4c5c","Quantifying the Quality of Service of Streaming Media in Differentiated Services Networks","Agrawal, D.K.; Kleiberg, T.; Papp, S.; Kooij, R.E.; Van Mieghem, P.","","2007","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:4f609bcb-05fc-4076-93e5-7398d60095ba","http://resolver.tudelft.nl/uuid:4f609bcb-05fc-4076-93e5-7398d60095ba","Virus spread in complete bipartite graphs","Omic, J.S.; Kooij, R.E.; Van Mieghem, P.","","2007","","computer virus; epidemiology; modeling; simulation","en","conference paper","IEEE","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:b0b0a6c5-9ac1-41cb-9531-19cb7679d50a","http://resolver.tudelft.nl/uuid:b0b0a6c5-9ac1-41cb-9531-19cb7679d50a","Comparison of Random Walk Strategies for Ad Hoc Networks","Dhillon, S.S.; Van Mieghem, P.","","2007","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:608547b4-4dcc-497d-a339-bcce34cc176c","http://resolver.tudelft.nl/uuid:608547b4-4dcc-497d-a339-bcce34cc176c","Architectural and QoS Aspects of Personal Networks","Coenen, T.J.M.; Goering, P.T.H.; Jehangir, A.; Van den Berg, J.L.; Boucherie, R.J.; Heemstra de Groot, S.M.; Heijenk, G.J.; Dhillon, S.S.; Lu, W.; Lo, A.; Van Mieghem, P.F.A; Niemegeers, I.G.M.M.","","2006","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 application-driven nature, the co-operation with infrastructure-based networks, and the security hazards. This paper discusses the challenges of security, service discovery and QoS provisioning in designing selforganized PNs and combines them all into an integrated architectural framework.","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:520fe48c-55ff-464b-b66f-891a2c68d102","http://resolver.tudelft.nl/uuid:520fe48c-55ff-464b-b66f-891a2c68d102","Robustness of networks against viruses: The role of the spectral radius","Jamakovic, A.; Kooij, R.E.; Van Mieghem, P.; Van Dam, E.R.","","2006","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:abe61d93-4e25-41ab-90d4-2a55cf2982f5","http://resolver.tudelft.nl/uuid:abe61d93-4e25-41ab-90d4-2a55cf2982f5","The Laplacian Spectrum of Complex Networks","Jamakovic, A.; Van Mieghem, P.","","2006","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:770ba306-4542-4056-b905-01821a8c6597","http://resolver.tudelft.nl/uuid:770ba306-4542-4056-b905-01821a8c6597","Size and Weight of Shortest Path Trees with Exponential Link Weights","Van der Hofstad, R.; Hooghiemstra, G.; Van Mieghem, P.","","2006","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 tree to derive a recursion for the generating function of the number of links of the SPT, and solve this recursion exactly. The explicit form of the generating function allows us to compute the expectation and variance of the size of the subtree for all m. We also obtain exact expressions for the average weight of the subtree.","","en","conference paper","Cambridge University Press","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:357b3fb5-8dfc-4d75-973b-4c1b6dc2d49d","http://resolver.tudelft.nl/uuid:357b3fb5-8dfc-4d75-973b-4c1b6dc2d49d","Topological Characteristics of the Dutch Road Infrastructure","Jamakovic, A.; Wang, H.; Van Mieghem, P.","","2006","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:56fe4372-0d2c-45b8-a6b4-fb86b7dc2d72","http://resolver.tudelft.nl/uuid:56fe4372-0d2c-45b8-a6b4-fb86b7dc2d72","Estimation of Perceived Quality of Service for Applications on IPv6 Network","Zhou, X.; Kooij, R.E.; Uijterwaal, H.; Van Mieghem, P.","","2006","","QoS; Measurement; IPv6","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:8b0eb3f1-2c7f-4f8d-bebc-b578e7b830da","http://resolver.tudelft.nl/uuid:8b0eb3f1-2c7f-4f8d-bebc-b578e7b830da","A comparison of exact and e-approximation algorithms for constrained routing","Kuipers, F.A.; Orda, A.; Raz, D.; Van Mieghem, P.","","2006","","QoS routing; performance evaluation; RSP algorithms","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:ebf33c90-894e-4d31-9206-caf475e7c98c","http://resolver.tudelft.nl/uuid:ebf33c90-894e-4d31-9206-caf475e7c98c","Estimation of Voice over IP Quality in the Netherlands","Zhou, X.; Muller, F.; Kooij, R.E.; Van Mieghem, P.","","2006","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:c42dbb9f-2568-42aa-bf42-c69647d656af","http://resolver.tudelft.nl/uuid:c42dbb9f-2568-42aa-bf42-c69647d656af","Dynamic Routing in QoS-Traffic Engineered Networks","Avallone, S.; Kuipers, F.; Ventre, G.; Van Mieghem, P.","","2006","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:b1392396-9a8d-4159-a2ba-22cfd21a07f3","http://resolver.tudelft.nl/uuid:b1392396-9a8d-4159-a2ba-22cfd21a07f3","Dynamic Routing in QoS-aware Traffic Engineered Network","Avallone, S.; Kuipers, F.A.; Ventre, G.; Van Mieghem, P.","","2005","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 traffic engineering algorithms considering bandwidth as the sole application requirement. We propose a proper length function for an existing QoS routing algorithm (SAMCRA) that attempts to optimize network utilization while still offering QoS guarantees. This paper presents a comparison between several proposed algorithms via simulation studies. The simulations show that SAMCRA with a proper length performs similarly or even better than the best among the other algorithms and it has a fast running time.","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:c5c7ff0e-9bda-428f-a65d-2c8f6b99feb6","http://resolver.tudelft.nl/uuid:c5c7ff0e-9bda-428f-a65d-2c8f6b99feb6","Hopcount in Application Layer Multicast Schemes","Janic, M.; Cempaka Wangi, N.I.; Zhou, X.; Van Mieghem, P.","","2005","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:f73e79dc-c04b-4d87-9304-ca74e0b22a1d","http://resolver.tudelft.nl/uuid:f73e79dc-c04b-4d87-9304-ca74e0b22a1d","Hopcount and E2E Delay: IPv6 Versus IPv4","Zhou, X.; Van Mieghem, P.","","2005","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:1fddd4ae-2d2c-4999-b049-2d4a2988e3f0","http://resolver.tudelft.nl/uuid:1fddd4ae-2d2c-4999-b049-2d4a2988e3f0","Interference Sum with Log-normal Components in Ad-hoc and Sensor Networks","Hekmat, R.; Van Mieghem, P.","","2005","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:44117c1d-3367-408f-9cf7-c227a612dc28","http://resolver.tudelft.nl/uuid:44117c1d-3367-408f-9cf7-c227a612dc28","Dynamic Routing in QoS-Traffic Engineered Networks","Avallone, S.; Kuipers, F.A.; Ventre, G.; Van Mieghem, P.","","2005","","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:2b1acb2a-d4db-40ab-8cb3-d57033a47e57","http://resolver.tudelft.nl/uuid:2b1acb2a-d4db-40ab-8cb3-d57033a47e57","The Stability of Paths in a Dynamic Network","Kuipers, F.A.; Wang, H.; Van Mieghem, P.","","2005","","network dynamics; link-state update policy; shortest path; link weight perturbation; quality of service","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:1566bc5b-2cda-4ed1-a704-f675946ea233","http://resolver.tudelft.nl/uuid:1566bc5b-2cda-4ed1-a704-f675946ea233","Robustness of Large Networks","Van Mieghem, P.","","2005","","link weight; graph; network; shortest path; robustness measures","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","","","","",""
"uuid:1f1df95f-dd13-470f-9cbc-1474778ed878","http://resolver.tudelft.nl/uuid:1f1df95f-dd13-470f-9cbc-1474778ed878","QoS routing: Average complexity and hopcount in m dimensions","Kuipers, F.; Van Mieghem, P.","","2001","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 QoS routing in general. The second part of this paper discusses how routing with multiple independent constraints affects the hopcount distribution. Both the complexity as the hopcount analysis indicate that for a special class of networks, QoS routing exhibits features similar to single-parameter routing.","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:59d9f050-c541-404c-a8b3-97a82003b96c","http://resolver.tudelft.nl/uuid:59d9f050-c541-404c-a8b3-97a82003b96c","Measurements of the hopcount in internet","Begtasevic, F.; Van Mieghem, P.","","2001","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. Fitting the data with our theoretical model illustrates that the number of routers based on our measurements is around 98400. The dynamics in the change of the hopcount is investigated, it was found that though there is virtually no short-term change in the average hopcount the individual hopcounts do change significantly. When investigating the changes in the paths to the sites within these continents, rapid changes in the paths were observed to barely affect the hopcount.","","en","conference paper","","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:523bea7b-e78b-41e1-a200-8533984e0efc","http://resolver.tudelft.nl/uuid:523bea7b-e78b-41e1-a200-8533984e0efc","On-line Survivable Routing in WDM Networks","Beshir, A.A.; Kuipers, F.A.; Van Mieghem, P.; Orda, A.","","","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 constant and logarithmic competitive ratios. It is not possible to obtain good competitive ratios in general topologies. Hence, we propose heuristic schemes and evaluate their performance by way of simulations. The building blocks in these schemes are 2-approximation algorithms (MSA and ESA) that we establish for the minimum disruption link-disjoint paths (MDLDP) problem. These approximations require far less memory and computation time than the best-known exact solution of the MDLDP problem. We use these three algorithms as heuristics for the on-line SRWA problem for infinite and finite duration requests and we show that, in terms of on-line performance, our algorithms do as well as (even at times better than) the exact algorithm of the MDLDP problem. We also provide an exact ILP formulation to solve the infinite duration off-line SRWA problem.","","en","conference paper","International Teletraffic Congress","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:e20b4727-94c3-48b3-bc1e-b20a397f51a7","http://resolver.tudelft.nl/uuid:e20b4727-94c3-48b3-bc1e-b20a397f51a7","On the Quality of Experience of SopCast","Fallica, B.; Lu, Y.; Kuipers, F.A.; Kooij, R.; Van Mieghem, P.","","","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 and the Quality of Experience (QoE) provided by them is not well known. Therefore, investigating their mechanisms, analyzing their performance, and measuring their quality are important for researchers, operators and end users. In this paper, we present results from a measurement study of a P2PTV application called SopCast, using both objective and subjective measurement technologies. The results obtained in our study reveal important design issues of SopCast and the QoE that the end users perceive.","","en","conference paper","IEEE","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:b8a50475-f89b-4fb2-9650-a4efe1a57e83","http://resolver.tudelft.nl/uuid:b8a50475-f89b-4fb2-9650-a4efe1a57e83","Survivable Impairment-aware Traffic Grooming in WDM Rings","Beshir, A.; Fernando Kuipers, F.; Orda, A.; Van Mieghem, P.","","","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 together. In addition, in order to reverse the effect of noise and signal degradations (physical impairments), optical signals need to be regenerated after a certain impairment threshold is reached. We consider survivable impairment-aware traffic grooming in WDM rings, which are among the most widely deployed optical network topologies. We first show that the survivable impairment-aware traffic grooming problem, where the objective is to minimize the total cost of grooming and regeneration, is NP-hard. We then provide approximation algorithms (for uniform traffic), and efficient heuristic algorithms whose performance is shown to be close to the lower-bounds (for non-uniform traffic) both when (1) the impairment threshold can be ignored, and (2) the impairment threshold should be considered.","","en","conference paper","ITCP","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services (NAS) Group","","","",""
"uuid:055f7afd-22bf-4bc5-b841-dddf31b66217","http://resolver.tudelft.nl/uuid:055f7afd-22bf-4bc5-b841-dddf31b66217","Degree and Principal Eigenvectors in Complex Networks","Li, C.; Wang, H.; Van Mieghem, P.","","","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 principal eigenvector corresponding to the largest eigenvalue ? 1. This motivates us to investigate properties of the principal eigenvector x 1 and its relation with the degree vector. (a) We illustrate and explain why the average E[x 1] decreases with the linear degree correlation coefficient ? D in a network with a given degree vector; (b) The difference between the principal eigenvector and the scaled degree vector is proved to be the smallest, when ?1=N2N1 , where N k is the total number walks in the network with k hops; (c) The correlation between the principal eigenvector and the degree vector decreases when the degree correlation ? D is decreased.","networks; spectral radius; principal eigenvector; degree; as-sortativity","en","conference paper","Springer","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services Group (NAS)","","","",""
"uuid:2f4e4dee-0869-4d61-a891-943289cc3894","http://resolver.tudelft.nl/uuid:2f4e4dee-0869-4d61-a891-943289cc3894","Analytical Model for Mesh-based P2PVoD","Lu, Y.; Mol, J.D.D.; Kuipers, F.A.; Van Mieghem, P.","","","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 model to a realistic P2PVoD simulator. With our model, parameters that affect the system performance can be observed, and the system stability can be investigated. Our model leads to design rules for achieving a good and stable system performance. This work is, to our knowledge, the first analytical work to model mesh-based P2PVoD.","","en","conference paper","IEEE","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services","","","",""
"uuid:61624ff0-d637-497a-9bf1-355638b63c7e","http://resolver.tudelft.nl/uuid:61624ff0-d637-497a-9bf1-355638b63c7e","Crawling and Detecting Community Structure in Online Social Networks using Local Information","Blenn, N.; Doerr, C.; Van Kester, B.; Van Mieghem, P.","","","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 based on the nodes (users) ids in the network or crawling the network until one \feels"" a su_cient amount of data has been obtained. In this paper we introduce a new way of directing the crawling procedure to selectively obtain communities of the network. Thus, a researcher is able to obtain those users belonging to the same community and rapidly begin with the evaluation. As all users involved in the same community are crawled _rst, the bias introduced by the time taken to crawl the network and the evolution of the network itself is less. Our presented technique is also detecting communities during runtime. We compare our method called Mutual Friend Crawling (MFC) to the standard methods Breadth First Search (BFS) and Depth First Search (DFS) and di_erent community detection algorithms. The presented re- sults are very promising as our method takes only linear runtime but is detecting equal structures as modularity based community detection algorithms.","social networks; community detection; crawling","en","conference paper","Springer","","","","","","","","Electrical Engineering, Mathematics and Computer Science","Network Architectures and Services Group (NAS)","","","",""