The complexity of the overlay network verification and its related problems

Wattana Jindaluang; Sanpawat Kantabutra; Varin Chouvatut

Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/53416

Full metadata record

DC Field	Value	Language
dc.contributor.author	Wattana Jindaluang	en_US
dc.contributor.author	Sanpawat Kantabutra	en_US
dc.contributor.author	Varin Chouvatut	en_US
dc.date.accessioned	2018-09-04T09:48:55Z	-
dc.date.available	2018-09-04T09:48:55Z	-
dc.date.issued	2014-01-01	en_US
dc.identifier.other	2-s2.0-84942856816	en_US
dc.identifier.other	10.1109/ICSEC.2014.6978123	en_US
dc.identifier.uri	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84942856816&origin=inward	en_US
dc.identifier.uri	http://cmuir.cmu.ac.th/jspui/handle/6653943832/53416	-
dc.description.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.	en_US
dc.subject	Computer Science	en_US
dc.subject	Mathematics	en_US
dc.subject	Medicine	en_US
dc.title	The complexity of the overlay network verification and its related problems	en_US
dc.type	Conference Proceeding	en_US
article.title.sourcetitle	2014 International Computer Science and Engineering Conference, ICSEC 2014	en_US
article.stream.affiliations	Chiang Mai University	en_US
Appears in Collections:	CMUL: Journal Articles

Files in This Item:

There are no files associated with this item.

Show simple item record