• Title/Summary/Keyword: Steiner Minimum Tree

Search Result 36, Processing Time 0.029 seconds

A Genetic Algorithm for Cluster Based Multicast Routing Problem (클러스터 기반의 멀티캐스트 라우팅 문제 해법을 위한 유전자 알고리즘)

  • 강명주
    • Journal of the Korea Society of Computer and Information
    • /
    • v.8 no.3
    • /
    • pp.150-155
    • /
    • 2003
  • Multicasting, the transmission of data to a group, can be solved from constructing multicast tree, that is, the whole network is partitioned to some clusters and the clusters are constructed by multicast tree. This paper proposes an algorithm that reduces the multicast routing costs using a clustering method. Multicast tree is constructed by minimum-cost Steiner tree. It is important to solve the mnimum-cost Steiner tree problem in the multicast routing problems. Hence, this paper proposes a genetic algorithm for multicast routing problems using clustering method.

  • PDF

Approximation ratio 2 for the Minimum Number of Steiner Points (최소 개수의 스타이너 포인트를 위한 근사 비율 2)

  • 김준모;김인범
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.7_8
    • /
    • pp.387-396
    • /
    • 2003
  • This paper provides an approximation algorithm for STP-MSP(Steiner Tree Problem with minimum number of Steiner Points).Because it seems to be impossible to have a PTAS(Polynomial Time Approximation Schemes), which gives the near optimal solutions, for the problem, the algorithm of this paper is an alternative that has the approximation ratio 2 with $n^{O(1)}$ run time. The importance of this paper is the potential to solve other related unsolved problems. The idea of this paper is to distribute the error allowance over the problem instance so that we may reduce the run time to polynomial bound out of infinitely many cases. There are earlier works[1,2] that show the approximations that have practical run times with the ratio of bigger than 2, but this paper shows the existence of a poly time approximation algorithm with the ratio 2.

SGOSST Mechanism for Quality of Service In Network (네트워크 QoS를 위한 SGOSST 메커니즘)

  • Kim, In-Bum
    • 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.

A Parallel Algorithm For Rectilinear Steiner Tree Using Associative Processor (연합 처리기를 이용한 직교선형 스타이너 트리의 병렬 알고리즘)

  • Taegeun Park
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.8
    • /
    • pp.1057-1063
    • /
    • 1995
  • This paper describes an approach for constucting a Rectilinear Steiner Tree (RST) derivable from a Minimum Spanning Tree (MST), using Associative Processor (AP). We propose a fast parallel algorithm using AP's basic algorithms which can be realized by the processing capability of rudimentary logic and the selective matching capability of Content- Addressable Memory (CAM). The main idea behind the proposed algorithm is to maximize the overlaps between the consecutive edges in MST, thus minimizing the cost of a RST. An efficient parallel linear algorithm with O(n) complexity to construct a RST is proposed using an algorithm to find a MST, where n is the number of nodes. A node insertion method is introduced to allow the Z-type layout. The routing process which only depends on the neighbor edges and the no-rerouting strategy both help to speed up finding a RST.

  • PDF

Weighted Optimal Location of Mail Distribution Center Using GOSST (GOSST를 이용한우편물 교환센터의 가중치 반영 최적 위치의 선정)

  • Kim, In-Bum;Kim, Joon-Mo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.11
    • /
    • pp.7-13
    • /
    • 2010
  • For swiftness and economic feasibility of parcel delivery, optimal location of mail exchanging centers considering not only section delivery distance but also some weights like the number of delivery vehicles are necessary. In this paper, a mechanism with section delivery distance and vehicle number for locating of mail distribution centers which connect some mail centers of major cities in Republic Korea by applying GOSST theory is proposed. This mechanism for locating mail exchange centers can make the total delivery distance of postal matters less than not only present method which assigns Daejun as mail exchange center, but also Steiner tree method which does not consider weights like number of delivery vehicles. The mechanism is good for protecting the environment as well as rapid and economic delivery. In experiment, the proposed mechanism could curtail total delivery distance by 2.52 percentages compared with Steiner tree method and by 6.66 percentages compared with present method. The mechanism may be used in electric power transmission routing, distribution line topology design, power relay station locating where various voltages and other weights should be considered.

Efficient Construction of Large Scale Grade of Services Steiner Tree Using Space Locality and Polynomial-Time Approximation Scheme (공간 지역성과 PTAS를 활용한 대형 GOSST의 효과적 구성)

  • Kim, In-Bum
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.11
    • /
    • pp.153-161
    • /
    • 2011
  • As the problem of GOSST building belongs to NP compete domain, heuristics for the problem ask for immense amount execution time and computations in large scale inputs. In this paper, we propose an efficient mechanism for GOSST construction using space locality PTAS. For 40,000 input nodes with maximum weight 100, the proposed space locality PTAS GOSST with 16 unit areas can reduce about 4.00% of connection cost and 89.26% of execution time less than weighted minimum spanning tree method. Though the proposed method increases 0.03% of connection cost more, but cuts down 96.39% of execution time less than approximate GOSST method (SGOSST) without PTAS. Therefore the proposed space locality PTAS GOSST mechanism can work moderately well to many useful applications where a greate number of weighted inputs should be connected in short time with approximate minimum connection cost.

A Genetic Algorithm for Real-Time Multicast Routing (실시간 멀티캐스트 라우팅을 위한 유전자 알고리즘)

  • 서용만;한치근
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.25 no.3
    • /
    • pp.81-89
    • /
    • 2000
  • The real-time multicast problem is to construct a multicast tree starting from a source node and including multiple destination nodes and that has minimum network cost with delay constraints. It is known that to find a tree of the minimum network cost is the Steiner Tree problem which is NP-complete. In this paper, we propose a genetic algorithm to solve the multicast tree with minimum network cost and the delay constraints. The computational results obtained by comparing an existing algorithm. Kompella algorithm, and the proposed algorithm show that our algorithm tends to find lower network cost on the average than Kompella algorithm does.

  • PDF

Euclidean Steiner Minimum Tree with Delaunay Triangulation for Efficient Construction of Multimedia Communication Network (멀티미디어 통신네트워크의 효율적 구축을 위한 Delaunay 삼각망 적용 유클리드 스타이너 트리)

  • Kim, In-Bum
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2012.05a
    • /
    • pp.417-418
    • /
    • 2012
  • 최소 신장 트리를 이용하여 멀티미디어 통신을 위한 네트워크를 구축하는 것보다 효과적인 유클리드 스타이너 트리 생성과정에서 필연적으로 발생되는 막대한 계산 량과 실행시간 문제를 해결하기 위해 Delaunay 삼각망을 적용하는 방법을 제안한다.

  • PDF

The Study of Selecting of Logistics Distribution Center Using GIS and GOSST (GIS와 GOSST를 이용한 물류센터의 입지선정에 관한 연구)

  • Oh, Sung-Rok;Kim, Youn-Jin;Cha, Ju-Il;Lee, Hong-Chul
    • Journal of Information Technology Applications and Management
    • /
    • v.18 no.4
    • /
    • pp.81-93
    • /
    • 2011
  • By using GOSST theory, this paper models SSCFLP taking FLP, capacity of the facilities, single source capacitated limitation level and service enhancement issues into consideration. GOSST theory is strongly suggested as the solution procedure for these issues. We have used clustering of Center of Gravity method using the case study of the company S and then, took a heuristic GOSST measure in the alternative selection process. As a result, the research finds an alternative solution that both meets the satisfactory level of service and achieves consistent distribution capacity. When using this modeling, especially, to select the location of the logistics distribution center, the efficiency of current facilities is maximized while offering the minimum geometric distance for the alternative. Also, we can expect that the illustrated model and alternative solution can be applied to architecture of distribution system, to selection of telecommunication system locations for wireless network and to relocation of related facilities due to their sensitivities to location and weight.

Point-to-Multipoint Minimum Cost Flow Problem with Convex Cost Function (콘벡스 비용함수를 갖는 점-대-다중점 최소비용 흐름문제)

  • 박구현;신용식
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.25 no.4
    • /
    • pp.15-25
    • /
    • 2000
  • In this paper, we introduce a point-to-multipoint minimum cost flow problem with convex and demand splitting. A source node transmits the traffic along the tree that includes members of the point-to-multipoint connection. The traffic is replicated by the nodes only at branch points of the tree. In order to minimize the sum of arc costs, we assume that the traffic demand can be splitted and transmitted to destination nodes along different trees. If arc cost is linear, the problem would be a Steiner tree problem in networks eve though demand splitting is permitted. The problem would be applied in transmitting large volume of traffic from a serve to clients in Internet environments. Optimality conditions of the problem are presented in terms of fair tree routing. The proposed algorithm is a finite terminating algorithm for $\varepsilon$-optimal solution. convergence of the algorithm is obtained under monotonic condition and strict convexity of the cost function. Computational experiences are included.

  • PDF