Incremental deployment of network monitors based on Group Betweenness Centrality

Information Processing Letters

Volumn 109, Issue 20, 2009, Pages 1172-1176

  Dolev, Shlomi ^a   Elovici, Yuval ^a   Puzis, Rami ^a   Zilberman, Polina ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Distributed systems; Graph algorithms; Group Betweenness; Interconnection networks; Network centrality

Indexed keywords

BETWEENNESS CENTRALITY; CANDIDATE LOCATIONS; DISTRIBUTED MONITORING SYSTEMS; DISTRIBUTED SYSTEMS; EVOLVING NETWORKS; GRAPH ALGORITHMS; GROUP BETWEENNESS; INCREMENTAL DEPLOYMENT; INFORMATION FLOWS; NETWORK CENTRALITY; NETWORK MONITORS;

INTERCONNECTION NETWORKS;

LOCATION;

EID: 69949106671     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2009.07.019     Document Type: Article

References (12)

1. Suh K., Guoy Y., Kurose J., and Towsley D. Locating network monitors: complexity, heuristics, and coverage. Computer Communications 29 (2006) 1564-1577
2. Chaudet C., Fleury E., Guerin Lassous I., Rivano H., and Voge M.-E. Optimal positioning of active and passive monitoring devices. CoNEXT '05 (2005), ACM 71-82
3. Puzis R., Elovici Y., and Dolev S. Fast algorithm for successive group betweenness centrality computation. Phys. Rev. E 76 (2007) 056709
4. Everett M.G., and Borgatti S.P. The centrality of groups and classes. Mathematical Sociology 23 3 (1999) 181-201
5. Freeman L.C. A set of measures of centrality based upon betweenness. Sociometry 40 (1977) 35-41
6. J. M. Anthonisse, The rush in a directed graph, Tech. Rep. BN 9/71, Stichting Mathematisch Centrum, Amsterdam, 1971
7. A. Medina, N. Taft, S. Battacharya, C. Diot, K. Salamatian, Traffic matrix estimation: Existing techniques compared and new directions, in: SIGCOMM, Pittsburgh, 2002
8. Puzis R., Elovici Y., and Dolev S. Finding the most prominent group in complex networks. AI Communications 20 4 (2007) 287-296
9. Holme P. Congestion and centrality in traffic flow on complex networks. Advances in Complex Systems 6 (2003) 163
10. Brandes U. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 25 2 (2001) 163-177
11. Feige U. A threshold of ln n for approximating set cover. Journal of the ACM 45 4 (1998) 634-652
12. Barabási A.-L., and Albert R. Emergence of scaling in random networks. Science 286 (1999) 509-512