• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.11-19
• /
• 2004

P2P network environments provide users with direct data transmission and sharing facilities and those environments can be classified into hybrid P2P network environments and pure P2P network environments according to the arbitration mechanism among the peers in the network. In hybrid P2P network environments, there exists a server that maintains index information for the data to be shared and network isolation does not occur because every peer always keeps connection to the server. In pure P2P network environments, however, each peer directly connects to another peer and gets services without server intervention, and so, network isolation can occur when the mediating peer fails to work. In this paper. we propose a scheme for each peer to keep connection to other peers continuously by maintaining IP addresses of its neighbor peers and connecting to the peers when the mediating peer fails to work. Although the P2P application that uses our proposed framework should obtain one or more IP addresses of the neighbor peers manually, after instantiation, the application can do its job while maintaining connection to the network continuously and automatically. To evaluate our proposed scheme, we measured and analyzed the time for a peer to reconnect to the network when the mediating peer fails and the network isolation occurs.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1529-1538
• /
• 1999

광대역 액세스 망은 B-ISDN 환경에서 다양한 유형의 가입자들을 서비스 노드로 집선하는 기능을 수행한다. ITU-T의 SG13에서는 광대역 액세스 망과 서비스 노드 사이에서 ATM 자원의 동적인 할당 및 해제를 위하여 연결 제어 프로토콜의 표준화를 수행하고 있다. ATM 연결의 설정을 위한 연결 제어 프로토콜과 신호 프로토콜의 연동 기능은 서비스 노드에서 수행되며, ITU-T에서는 순차적 연동 모델을 채택하고 있다. 순차적 연동 모델은 SN에서 각 프로토콜의 절차가 순차적 방식으로 연동되므로 연결 지연이 크다. 본 논문에서는 광대역 액세스 망의 도입으로 인한 연결 설정 지연을 최소화하기 위하여 병렬형으로 수행되는 연동 모델을 제시하였다. 그리고 본 논문에서 제안한 병렬형 연동 모델의 성능 분석을 통하여 순차적 연동 모델과의 연결 설정 지연 및 완료비에 대한 비교, 분석을 수행하였다. 성능 분석에서 사용된 워크로드 파라미터는 RACE MAGIC 프로젝트의 결과를 적용하였다. Abstract In B-ISDN environment, various subscribers are concentrated into a service node via a broadband access network. The SG13 of ITU-T is standardizing a connection control protocol which provides dynamic allocation of ATM resources between an access network and a service node. To establish an ATM connection, interworking functions between the connection control protocol and the signaling protocol are performed at the service node. ITU-T adopts the sequential interworking model. In this paper, we propose the parallel interworking model which minimizes the overall connection setup delay by introducing the access network. Using the performance analysis, we compare our proposed parallel model with the existing sequential model in terms of connection setup delay and completion ratio. The workload parameters of RACE MAGIC project are applied to the analysis and simulation.

• Journal of KIISE
• /
• v.44 no.12
• /
• pp.1282-1289
• /
• 2017

Since the study of deep convolutional neural network became prevalent, one of the important discoveries is that a feature map from a convolutional network can be extracted before going into the fully connected layer and can be used as a saliency map for object detection. Furthermore, the model can use features from each different layer for accurate object detection: the features from different layers can have different properties. As the model goes deeper, it has many latent skip connections and feature maps to elaborate object detection. Although there are many intermediate layers that we can use for semantic segmentation through skip connection, still the characteristics of each skip connection and the best skip connection for this task are uncertain. Therefore, in this study, we exhaustively research skip connections of state-of-the-art deep convolutional networks and investigate the characteristics of the features from each intermediate layer. In addition, this study would suggest how to use a recent deep neural network model for semantic segmentation and it would therefore become a cornerstone for later studies with the state-of-the-art network models.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.909-912
• /
• 1998

In this paper, a new connection admission controller using neural network is presented. The controller measures traffic flow, cell loss rate, and cell delay periodically. Using those measured information, it learns the distributions of traffics of each traffic. Also the proposed controller is able to measure and manage the delays that source traffics experience through the network by using DWRR multiplexer with buffers dedicated to each traffic source. Experimental result show that the heterogeneous traffic sources with various QoS requirement.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.124-126
• /
• 1989

Inverse kinematic problem is a crucial point for robot manipulator control. In this paper, to implement the Jacobian control technique we used the Hopfield(Tank)'s neural network. The states of neurons represent joint veocities, and the connection weights are determined from the current value of the Jacobian matrix. The network energy function is constructed so that its minimum corresponds to the minimum least square error. At each sampling time, connection weights and neuron states are updated according to current joint position. Inverse kinematic solution to the planar redundant manipulator is solved by computer simulation.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.119-124
• /
• 2021

Elastic Optical Networks (EONs) allow to solve the high demand for bandwidth due to the increase in the number of internet users and the explosion of multicast applications. To support multicast applications, network operator computes a tree-shaped path, which is a set of optical channels. Generally, the demand for bandwidth on an optical channel is enormous so that, if there is a single fiber failure, it could cause a serious interruption in data transmission and a huge loss of data. To avoid serious interruption in data transmission, the tree-shaped path of a multicast connection may be protected. Several works have been proposed methods to do this. But these works may cause the duplication of some resources after recovery due to a link failure. Therefore, this duplication can lead to inefficient use of network resources. Our work consists to propose a method of protection that eliminates the link that causes duplication so that, the final backup path structure after link failure is a tree. Evaluations and analyses have shown that our method uses less backup resources than methods for protection of a multicast connection.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.10
• /
• pp.455-464
• /
• 2015

As the number of overseas travelers with smartphones increases, there is a growing interest in smartphone applications, which can assist traveling. Typically, travelers need applications to obtain basic information, such as weather, map, currency, etc. However, existing smartphone applications are not suitable to do so because they require network connection that is expensive and unstable in overseas. For example, one of the most frequently used smartphone map application requires a network connection, and much battery to download images. Since travelers spend most of their time outside, there is no chance to charge the battery. In this paper, we propose a study on implementation of a smartphone application for overseas travelers, called Travel Manager, which aims to reduce usages of network connection and battery. Travel Manager first checks whether smartphone is connected to the network, and then synchronizes the travel information. It also automatically calculates traveling expenses by considering currency rate. That is, the proposed smartphone application can be used regardless of the network connection and minimizes the battery usage.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.1033-1042
• /
• 2004

According to the arbitration mechanism among the peers in the network, the P2P networking environments can be classified into hybrid P2P networking environments and pure P2P networking environments. In hybrid P2P networking environments, each peer gets continual services from the servers that arc operational most of the time, and so, network isolation does not occur because every peer can always keep connection to the server. In pure P2P networking environments, however, every peer directly connects to another peer without server intervention, and so, network isolation can occur when the per mediating the connection is terminated. In this paper, we propose a scheme for each peer to keep connection information of other peers by maintaining IDs of its neighbor peers, to reconnect to another peers when the mediating peer fails to work. and, for efficiency. to balance the number of connections that should be maintained by each peer. With our mechanism, each pier in the network can continuously maintain connection to the network and get seamless services from other peers. Through the simulation, we ascer-tained that network isolation does not occur in the pure P2P network adopting our mechanism and that our mechanism distributes and balances the connections that are maintained by each peer. We also analyzed the total network traffic and the mean number of hops for the connections made by each peer according to the recommended number of connections that is established at system setup time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5B
• /
• pp.465-475
• /
• 2004

Transport Control Protocol (TCP) has been implemented in software running on CPU in end systems, and the protocol processing has appeared as a new bottleneck due to advanced link technology. TCP processing is a critical issue in Storage Area Network (SAN) such as iSCSL, and the overall performance of the Storage Area Network heavily depends on speed of TCP processing. TCP Engine implemented in hardware reduces the load of CPU in end systems as well as accelerates the protocol processing, and hence high speed data processing is achieved. In this paper, we have proposed a hardware engine for TCP processing. TCP engine consists of three major block, TCP Connection block Rx TCP block and Tx TCP block TCP Connection block is responsible for managing TCP connection states. Rx TCP block is responsible for receive flow which receives packets from network and sends to CPU. Rx TCP performs header and data processing and sends header information to TCP connection block and Tx TCP block It also assembles out-of-ordered data to in-ordered before it transfers data to CPU. Tx TCP block is responsible for transmit flow which transfers data from CPU to network. Tx TCP performs retransmission for reliable data transfer and management of transmit window and sequence number. Various test-cases are used to verify the TCP functions. The TCP Engine is synthesized using 0.18 micron technology and results in 51K gates not including buffers for temporal data storage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2B
• /
• pp.118-123
• /
• 2007

This paper studied the transmission control protocol over IP network to enhance the performance of the GSO satellite communication networks. The focus of this study is how to reduce the long round trip time and the transmission data rates over satellite link in the bidirectional satellite network. To do it, this study applied the caching and spoofing technology. The spoofing technology is used to reduce the required time for the link connection during communication. The caching technology is to improve the transmission bandwidth efficiency in the high transmission data rate link The tests and measurements in this study was performed in the commercial GSO communication satellite network and the terrestrial Internet network. The results of this paper show that the studied protocol in this paper highly enhance the performance of the bidirectional satellite communication network compare to the using TCP/IP satellite network protocol.