Weighted spectral distribution for internet topology analysis: theory and applications

D Fay, H Haddadi, A Thomason… - IEEE/ACM …, 2009 - ieeexplore.ieee.org
Comparing graphs to determine the level of underlying structural similarity between them is
a widely encountered problem in computer science. It is particularly relevant to the study of …

Cooperative caching through routing control in information-centric networks

S Saha, A Lukyanenko… - 2013 Proceedings IEEE …, 2013 - ieeexplore.ieee.org
Information-centric network (ICN), which is one of the prominent Internet re-design
architectures, relies on in-network caching for its fundamental operation. However, previous …

Reliable publish/subscribe middleware for time-sensitive internet-scale applications

C Esposito, D Cotroneo, A Gokhale - Proceedings of the third ACM …, 2009 - dl.acm.org
Federating mission critical systems over wide-area networks still represents a challenging
issue. For example, it is hard to assure both reliability and timeliness in a hostile …

Graph sampling for Internet topologies using normalized Laplacian spectral features

B Jiao, J Shi, W Zhang, L **ng - Information Sciences, 2019 - Elsevier
A crucial task in the process of constructing Internet testbeds is to substantially reduce the
number of nodes in the interdomain Internet topology, while maintaining its essential …

Efficient cache availability management in information-centric networks

S Saha, A Lukyanenko, A Ylä-Jääski - Computer Networks, 2015 - Elsevier
In-network caching is one of the fundamental operations of Information-Centric Networks
(ICN). The default caching strategy taken by most of the current ICN proposals is caching …

An exploration of fetish social networks and communities

D Fay, H Haddadi, MC Seto, H Wang… - Advances in Network …, 2016 - Springer
Abstract Online Social Networks (OSNs) provide a venue for virtual interactions and
relationships between individuals. In some communities, OSNs also facilitate arranging …

Graph perturbations and corresponding spectral changes in Internet topologies

B Jiao, J Shi - Computer Communications, 2016 - Elsevier
The normalized Laplacian spectrum (NLS) is a powerful tool for comparing graphs with
different sizes. Recently, we showed that two NLS features, namely the weighted spectral …

Experimental validation of resilient tree-based greedy geometric routing

S Sahhaf, W Tavernier, D Colle, M Pickavet… - Computer Networks, 2015 - Elsevier
Geometric routing is an alternative for IP routing based on longest prefix matching. Using
this routing paradigm, every node in the network is assigned a coordinate and packets are …

Accurately and quickly calculating the weighted spectral distribution

B Jiao, Y Nie, J Shi, G Lu, Y Zhou, J Du - Telecommunication Systems, 2016 - Springer
The weighted spectral distribution (WSD) is a measure defined on the normalized Laplacian
spectrum. It can be used for comparing complex networks with different sizes (number of …

On the importance of local connectivity for Internet topology models

H Haddadi, D Fay, A Jamakovic… - 2009 21st …, 2009 - ieeexplore.ieee.org
Existing models for Internet Autonomous System (AS) topology generation make structural
assumptions about the AS graph. Those assumptions typically stem from beliefs about the …