{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T05:31:09Z","timestamp":1684733469813},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,4,23]],"date-time":"2014-04-23T00:00:00Z","timestamp":1398211200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s00446-014-0217-4","type":"journal-article","created":{"date-parts":[[2014,4,22]],"date-time":"2014-04-22T12:43:19Z","timestamp":1398170599000},"page":"91-109","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Adversarial topology discovery in network virtualization environments: a threat for ISPs?"],"prefix":"10.1007","volume":"28","author":[{"given":"Yvonne Anne","family":"Pignolet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Tredan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,23]]},"reference":[{"key":"217_CR1","doi-asserted-by":"crossref","unstructured":"Acharya, H., Gouda, M.: On the hardness of topology inference. In: Proceedings of ICDCN, pp. 251\u2013262 (2011)","DOI":"10.1007\/978-3-642-17679-1_22"},{"key":"217_CR2","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., Clauset, A., Kempe, D., Moore, C.: On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. In: Proceedings of 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 694\u2013703 (2005)","DOI":"10.1145\/1060590.1060693"},{"issue":"2","key":"217_CR3","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1137\/080729256","volume":"40","author":"C Amb\u00fchl","year":"2011","unstructured":"Amb\u00fchl, C., Mastrolilli, M., Svensson, O.: Inapproximability results for maximum edge biclique, minimum linear arrangement, and sparsest cut. SIAM J. Comput. 40(2), 567\u2013596 (2011)","journal-title":"SIAM J. Comput."},{"key":"217_CR4","doi-asserted-by":"crossref","unstructured":"Anandkumar, A., Hassidim, A., Kelner, J.: Topology discovery of sparse random graphs with few participants. In: Proceedings of SIGMETRICS (2011)","DOI":"10.1145\/1993744.1993774"},{"key":"217_CR5","doi-asserted-by":"crossref","unstructured":"Bansal, N., Lee, K.-W., Nagarajan, V., Zafer, M.: Minimum congestion mapping in a cloud. In: Proceedings of 30th PODC, pp. 267\u2013276 (2011)","DOI":"10.1145\/1993806.1993854"},{"key":"217_CR6","unstructured":"Caucal, D.: Deterministic graph grammars. In: Logic and Automata, pp. 169\u2013250 (2008)"},{"key":"217_CR7","unstructured":"Cheswick, B., Burch, H., Branigan, S.: Mapping and visualizing the internet. In: Proceedings of USENIX Annual Technical Conference (ATEC) (2000)"},{"key":"217_CR8","doi-asserted-by":"crossref","unstructured":"Chowdhury, N.M.M.K., Boutaba, R.: A survey of network virtualization. Comput. Netw. 54(5), 862\u2013876 (2010). doi: 10.1016\/j.comnet.2009.10.017","DOI":"10.1016\/j.comnet.2009.10.017"},{"key":"217_CR9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"DJ Cook","year":"1994","unstructured":"Cook, D.J., Holder, L.B.: Substructure discovery using minimum description length and background knowledge. J. Artif. Intell. Res. 1, 231\u2013255 (1994)","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"217_CR10","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. 34(3), 313\u2013356 (2002)","journal-title":"ACM Comput. Surv."},{"key":"217_CR11","doi-asserted-by":"crossref","unstructured":"Even, G., Medina, M., Schaffrath, G., Schmid, S.: Competitive and deterministic embeddings of virtual networks. In: Proceedings of ICDCN (2012)","DOI":"10.1007\/978-3-642-25959-3_8"},{"key":"217_CR12","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: Proceedings of SIGCOMM, pp. 251\u2013262 (1999)","DOI":"10.1145\/316188.316229"},{"key":"217_CR13","doi-asserted-by":"crossref","unstructured":"Fan, J., Ammar, M.H.: Dynamic topology configuration in service overlay networks: a study of reconfiguration policies. In: Proceedings of IEEE INFOCOM (2006)","DOI":"10.1109\/INFOCOM.2006.139"},{"key":"217_CR14","doi-asserted-by":"crossref","unstructured":"Fuerst, C., Schmid, S., Feldmann, A.: Virtual network embedding with collocation: benefits and limitations of pre-clustering. In: Proceedings of 2nd IEEE International Conference on Cloud Networking (CLOUDNET) (2013)","DOI":"10.1109\/CloudNet.2013.6710562"},{"key":"217_CR15","unstructured":"Haider, A., Potter, R., Nakao, A.: Challenges in resource allocation in network virtualization. In: Proceedings of ITC Specialist Seminar on Network Virtualization (2009)"},{"key":"217_CR16","doi-asserted-by":"crossref","unstructured":"Houidi, I., Louati, W., Zeghlache, D.: A distributed virtual network mapping algorithm. In: Proceedings of IEEE ICC (2008)","DOI":"10.1109\/ICC.2008.1056"},{"key":"217_CR17","unstructured":"Lakhina, A., Byers, J., Crovella, M., Xie, P.: Sampling biases in ip topology measurements. In: Proceedings of IEEE INFOCOM (2003)"},{"key":"217_CR18","doi-asserted-by":"crossref","unstructured":"Lischka, J., Karl, H.: A virtual network mapping algorithm based on subgraph isomorphism detection. In: Proceedings of ACM SIGCOMM VISA (2009)","DOI":"10.1145\/1592648.1592662"},{"key":"217_CR19","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/1355734.1355746","volume":"38","author":"N McKeown","year":"2008","unstructured":"McKeown, N., Anderson, T., Balakrishnan, H., Parulkar, G., Peterson, L., Rexford, J., Shenker, S., Turner, J.: Openflow: enabling innovation in campus networks. SIGCOMM Comput. Commun. Rev. 38, 69\u201374 (2008)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"217_CR20","doi-asserted-by":"crossref","unstructured":"Pignolet, Y.A., Schmid, S., Tredan, G.: Brief announcement: Do vnet embeddings reveal isp topology? In: Proceedings of 26th International Symposium on Distributed Computing (DISC) (2012)","DOI":"10.1007\/978-3-642-33651-5_42"},{"key":"217_CR21","doi-asserted-by":"crossref","unstructured":"Pignolet, Y.-A., Schmid, S., Tredan, G.: Adversarial VNet embeddings: a threat for ISPs? In: IEEE INFOCOM (2013)","DOI":"10.1109\/INFCOM.2013.6566806"},{"key":"217_CR22","doi-asserted-by":"crossref","unstructured":"Pignolet, Y.A., Schmid, S., Tredan, G.: Request complexity of vnet topology extraction: dictionary-based attacks. In: International Conference on Networked Systems (NETYS) (2013)","DOI":"10.1007\/978-3-642-40148-0_14"},{"key":"217_CR23","doi-asserted-by":"crossref","unstructured":"Pignolet, Y.A., Tredan, G., Schmid, S.: Misleading stars: what cannot be measured in the internet?. In: Proceedings of DISC (2011)","DOI":"10.1007\/978-3-642-24100-0_29"},{"key":"217_CR24","doi-asserted-by":"crossref","unstructured":"Plotkin, J.M., Rosenthal, J.W.: How to obtain an asymptotic expansion of a sequence from an analytic identity satisfied by its generating function. J. Aust. Math. Soc. Ser. A (1994)","DOI":"10.1017\/S1446788700034777"},{"key":"217_CR25","doi-asserted-by":"crossref","unstructured":"Ristenpart, T., Tromer, E., Shacham, H., Savage, S.: Hey, you, get off of my cloud: exploring information leakage in third-party compute clouds. In: Proceedings of 16th ACM CCS, pp. 199\u2013212 (2009)","DOI":"10.1145\/1653662.1653687"},{"key":"217_CR26","doi-asserted-by":"crossref","unstructured":"Schaffrath, G., Schmid, S., Feldmann, A.: Optimizing long-lived cloudnets with migrations. In: Proceedings of IEEE\/ACM UCC (2012)","DOI":"10.1109\/UCC.2012.7"},{"key":"217_CR27","doi-asserted-by":"crossref","unstructured":"Schaffrath, G., Werle, C., Papadimitriou, P., Feldmann, A., Bless, R., Greenhalgh, A., Wundsam, A., Kind, M., Maennel, O., Mathy, L.: Network virtualization architecture: proposal and initial prototype. In: Proceedings of ACM SIGCOMM VISA (2009)","DOI":"10.1145\/1592648.1592659"},{"issue":"1","key":"217_CR28","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TNET.2003.822655","volume":"12","author":"N Spring","year":"2004","unstructured":"Spring, N., Mahajan, R., Wetherall, D., Anderson, T.: Measuring isp topologies with rocketfuel. IEEE\/ACM Trans. Netw. 12(1), 2\u201316 (2004)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"217_CR29","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/959242.959249","volume":"5","author":"T Washio","year":"2003","unstructured":"Washio, T., Motoda, H.: State of the art of graph-based data mining. SIGKDD Explor. Newsl. 5, 59\u201368 (2003)","journal-title":"SIGKDD Explor. Newsl."},{"key":"217_CR30","doi-asserted-by":"crossref","unstructured":"Yao, B., Viswanathan, R., Chang, F., Waddington, D.: Topology inference in the presence of anonymous routers. In: Proceedings of IEEE INFOCOM, pp. 353\u2013363 (2003)","DOI":"10.1109\/INFCOM.2003.1208687"},{"key":"217_CR31","doi-asserted-by":"crossref","unstructured":"Zhang, S., Qian, Z., Wu, J., Lu, S.: An opportunistic resource sharing and topology-aware mapping framework for virtual networks. In: Proceedings of IEEE INFOCOM (2012)","DOI":"10.1109\/INFCOM.2012.6195630"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0217-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-014-0217-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0217-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T16:05:07Z","timestamp":1565366707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-014-0217-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,23]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["217"],"URL":"https:\/\/doi.org\/10.1007\/s00446-014-0217-4","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,23]]}}}