Reliable publish/subscribe middleware for time-sensitive internet-scale applications
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
Weighted spectral distribution for internet topology analysis: theory and applications
IEEE/ACM Transactions on Networking (TON)
Discriminating graphs through spectral projections
Computer Networks: The International Journal of Computer and Telecommunications Networking
Analyzing and modeling router-level internet topology and application to routing control
Computer Communications
| Hi-index | 0.03 |
An increasing number of synthetic topology generators are available, each claiming to produce representative Internet topologies. Every generator has its own parameters, allowing the user to generate topologies with different characteristics. However, there exist no clear guidelines on tuning the value of these parameters in order to obtain a topology with specific characteristics.In this paper we optimize the parameters of several topology generators to match a given Internet topology. The optimization is performed either with respect to the link density, or to the spectrum of the normalized Laplacian matrix. Contrary to approaches in the literature that rely only on the largest eigenvalues, we take into account the set of all eigenvalues. However, we show that on their own the eigenvalues cannot be used to construct a metric for optimizing parameters. Instead we present a weighted spectral method which simultaneously takes into account all the properties of the graph.