BridgeFinder: Finding communication bottlenecks in distributed environments

International Conference on Information Networking 2011, ICOIN 2011

Volumn , Issue , 2011, Pages 1-6

  Bradler, Dirk ^a   Krumov, Lachezar ^a   Mühlhäuser, Max ^a   Kangasharju, Jussi ^b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Computer network reliability; Distributed control; Mobile communication; Robustness

Indexed keywords

COMPUTER NETWORK RELIABILITY; DENSE CLUSTERS; DISTRIBUTED ALGORITHM; DISTRIBUTED CONTROL; DISTRIBUTED ENVIRONMENTS; GOSSIPING PROTOCOLS; MOBILE COMMUNICATION; MOBILE NETWORKS; NETWORK OPERATIONS; ROBUSTNESS;

INTERNET; MOBILE TELECOMMUNICATION SYSTEMS; ROBUSTNESS (CONTROL SYSTEMS);

DISTRIBUTED COMPUTER SYSTEMS;

EID: 79952919160     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICOIN.2011.5723104     Document Type: Conference Paper

References (18)

1. th Annual IEEE Symposium on Foundations of Computer Science, pp. 482-491, 2003.
2. D. Bradler, L. Krumov, E. Aitenbichler, and J. Kangasharju, "Finding communication bottlenecks in distributed environments," tech. rep., TU Darmstadt, March 2010.
3. M. Sheng, J. Li, and Y. Shi, "Critical Nodes Detection in Mobile Ad Hoc Network," Advanced Information Networking and Applications, vol. 2, pp. 336-340, 2006.
4. X. Liu, L. Xiao, A. Kreling, and Y. Liu, "Optimizing Overlay Topology by Reducing Cut Vertices," in Proc. of the 2006 Intl. Workshop on Network and Operating Systems Support for Digital Audio and Video, (Newport, Rhode Island), pp. 1-6, ACM, 2006.
5. th International Parallel and Distributed Processing Symposium, 2004.
6. L. C. Freeman, "A Set of Measures of Centrality Based on Betweenness," Sociometry, vol. 40, pp. 35-41, March 1977.
7. U. Brandes, "A Faster Algorithm for Betweenness Centrality," Journal of Mathematical Sociology, vol. 25, pp. 163-177, 2001.
8. G. Sabidussi, "The Centrality Index of a Graph," Psychometrika, vol. 31, pp. 581-603, 1966.
9. C. Dangalchev, "Residual Closeness in Networks," Phisica A, vol. 365, pp. 556-564, 2006.
10. F. Kuhn, T. Moscibroda, and R. Wattenhofer, "Unit Disk Graph Approximation," Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing, pp. 17-23, 2004.
11. A. Jardosh, E. Belding-Royer, K. Almeroth, and S. Suri, "Towards realistic mobility models for mobile ad hoc networks," in Proceedings of the 9th annual international conference on Mobile computing and networking, pp. 217-229, ACM New York, NY, USA, 2003.
12. W. W. Terpstra, C. Leng, and A. P. Buchmann, "Brief Announcement: Practical Summation via Gossip," in PODC, PODC, 2007.
13. D. Kempe, J. Kleinberg, and A. Demers, "Spatial Gossip and Resource Location Protocols," Journal of the ACM (JACM), vol. 51, no. 6, pp. 943-967, 2004.
14. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry, "Epidemic Algorithms for Replicated Database Maintenance," Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pp. 1-12, 1987.
15. W. W. Terpstra, J. Kangasharju, C. Leng, and A. P. Buchmann, "Bubblestorm: Resilient, Probabilistic, and Exhaustive Peer-to-Peer Search," SIGCOMM, 2007.
16. P. T. Eugster, R. Guerraoui, A. M. Kermarrec, and L. Massoulie, "From Epidemics to Distributed Computing," IEEE Computer, vol. 37, no. 5, pp. 60-67, 2004.
17. S. Saroiu, K. Gummadi, and S. Gribble, "Measuring and Analyzing the Characteristics of Napster and Gnutella Hosts," Multimedia Systems, vol. 9, no. 2, pp. 170-184, 2003.
18. T. Qiu, E. Chan, and G. Chen, "Overlay Partition: Iterative Detection and Proactive Recovery," in IEEE International Conference on Communications 2007 (ICC'07), pp. 1854-1859, 2007.