Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/53416
Title: The complexity of the overlay network verification and its related problems
Authors: Wattana Jindaluang
Sanpawat Kantabutra
Varin Chouvatut
Keywords: Computer Science
Mathematics
Medicine
Issue Date: 1-Jan-2014
Abstract: © 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.
URI: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84942856816&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/53416
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.