Luigi Laura
Giuseppe F. Italiano
ABSTRACT
Network clustering is traditionally approached just relying on the topology of the network, and neglecting the information on the traffic intensity between the nodes. In this paper we propose traffic-aware clustering, whereby networks are clustered on the basis of their traffic matrices. We redefine two clustering metrics for the context of traffic matrices, and perform an exploratory analysis by comparing four well known algorithms against two real-world datasets, each made of 1000 traffic matrices, respectively from Abilene and Géant networks. The Spectral Filtering algorithm appears as the best performer. However, in the Géant network dataset the two metrics provide different rankings for the algorithms under examination, and Newman's algorithm can perform marginally better under one of the two metrics.
- U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikoloski, and D. Wagner. On modularity clustering. IEEE Trans. Knowl. Data Eng., 20(2):172--188, 2008. Google Scholar
Digital Library
- S. V. Dongen. A Cluster Algorithm for Graphs. TR INS-R0010, CWI, National Research Institute for Mathematics and Computer Science, 2000. Google ScholarDigital Library
- P. Drineas, A. M. Frieze, R. Kannan, S. Vempala, and V. Vinay. Clustering Large Graphs via the Singular Value Decomposition. Machine Learning, 56(1--3):9--33, 2004. Google ScholarDigital Library
- J. Duch and A. Arenas. Community detection in complex networks using extremal optimization. Physical Review E, 72(2):027104+, Aug 2005.Google Scholar
- M. Gaertler. Clustering. In U. Brandes and T. Erlebach, editors, Network Analysis, LNCS, vol. 3418, Springer, 2004.Google Scholar
- C. Gkantsidis, M. Mihail, and E. W. Zegura. Spectral analysis of internet topologies. In Proc. of INFOCOM 2003Google Scholar
- J. Hartigan. Clustering algorithms. Wiley, 1975. Google ScholarDigital Library
- A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Computing Surveys, 31(3):264--323, 1999. Google ScholarDigital Library
- Y. Li, J. Cui, D. Maggiorini, and M. Faloutsos. Characterizing and Modelling Clustering Features in AS-Level Internet Topology. In Proc. of INFOCOM 2008.Google ScholarCross Ref
- M. Naldi and A. Miani. Traffic matrix-based spectral decomposition of networks. In Proc. of FITraMEn 08.Google Scholar
- M. E. J. Newman. Analysis of weighted networks, 2004.Google Scholar
- M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69(2), 2004.Google ScholarCross Ref
- L. Ramaswamy, B. Gedik, and L. Liu. A distributed approach to node clustering in decentralized peer-to-peer networks. IEEE Transactions on Parallel and Distributed Systems, 16(9):814--829, 2005. Google ScholarDigital Library
- R. Teixeira, N. Duffield, J. Rexford, and M. Roughan. Traffic matrix reloaded: Impact of routing changes. In Passive and Active Network Measurement, 6th International Workshop, 2005. Google ScholarDigital Library
- S. Uhlig, B. Quoitin, J. Lepropre, and S. Balon. Providing public intradomain traffic matrices to the research community. SIGCOMM Comput. Commun. Rev., 36(1):83--86, 2006. Google ScholarDigital Library
Index Terms
- Traffic-based network clustering
Recommendations
Quality-of-service class specific traffic matrices in ip/mpls networks
IMC '07: Proceedings of the 7th ACM SIGCOMM conference on Internet measurementIn this paper we consider the problem of determining traffic matrices for end-to-end demands in an IP/MPLS network that supports multiple quality of service (QoS) classes. More precisely, we want to determine the set of traffic matrices Ti for each QoS ...
An Entropy Based Algorithm to Find Critical Traffic Matrices
ICN '08: Proceedings of the Seventh International Conference on NetworkingThe entropy is a measure of diversity and homogeneity of one microstate in thermodynamic, which reflects the probably distribution of one microstate of the system. A traffic matrix has tremendous potential utility for many IP network engineering ...
Clustering stability-based Evolutionary K-Means
Evolutionary K-Means (EKM), which combines K-Means and genetic algorithm, solves K-Means' initiation problem by selecting parameters automatically through the evolution of partitions. Currently, EKM algorithms usually choose silhouette index as cluster ...
Comments