Mingda Li
ABSTRACT
We present DIP, a deep learning based framework to learn structural properties of the Internet, such as node clustering or distance between nodes. Existing embedding-based approaches use linear algorithms on a single source of data, such as latency or hop count information, to approximate the position of a node in the Internet. In contrast, DIP computes low-dimensional representations of nodes that preserve structural properties and non-linear relationships across multiple, heterogeneous sources of structural information, such as IP, routing, and distance information. Using a large real-world data set, we show that DIP learns representations that preserve the real-world clustering of the associated nodes and predicts distance between them more than 30% better than a mean-based approach. Furthermore, DIP accurately imputes hop count distance to unknown hosts (i.e., not used in training) given only their IP addresses and routable prefixes. Our framework is extensible to new data sources and applicable to a wide range of problems in network monitoring and security.
- Ark {n. d.}. Ark IPv4 Routed Topology Dataset. http://www.caida.org/data/active/ipv4_routed_24_topology_dataset.xml. ({n. d.}).Google Scholar
- Lorenzo Bruzzone and D Fernandez Prieto. 1999. An incremental-learning neural network for the classification of remote-sensing images. Pattern Recognition Letters (1999). Google ScholarDigital Library
- Manuel Costa, Miguel Castro, Antony Rowstron, and Peter Key. 2004. PIC: Practical Internet Coordinates for Distance Estimation. In ICDCS. Google ScholarDigital Library
- Frank Dabek, Russ Cox, Frans Kaashoek, and Robert Morris. 2004. Vivaldi: a decentralized network coordinate system. In SIGCOMM. Google ScholarDigital Library
- Dumitru Erhan, Yoshua Bengio, Aaron Courville, Pierre-Antoine Manzagol, Pascal Vincent, and Samy Bengio. 2010. Why does unsupervised pre-training help deep learning? Journal of Machine Learning Research (2010). Google ScholarDigital Library
- Brian Eriksson, Paul Barford, and Robert Nowak. 2008. Network Discovery from Passive Measurements. In ACM Sigcomm. Google ScholarDigital Library
- Brian Eriksson, Paul Barford, and Robert Nowak. 2009. Estimating Hop Distance Between Arbitrary Host Pairs. In IEEE Infocom.Google Scholar
- Brian Eriksson, Paul Barford, Robert Nowak, and Mark Crovella. 2007. Learning Network Structure from Passive Measurements. In IMC. Google ScholarDigital Library
- Nick Feamster and Jennifer Rexford. 2017. Why (and How) Networks Should Run Themselves. arXiv preprint arXiv:1710.11583 (2017).Google Scholar
- Cheng Jin, Haining Wang, and Kang G. Shin. 2003. Hop-count filtering: An effective defense against spoofed DDoS traffic. In CCS. Google ScholarDigital Library
- Andrej Karpathy and Li Fei-Fei. 2015. Deep visual-semantic alignments for generating image descriptions. In CVPR.Google Scholar
- Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014).Google Scholar
- Yann LeCun, Yoshua Bengio, and Geoffrey Hinton. 2015. Deep learning. nature (2015).Google Scholar
- K. Levchenko, A. Dhamdhere, B. Huffaker, k. claffy, M. Allman, and V. Paxson. 2017. PacketLab: A Universal Measurement Endpoint Interface. In Internet Measurement Conference (IMC). Google ScholarDigital Library
- Rui Miao, Hongyi Zeng, Changhoon Kim, Jeongkeun Lee, and Minlan Yu. 2017. SilkRoad: Making Stateful Layer-4 Load Balancing Fast and Cheap Using Switching ASICs. In ACM Sigcomm. Google ScholarDigital Library
- Tomáš Mikolov, Martin Karafiát, Lukáš Burget, Jan Černocky, and Sanjeev Khudanpur. 2010. Recurrent neural network based language model. In Interspeech.Google Scholar
- Tomas Mikolov, Quoc V Le, and Ilya Sutskever. 2013. Exploiting similarities among languages for machine translation. arXiv preprint arXiv:1309.4168 (2013).Google Scholar
- T. S. Eugene Ng and Hui Zhang. 2002. Predicting Internet Network Distance with Coordinates-Based Approaches. In INFOCOM.Google Scholar
- Pyxida {n. d.}. Pyxida. http://pyxida.sourceforge.net/. ({n. d.}).Google Scholar
- RouteViews. {n. d.}. http://www.routeviews.org. ({n. d.}).Google Scholar
- Neil Spring, Ratul Mahajan, and Thomas Anderson. 2003. Quantifying the Causes of Path Inflation. In ACM Sigcomm. Google ScholarDigital Library
- Daixin Wang, Peng Cui, and Wenwu Zhu. 2016. Structural Deep Network Embedding. In KDD. Google ScholarDigital Library
- Liwei Wang, Yin Li, Jing Huang, and Svetlana Lazebnik. 2018. Learning two-branch neural networks for image-text matching tasks. IEEE Transactions on Pattern Analysis and Machine Intelligence (2018).Google Scholar
- Xiaohan Zhao, Alessandra Sala, Haitao Zheng, and Ben Y Zhao. 2011. Efficient shortest paths on massive social graphs. In CollaborateCom.Google Scholar
Index Terms
- Deep Learning IP Network Representations
Recommendations
Learning IP network representations
We present DIP, a deep learning based framework to learn structural properties of the Internet, such as node clustering or distance between nodes. Existing embedding-based approaches use linear algorithms on a single source of data, such as latency or ...
UW-GRE: Underwater Greedy Geographic Routing by Network Embedding
AbstractThis paper presents the novel routing protocol called Underwater Greedy Geographic Routing by Network Embedding (UW-GRE) for underwater wireless networks. Geographic routing is a promising network routing protocol strategy for wireless ...
Deep Inductive Network Representation Learning
WWW '18: Companion Proceedings of the The Web Conference 2018This paper presents a general inductive graph representation learning framework called DeepGL for learning deep node and edge features that generalize across-networks. In particular, DeepGL begins by deriving a set of base features from the graph (e.g., ...
Comments