A GOSST Heuristic Mechanism for the Design of a Physical Multiple Security Grade Network 


Vol. 32,  No. 12, pp. 728-734, Dec.  2007


PDF
  Abstract

In this paper, we propose a GOSST(Grade Of Services Steiner minimum Tree) heuristic mechanism for the design of a physical multiple security grade network with minimum construction cost. On the network, each node can communicate with other nodes by its desiring security grade. Added to the existing network security methods, the preventing method from illegal physical access is necessary for more safe communication. To construct such network with minimum cost, the GOSST problem is applied. As the GOSST problem is a NP-Hard problem, a heuristic with reasonable complexity is necessary for a practical solution. In this research, to design the physical multiple security grade network with the minimum construction cost, the reformed our previous Distance Direct GOSST heuristic mechanism is proposed. The mechanism brings average 29.5% reduction in network construction cost in comparison with the experimental control G-MST.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

I. Kim and C. Kim, "A GOSST Heuristic Mechanism for the Design of a Physical Multiple Security Grade Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 12, pp. 728-734, 2007. DOI: .

[ACM Style]

Inbum Kim and Chae-kak Kim. 2007. A GOSST Heuristic Mechanism for the Design of a Physical Multiple Security Grade Network. The Journal of Korean Institute of Communications and Information Sciences, 32, 12, (2007), 728-734. DOI: .

[KICS Style]

Inbum Kim and Chae-kak Kim, "A GOSST Heuristic Mechanism for the Design of a Physical Multiple Security Grade Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 12, pp. 728-734, 12. 2007.