• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.359-361
• /
• 1998

초고속 정보통신망의 등장과 다양한 서비스 및 통신기능을 갖춘 정보가전의 개발로 인하여 댁내 통신망 개발의 중요성이 대두되고 있다. 본 논문에서는 댁내의 정보 가전들간에 경제적으로 ATM 기반의 고속 통신 기술을 제공하는HAN/RT(Home ATM Network with Ring Topology)프로토콜을 제안한다. HAN/RT는 저가이며 단순한 기능만을 가진 스위치로 셀 스위칭을 수행하며, 스위치의 복잡한 기능을 제어기에 적재하며 효율적인 망구조를 설계한다. 또한 HAN/RT에서의 셀 교환 시나리로에 대하여 기술한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.587-590
• /
• 2019

This paper is about to improve the network life's reduction due to the deviation of sensor node and frequently change of network, the main problem of sensor network. The existing Scalable Topology Organization(STO)-based ZigBee Tree Topology Control Algorithm did not consider ways to consume power so the network lifetime is too short. Accordingly, per each round, electing a new parent node and consisting of the new network topology technique, The Cluster Header Selection, extending the network's overall lifetime. The OMNet++ Simulator yielded results from the existing STO Algorithm and the proposed Cluster Header Selection Technique in the same experimental environment, which resulted in an increase in overall network life by about 40% and an improvement of about 10% in performance in the remaining portion of the battery.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.7
• /
• pp.1-8
• /
• 2011

Vehicular Ad-hoc Network (VANET) is a special form of Mobile Ad-hoc Network designed to provide communications among nearby vehicles without communications infrastructure. Some characteristics in VANET environment such as high mobility, dynamic topology and selfishness of nodes can cause degradation of network quality. In this paper, we propose an adaptive incentive/topology control scheme to improve network quality in VANET by stimulating real time data forwarding and reporting changes of network topology. In the proposed scheme, an incentive suggested by the source node is updated in real time simultaneously with data transmission to stimulate real time data forwarding. In addition, when the order of the nodes in the path is changed, nodes which report the changes of network topology will get an additional incentive. By computer simulation, it is shown that the proposed incentive/topology control scheme outperforms the conventional schemes with respect to data delivery time and data delivery ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.2
• /
• pp.344-358
• /
• 2011

Wireless tactical network (WTN) is the most important present-day technology enabling modern network centric warfare. It inherits many features from WMNs, since the WTN is based on existing wireless mesh networks (WMNs). However, it also has distinctive characteristics, such as hierarchical structures and tight QoS (Quality-of-Service) requirements. Little research has been conducted on hierarchical protocols to support various QoS in WMN. We require new protocols specifically optimized for WTNs. Control packets are generally required to find paths and reserve resources for QoS requirements, so data throughput is not degraded due to overhead. The fundamental solution is to adopt topology aggregation, in which a low tier node aggregates and simplifies the topology information and delivers it to a high tier node. The overhead from control packet exchange can be reduced greatly due to decreased information size. Although topology aggregation is effective for low overhead, it also causes the inaccuracy of topology information; thus, incurring low QoS support capability. Therefore, we need a new topology aggregation algorithm to achieve high accuracy. In this paper, we propose a new aggregation algorithm based on star topology. Noting the hierarchical characteristics in military and hierarchical networks, star topology aggregation can be used effectively. Our algorithm uses a limited number of bypasses to increase the exactness of the star topology aggregation. It adjusts topology parameters whenever it adds a bypass. Consequently, the result is highly accurate and has low computational complexity.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.590-593
• /
• 2012

현재 인터넷은 하드웨어 종속적인 특징을 가지고 있어 급변하는 환경에 적응하기 힘들다. 이러한 제약사항은 관련 산업 발전을 더디게 하고 있다. 이와 같은 네트워크 환경에서 산업 발전을 위하여 네트워크 인프라에 유연성을 제공할 수 있는 기술의 개발이 필요하다. 그러한 문제를 해결하기 위해 오픈프로토콜인 OpenFlow의 Programmable Network의 특성을 이용하여 네트워크 가상화를 구현하였으며, 응용 서비스별 Virtual Network를 제공하는 방안에 대해 연구하였다. 이를 위하여 OpenFlow 기반의 Programmable Network를 구축하였으며, 동적으로 구성이 가능한 네트워크에서 가상화를 제공하기 위해 VNAPI를 개발하였다. 또한, VNAPI를 통하여 신뢰성 있고 효율적인 응용 서비스의 전달을 위하여 Virtual Network Topology에 대한 설계를 같이 수행하였다.

• IE interfaces
• /
• v.16 no.spc
• /
• pp.87-92
• /
• 2003

Progressive mesh representation and generation have become one of the most important issues in network-based computer graphics. However, current researches are mostly focused on triangular mesh models. On the other hand, solid models are widely used in industry and are applied to advanced applications such as product design and virtual assembly. Moreover, as the demand to share and transmit these solid models over the network is emerging, the generation and the transmission of progressive solid models depending on specific engineering needs and purpose are essential. In this paper, we present a Cellular Topology-based approach to generating and transmitting progressive solid models from a feature-based solid model for internet-based design and collaboration. The proposed approach introduces a new scheme for storing and transmitting solid models over the network. The Cellular Topology (CT) approach makes it possible to effectively generate progressive solid models and to efficiently transmit the models over the network with compact model size.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.4
• /
• pp.766-776
• /
• 2001

In the constructing of the multi layer neural network, the network topology is often chosen arbitrarily for different applications, and the optimum topology of the network is determined by the long processing of the trial and error. In this paper, we propose the automatic topology construction using the fuzzy rule that optimizes the neurons of hidden layer, and prune the weights connecting the hidden layer and the output layer during the training process. The simulation of pattern recognition, and the experiment of the mapping of the inverted pendulum showed the effectiveness of the proposed method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.3
• /
• pp.548-556
• /
• 2018

NMS (Network Management System) is a system that is used for a small or large networks management. As the size of network becomes larger and the configuration information become complicated, it becomes more difficult to grasp the network status and it takes much time to diagnose the failure of the network equipment. In this paper, to alleviate the problems of NMS we implement web-based network topology automatically using JavaScript, Python, HTML5 based TWaver. The detailed implementation of the system include the automatic collection of the connection information based on the equipment information registered in the NMS system, the implementation of the web-based network topology and the remote fault diagnosis. In the network topology, we can expect to improve the quality of the NMS system through structured data management by adding the configuration management, fault management and performance management functions in a comprehensive manner.

• Journal of KIISE:Information Networking
• /
• v.37 no.3
• /
• pp.167-174
• /
• 2010

Recently the distributed topology control algorithm for constructing the Recrystallization Topology in the unstructured peer-to-peer network was proposed. In this paper, we prove that such a hierarchical topology is a scale-free power-law network. We present a model of a construction process of the distributed protocol, and analyze it based on a mean-field approximation and the continuum theory, so that we show that the constructed Recrystallization Topology is a scale-free network. In the proposed model, all nodes are born with some initial attractiveness and the system incorporates the rewiring of some links at every time step. Some old links are removed with the anti-preferential probability, and some new links are added with preferential probability. In other words, according to the distributed algorithm, each node makes connections to the more-preferential nodes having higher hit-ratio than other nodes, while it disconnects the anti-preferential nodes having lesser hit-ratio. This gives a realistic description of the local processes forming the recrystallization topology in unstructured peer-to-peer network. We calculate analytically the degree distribution. The analytic result indicates that the constructed network is a scale-free network, of which the scaling exponent is 3.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.5
• /
• pp.49-57
• /
• 2012

In P2P streaming management, peer's churning and finding efficient topology architecture optimization algorithm that reduces streaming delay is important. This paper studies a topology optimization algorithm based on the P2P streaming using peer's link information. The proposed algorithm is based on the estimation of peer's upload bandwidth using peer's link information on mesh-network. The existing algorithm that uses the information of connected links is efficient to reduce message overload in the point of resource management. But it has a risk of making unreliable topology not considering upload bandwidth. And when some network error occurs in a server-closer-peer, it may make the topology worse. In this paper we propose an algorithm that makes up for the weak point of the existing algorithm. We compare the existing algorithm with the proposed algorithm using test data and analyze each simulation result.