skip to main content
10.1145/2184512.2184515acmconferencesArticle/Chapter ViewAbstractPublication Pagesacm-seConference Proceedingsconference-collections
research-article

MINA: an algorithm for detecting the presence of extrinsic network nodes using a message induced graph

Published:29 March 2012Publication History

ABSTRACT

Connecting geographically dispersed sites by layer two virtual private networks is a widely deployed, cost effective, and reliable technology. The key feature of layer two virtual private networks is confidentiality. However, L2 VPNs are being rapidly replaced by layer three virtual networks as common carriers expand the roles of their shared IP networks. The recent increase of interest in L3 virtual networks has led to renewed interest and new questions concerning their privacy.

We designate virtual network nodes that are undesirable as extrinsic. In this paper we propose a novel algorithm, Message Induced Network Appraisal (MINA), for detecting the presence of extrinsic nodes in virtual networks. MINA is inspired by Kleinberg's HITS algorithm for ranking web pages. The generalization of a HITS derived algorithm to detecting the presence of extrinsic nodes in virtual networks is novel.

Our MINA algorithm constructs the communication graph induced by message exchange, scores the participating nodes to identify mutual nodes, and detects the presence of extrinsic nodes. Using the MINA algorithm, network users are presented with a useful indicator about the confidentiality of their L3 virtual network. In this paper we describe MINA and demonstrate that our method reliably detects the presence of extrinsic nodes in L3 virtual networks.

References

  1. R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Rev. Mod. Phys., 74(1):47--97, Jan 2002.Google ScholarGoogle ScholarCross RefCross Ref
  2. American National Standards Institute. Telecommunications Integrated Services Digital Network (ISDN) - Core Aspects of Frame Protocol for use with Frame Relay Bearer Service, September 1991.Google ScholarGoogle Scholar
  3. D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris. Resilient Overlay Networks. SIGOPS Oper. Syst. Rev., 35(5):131--145, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. A. L. Barabási and R. Albert. Emergence of Scaling in Random Networks. Science, 286(5439):509--512, 1999.Google ScholarGoogle Scholar
  5. A.-L. Barabási, R. Albert, and H. Jeong. Mean-field theory for scale-free random networks. Physica A: Statistical Mechanics and its Applications, 272(1-2):173--187, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  6. M. Bastian, S. Heymann, and M. Jacomy. Gephi: An Open Source Software for Exploring and Manipulating Networks. In International AAAI Conference on Weblogs and Social Media, 2009.Google ScholarGoogle Scholar
  7. M. H. Behringer and M. J. Morrow. MPLS VPN Security. Cisco Press, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. L. Danon, A. Díaz-Guilera, J. Duch, and A. Arenas. Comparing community structure identification. Journal of Statistical Mechanics: Theory and Experiment, 2005(09):P09008, 2005.Google ScholarGoogle ScholarCross RefCross Ref
  9. D. Easley and J. Kleinberg. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. L. Fang. Draft IETF MPLS and GMPLS Security Framework 05. Internet Draft (Informational), March 2009. Expires September 8, 2009.Google ScholarGoogle Scholar
  11. S. Fortunato. Community detection in graphs. Physics Reports, 2010(486):75--174, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  12. C. S. Inc. Security of the MPLS Architecture, February 2006.Google ScholarGoogle Scholar
  13. J. A. Jerkins. Detecting the Presence of Undesirable Nodes in Layer 3 Virtual Networks. In 53rd Annual ACM Mid-Southeast Conference, October 2011.Google ScholarGoogle Scholar
  14. J. A. Jerkins. Virtual network community detection with a message induced graph. Journal of Computing Sciences in Colleges, 27(5), 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell system technical journal, 49(1):291--307, 1970.Google ScholarGoogle Scholar
  16. B. G. Kim and P. Wang. ATM network: goals and challenges. Commun. ACM, 38:39--44, February 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. J. ACM, 46:604--632, September 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. C. D. Manning, P. Raghavan, and H. Schütze. Introduction to Information Retrieval. Cambridge University Press, New York, NY, USA, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. M. McPherson, L. Smith-Lovin, and J. M. Cook. Birds of a Feather: Homophily in Social Networks. Annual Review of Sociology, 27(1):415--444, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  20. D. Mende and E. Ray. All your packets are belong to us - Attacking backbone technologies. SchmooCon 2009, February 2009.Google ScholarGoogle Scholar
  21. Miercomm Report. Cisco MPLS Based VPNS: Equivalent to the security of Frame Relay and ATM, 2001.Google ScholarGoogle Scholar
  22. M. E. J. Newman. The Structure and Function of Complex Networks. SIAM Review, 45(2):167--256, 2003.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69(2), February 2004.Google ScholarGoogle ScholarCross RefCross Ref
  24. L. Peterson and B. Davie. Computer networks: a systems approach. The Morgan Kaufmann series in networking. Morgan Kaufmann Publishers, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. P. B. Slater. Establishing clustering procedures for network analysis. arXiv.0806.4168, 2008.Google ScholarGoogle Scholar
  26. S. H. Strogatz. Exploring complex networks. Nature, 410(6825):268--276, March 2001.Google ScholarGoogle ScholarCross RefCross Ref
  27. S. Wasserman and K. Faust. Social Network Analysis. Cambridge University Press, 1994.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. MINA: an algorithm for detecting the presence of extrinsic network nodes using a message induced graph

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        ACM-SE '12: Proceedings of the 50th Annual Southeast Regional Conference
        March 2012
        424 pages
        ISBN:9781450312035
        DOI:10.1145/2184512

        Copyright © 2012 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 29 March 2012

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate134of240submissions,56%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader