Adversarial VNet Embeddings: A Threat for ISPs?

Adversarial VNet Embeddings: A Threat for ISPs?

Abstract

This paper demonstrates that virtual networks that are dynamically embedded on a given resource network may constitute a security threat as properties of the infrastructure—typically a business secret—are disclosed. We initiate the study of this new problem and introduce the notion of request complexity which captures the number of virtual network embedding requests needed to fully disclose the infrastructure topology. We derive lower bounds and present algorithms achieving an asymptotically optimal request complexity for the important class of tree and cactus graphs (complexity Θ(n)) as well as arbitrary graphs (complexity Θ(n 2 )).

Grafik Top
Authors
  • Pignolet, Yvonne-Anne
  • Schmid, Stefan
  • Tredan, Gilles
Grafik Top
Supplemental Material
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
INFOCOM Mini-Conference
Divisions
Communication Technologies
Subjects
Informatik Allgemeines
Event Location
Turin, Italy
Event Type
Conference
Event Dates
April 2013
Date
April 2013
Export
Grafik Top