The complexity of the overlay network verification and its related problems
© 2014 IEEE. In this paper we introduce a special type of virtual networks called an overlay network. We first study a decision problem called the OVERLAY NETWORK VERIFICATION PROBLEM and show that this problem is NP-complete. We then place some restriction to the original problem and prove that the...
Saved in:
Main Authors: | , , |
---|---|
Format: | Conference Proceeding |
Published: |
2018
|
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84942856816&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/45394 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Summary: | © 2014 IEEE. In this paper we introduce a special type of virtual networks called an overlay network. We first study a decision problem called the OVERLAY NETWORK VERIFICATION PROBLEM and show that this problem is NP-complete. We then place some restriction to the original problem and prove that the OVERLAY NETWORK VERIFICATION PROBLEM still remains NP-complete. A similar problem called the TWO-LABEL OVERLAY NETWORK VERIFICATION PROBLEM is then investigated. The complexities of this problem and its variant are then discussed. A list of open problems and the real-world applications of our results are given in the conclusion. |
---|