• The Journal of the Korea Contents Association
• /
• v.7 no.5
• /
• pp.1-9
• /
• 2007

Topology information can be constructed hierarchically in the networks and the process of aggregating topology information is known as TA(Topology Aggregation). It is very important for scalability in networks. In paticular, routing and TA algorithm are very much elements on networks performance in private networks to networks interface. Therefore, in this paper, we designed and implemented routing simulator for TA in private networks to networks interface. And we evaluated and analyzed the existent TA algorithm using the implemented simulator. The implemented simulator can be used valuably to developing TA algorithm.

• The Journal of the Korea Contents Association
• /
• v.8 no.7
• /
• pp.35-42
• /
• 2008

The proposed scheme in this paper can search multi-links efficiently using the depth priority method based on hop count instead of searching the all links. To do this, we proposed a modified line segment scheme using two line segment method. The scheme represents two points which consist of delay-bandwidth pair to reduce topology information and provide a flexibility to the multiple-links aggregation. And we apply it to current spanning tree topology aggregation. To evaluate performance of the proposed scheme, we compare/analyze the current method with the proposed scheme with respect to call success rate, access time and crankback rate. Simulation result analysis showed the proposed spanning tree topology aggregation scheme presents the better performance than existing scheme.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.411-414
• /
• 2006

Topology information can be aggregated in the network constructed hierarchically and aggregating topology information is known as TA(Topology Aggregation) and TA is very important for scalability in networks. It is a very important elements to extend networks and routing in networks. In paticular, routing and TA algorithm are much influence on networks performance in PNNI. Therefore, in this paper, we design and implement routing simulator for TA in PNNI.

• Convergence Security Journal
• /
• v.8 no.2
• /
• pp.95-102
• /
• 2008

In this paper, we proposed topology aggregation method that efficiently aggregating topology information in simple node topology. And, it improved QoS of networks by improving call success rate and call access time. Proposed method can improving performance of network by decreasing aggregation information and aggregating multi-links information between boundary nodes using the line segment scheme within bandwidth and delay parameter. To evaluate performance of the proposed scheme, we compare/analyze the current method with the proposed scheme in respect to call success rate, access time.

• Journal of Korea Multimedia Society
• /
• v.7 no.11
• /
• pp.1556-1563
• /
• 2004

In this paper, we propose an efficient full mesh topology aggregation method in PNNI networks. The proposed scheme can search multi-links efficiently using the depth priority method based on hop count instead of searching the all links. To do this, we propose a modified line segment algorithm using two line segment method that represents two points which consist of delay-bandwidth pair to reduce topology information and provide a flexibility to the multiple-links aggregation. And we apply it to current full mesh topology aggregation. To evaluate performance of the proposed scheme, we compare/analyze the current method with the proposed scheme with respect to call success rate, access time and crank back rate. The result is that the proposed scheme is better than the current scheme in performance.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.11a
• /
• pp.601-607
• /
• 2005

In this paper, we aggregate multi-links information between boundary nodes using the line segment scheme that aggregates topology information within PG referring bandwidth and delay parameter. To do this, we propose a modified line segment algorithm using two line segment method that represents two points which consist of delay-bandwidth pair to reduce topology information and provide a flexibility to the multiple-links aggregation. And we apply it to current star topology aggregation. Through the simulation result analysis, the proposed star topology aggregation scheme presents the better performance than existing scheme.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.05a
• /
• pp.396-400
• /
• 2005

In this paper, we propose an efficient full mesh topology aggregation method in PNNI networks. The proposed scheme can search multi-links efficiently using the depth priority method based on hop count instead of searching the all links. To evaluate performance of the proposed scheme, we compare/analyze the current method with the proposed scheme with respect to call success rate, access time and crankback rate. The result is that the proposed scheme is better than the current scheme in performance.

• The Journal of the Korea Contents Association
• /
• v.20 no.6
• /
• pp.9-25
• /
• 2020

As laser scan and photogrammetry are extensively applied to 3D modeling, the Retopology has become a critically important part in the 3D modeling process. However, abundant time would be wasted if the wrong method for retopology is employed. This paper aims to select the most suitable method and software for retopology for different types of models so as to increase the effectiveness of 3D modeling. In this paper, retopology is divided into three types according to the existed software for retopology in the market: manual, automatic and wrapping type, all of which are investigated by their characteristics of retopology and software in which they are applied individually. Then case production is employed on Static Mesh Skeletal Mesh and Hard Surface Modeling by the above mentioned three methods. The advantages and disadvantages of the software in which the above three methods can be applied are summed up, and the manual type produces good results, the automatic type is fast, and the wrapping type requires a pre-existing base mesh and the most suitable method for retopology for each type of 3D models is demonstrated. This paper provides reference for retopology and increases the effectiveness of 3D modeling.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.6
• /
• pp.1-1
• /
• 2002

In this paper, we focus on comparison and analysis of performance for existing Topology Aggregation algorithm. For these, we designed and implemented PNNI routing simulator which contain various TA schemes, and evaluate performance of TA schemes by this simulator. The PNNI 1.0 specification of the ATM Forum is recommended that hierarchical routing protocol and topology information is aggregated in the network constructed hierarchically Aggregating topology information is known as TA(Topology Aggregation) and TA is very important for scalability and security in network. Therefore, the performance of PNNI network would vary with TA schemes and routing algorithm. PNNI routing simulator can be applied to develope Routing algorithm and TA algorithm and can be develope these algorithms in short period.

• Journal of the military operations research society of Korea
• /
• v.33 no.2
• /
• pp.87-100
• /
• 2007

The aspect of future warfare is NCW(Network Centric Warfare) in accordance with the IT development, so MND have the planning of M-BcN(Military Broadband convergence Network) establishment as the basic system of NCW by the end of 2008. IPv6 address must be managed systematically as a essential element of NCW. In the previous study, it is designed on the basis of the present military information communication network topology. However, it makes some problems. First, it is difficult for present topology to adapt the future M-BcN which is different from the present military network topology. Second, it has defects of inefficiency of route aggregation and enlargement of routing table size. In this paper, we improved the route aggregation and routing table size by assigning the hierarchical address on the basis of M-BcN topology and adjusting the position of field identifying service network. Furthermore, it is proved by the network simulation program(OPNET 12.0).