On a Problem of Designing a 2-Switch Node Network

Yoshitsugu TSUCHIYA  Yoshihiro KANEKO  Kazuo HORIUCHI  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E78-A   No.11   pp.1534-1536
Publication Date: 1995/11/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section of Letters Selected from the 1995 IEICE General Conference)
2-switch node network,  traffic,  terminal node,  partition,  NP-complete,  

Full Text: PDF>>
Buy this Article

A 2-switch node network is one of the most fundamental structure among communication nets such as telephone networks and local area networks etc. In this letter, we prove that a problem of designing a 2-switch node network satisfying capacity conditions of switch nodes and their link, which we call 2-switch node network problem, is NP-complete.