The complexity of the overlay network verification and its related problems

Author

Jindaluang, Wattana ; Kantabutra, Sanpawat ; Chouvatut, Varin

Author_Institution

Dept. of Comput. Eng., Chiang Mai Univ., Chiang Mai, Thailand

fYear

2014

fDate

July 30 2014-Aug. 1 2014

Firstpage

23

Lastpage

28

Abstract

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.

Keywords

overlay networks; NP-complete problem; decision problem; overlay network verification problem; real-world applications; related problems; virtual networks; Bioinformatics; Complexity theory; Computer science; Computers; Databases; Educational institutions; Overlay networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Engineering Conference (ICSEC), 2014 International

Conference_Location

Khon Kaen

Print_ISBN

978-1-4799-4965-6

Type

conf

DOI

10.1109/ICSEC.2014.6978123

Filename

6978123