• The KIPS Transactions:PartA
• /
• v.14A no.5
• /
• pp.317-326
• /
• 2007

We propose more enhanced heuristic for the GOSST(Grade of Services Steiner Minimum Tree) problem in this paper. GOSST problem is a variation of Steiner Tree problem and to find a network topology satisfying the G-Condition with minimum network construction cost. GOSST problem is known as one of NP-Hard or NP-Complete problems. In previous our research, we proposed a heuristic employing Direct Steiner Point Locating strategy with Distance Preferring MST building strategy. In this paper, we propose new Steiner point locating strategy, Zigzag Steiner point Locating strategy. Through the results of out experiments, we can assert this strategy is better than our previous works. The Distance Zigzag GOSST method which hires the Distance Preferring MST building strategy and Zigzag Steiner point Locating strategy defrays the least network construction cost and brings 31.5% cost saving by comparison to G-MST, the experimental control and 2.2% enhancement by comparison to the Distance Direct GOSST method, the best GOSST method in our previous research.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9B
• /
• pp.569-576
• /
• 2007

This paper is on the enhancement of our heuristics for GOSST problem that could apply to the design of communication networks offering graduated services. This problem hewn as one of NP-Hard problems finds a network topology meeting the G-Condition with minimum construction cost. In our prior research, we proposed two heuristics. We suggest methods of selecting G-Node and disconnections for Global or Local locating heuristic in this research. The ameliorated Local locating heuristic retrenches 17% more network construction cost saving ratio and the reformed Global locating heuristic does 14% more than our primitives.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.9
• /
• pp.107-114
• /
• 2011

Because of boost of communications devices furnishing diverse services and rapid expansion of mobile business, good use and management of the existing network system become very important. Also, offering service corresponding with user communication requirement grades which vary widely in each person, is vital for communication service provider. In this paper, SGOSST, a mechanism of efficient network construction with minimum cost for network QoS is proposed. In experiments, though spending 252.97% more execution times, our SGOSST QoS network consumed 5.11% less connecting costs than the network constructed by weighted minimum spanning tree method. Therefore our mechanism can work well for efficient operation and service providing in the network formed with users and communication devices of various service requirement grade as smart/mobile equipment.

• Journal of Korea Multimedia Society
• /
• v.11 no.1
• /
• pp.44-52
• /
• 2008

This paper is on the enhancement of our heuristics for Grade Of Services Steiner Minimum Tree (GOSST) problem that can apply to the design of communication networks offering manifold grade of services in multimedia communication area. GOSST problem known as one of NP-Hard problems asks for a network topology meeting the G-Condition with minimum construction cost. In our prior researches, we proposed some heuristics for the problem. In this paper, we suggest a strategy of G-Condition scrutiny sequence to fortify our previous heuristics. In the experiment results, the ameliorated achieves 71.9% economy of execution times, 28.9% of required Steiner points and 1.1% of network construction costs.