Name
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 θ(n2)). |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/INFCOM.2013.6566806 | Turin |
Keywords | Field | DocType |
communication complexity,computer network security,embedded systems,graph theory,resource allocation,virtual private networks,ISP threat,adversarial VNet embeddings,asymptotically optimal request complexity,business secret,cactus graphs,infrastructure topology,request complexity,resource network,security threat,virtual network embedding requests,virtual networks | Graph theory,Graph,Computer science,Network security,Computer network,Theoretical computer science,Communication complexity,Resource allocation,Virtual network embedding,Asymptotically optimal algorithm,Adversarial system,Distributed computing | Conference |
ISSN | ISBN | Citations |
0743-166X | 978-1-4673-5944-3 | 4 |
PageRank | References | Authors |
0.41 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yvonne Anne Pignolet | 1 | 118 | 21.26 |
| Stefan Schmid | 2 | 76 | 6.48 |
| Gilles Trédan | 3 | 100 | 11.32 |