• DocumentCode
    2129729
  • Title

    Unifying Unknown Nodes in the Internet Graph Using Semisupervised Spectral Clustering

  • Author

    Almog, Anat ; Goldberger, Jacob ; Shavitt, Yuval

  • Author_Institution
    Sch. of Electr. Eng., Tel-Aviv Univ., Tel-Aviv
  • fYear
    2008
  • fDate
    15-19 Dec. 2008
  • Firstpage
    174
  • Lastpage
    183
  • Abstract
    Most research on Internet topology is based on active measurement methods. A major difficulty in using these tools is that one comes across many unresponsive routers. Different methods of dealing with these anonymous nodes to preserve the connectivity of the real graph have been suggested. One of the more practical approaches involves using a placeholder for each unknown, resulting in multiple copies of every such node. This significantly distorts and inflates the inferred topology. Our goal in this work is to unify groups of placeholders in the IP-level graph. We introduce a novel clustering algorithm based on semisupervised spectral embedding of all the nodes followed by clustering of the anonymous nodes in the projected space. Experimental results on real internet data are provided, that show good similarity to the true networks.
  • Keywords
    IP networks; Internet; graph theory; telecommunication network topology; IP-level graph; Internet graph; Internet topology; active measurement methods; semisupervised spectral clustering; unifying unknown nodes; unresponsive routers; Clustering algorithms; Conferences; Data mining; Delay effects; IP networks; Internet; Jacobian matrices; Probes; Time measurement; Topology; anonymous nodes; internet maps; semisupervised spectral clustering;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Mining Workshops, 2008. ICDMW '08. IEEE International Conference on
  • Conference_Location
    Pisa
  • Print_ISBN
    978-0-7695-3503-6
  • Electronic_ISBN
    978-0-7695-3503-6
  • Type

    conf

  • DOI
    10.1109/ICDMW.2008.12
  • Filename
    4733935