• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.251-267
• /
• 2008

In this paper, we present a distributed topology control algorithm for constructing an optimized topology having a minimal search-time in unstructured peer-to-peer network. According to the proposed algorithm, each node selects the best nodes having higher hit-ratio than other nodes as many as the number being exponentially proportional to the hit-ratio of the node itself, and then it connects to them. The ensemble behavior of the proposed algorithm is very similar to the recrystrallizing phenomenon that is observed in nature. There is a partial order relationship among the hit-ratios of most nodes of constructed topology. Therefore once query message visits a node, it has a higher hit-ratio than the node that was visited last by the message. The query message even sent from freeloader can escape to the node having high hit-ratio by one hop forwarding, and it never revisits any freeloader again. Thus the search can be completed within a limited search time. We also propose the Chain-reactive search scheme using the constructed topology. Such a controlled multicasting reduces the query messages by 43 percent compared to that of the naive Gnutella using broadcasting, while it saves the search time by 94 percent. The search success rate of the proposed scheme is 99 percent.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1163-1166
• /
• 2001

최근의 네트워크는 유선에서 무선으로 발전하고 있다. 무선 네트워크 기술은 여러 가지가 있다. 그 중 좁은 영역에서 사용하고 개인적인 용도로 알맞은 것이 블루투스(Bluetooth)이다. 블루투스 기술 표준은 데이터를 전송하는 단순한 통신 방법만을 정의한 것이 아니라, 몇 가지 응용에 대한 표준도 정의되어 있다. 이 응용은 모든 블루투스 기기가 전부 구현해야 하는 것이 아니라, 그 중 기기에 알맞은 것만을 선택해서 구현을 할 수 있도록 되어 있다. 그렇다면 블루투스 기기에서 다른 기기가 제공하는 서비스가 무엇인지를 알아낼 수 있는 방법이 필요하게 된다. 다른 기기의 서비스를 알아내는데 사용되는 블루투스 기술이 SDP 계층 (Service Discovery Protocol Layer) 이다. SDP 계층은 프로토콜만으로 작동 가능한 것이 아니라, 블루투스 기기에서 제공 가능한 서비스와 서비스 속성을 정의한 내부 데이터베이스를 참조해서 작동하게 된다. 이 내부 데이터베이스는 블루투스를 구현하는 사람마다 모두 다르게 구현하고 있다. 그래서 블루투스 서비스와 서비스 속성에 관한 정보는 글과 간단한 도표로만 정의되고 있는 상황이다. 블루투스 서비스와 서비스 속성 정보를 글과 도표가 아닌 XML을 이용한 문서로 표현을 하는 방법이 나타났었다. 그러나 블루투스 기기에서 직접 서비스와 서비스 속성을 기술한 XML 문서를 바탕으로 SDP를 작동시키는 것은 블루투스 기기에 XML 파서를 포함시켜야 한다는 것을 말한다. 대체로 작은 CPU 성능과 적은 메모리를 가지고 있는 블루투스 기기에서는 XML 파서를 포함하는 근 부담이 된다. 이에 본 논문에서는 보편적으로 사용될 수 있는 블루투스 서비스와 서비스 속성을 기술한 XML 문서에서 블루투스 기기에 적합한 내부 정보를 생성하는 생성기를 설계하고 구현을 하였다.보다는 현저히 낮았다. 총 휘발성 유기화합물읜 농도는 실내가 실외 보다 높았다(I/O ratio 2.5). BTEX의 상대적 함량도 실내가 실외보다 높아 실내에도 발생원이 있음을 암시하고 있다. 자료 분석결과 유치원 실내의 벤젠은 실외로부터 유입되고 있었고, 톨루엔, 에틸벤젠, 크실렌은 실외뿐 아니라 실내에서도 발생하고 있었다. 정량한 8개 화합물 각각과 총 휘발성 유기화합물의 스피어만 상관계수는 벤젠을 제외하고는 모두 유의하였다. 이중 톨루엔과 크실렌은 총 휘발성 유기화합물과 좋은 상관성 (톨루엔 0.76, 크실렌, 0.87)을 나타내었다. 이 연구는 톨루엔과 크실렌이 총 휘발성 유기화합물의 좋은 지표를 사용될 있고, 톨루엔, 에틸벤젠, 크실렌 등 많은 휘발성 유기화합물의 발생원은 실외뿐 아니라 실내에도 있음을 나타내고 있다.>10)의 $[^{18}F]F_2$를 얻었다. 결론: $^{18}O(p,n)^{18}F$ 핵반응을 이용하여 친전자성 방사성동위원소 $[^{18}F]F_2$를 생산하였다. 표적 챔버는 알루미늄으로 제작하였으며 본 연구에서 연구된 $[^{18}F]F_2$가스는 친핵성 치환반응으로 방사성동위원소를 도입하기 어려운 다양한 방사성의 약품개발에 유용하게 이용될 수 있을 것이다.었으나 움직임 보정 후 영상을 이용하여 비교한 경우, 결합능 변화가 선조체 영역에서 국한되어 나타나며 그 유의성이 움직임 보정 전에 비하여 낮음을 알 수 있었다. 결론: 뇌활성화 과제 수행시에 동반되는 피험자의 머리 움직임에 의하여 도파민 유리가 과대평가되었으며 이는 이 연구에서 제안한 영상정합을 이용한 움직임 보정기법에 의해서 개선되었다. 답이 없는 문제, 문제 만들기, 일반화가 가능한 문제 등으로 보고, 수학적 창의성 중 특히 확산적 사

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.389-405
• /
• 2001

In these days, we have increasing demands on the real-time services, especially for the multimedia data transmission in both of wired and wireless environments and thus efficient and stable ways of transmitting realtime data are needs. Although RTP is widely used for internet-based realtime applications, it cannot avoid packet losses, due to the use of UDP stack and its underlying layers. In the case of mobile computing applications, the packet losses are more frequent and consecutive because of the limited bandwidth. In this paper, we first statistically analyze the characteristics of packet losses in the wired and wireless communications, based on Gilbert model, and a new packet recovery scheme for realtime data transmission is presented. To reflect the transmission characteristics of the present network environment, our scheme makes the sender to dynamically adjust the amount of redundant information, using the current packet loss characteristic parameters reported by the receiver. Additionally, we use relatively large and discontinuous offset values, which enables us to recover from both of the random and consecutive packet losses. Due to these characteristics, our scheme is suitable for the mobile computing environment where packet loss rates are relatively high and varies rapidly in a wide range. Since our scheme is based on the analytic model form statistics, it can also be used for other network environments. We have implemented the scheme with Mobile IP and RTP/RTCP protocols to experimentally verify its efficiency.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.233-243
• /
• 2003

With the original Transmission Control Protocol(TCP) design, which is particularly targeted at the wired networks, a packet loss is assumed to be caused by the network congestion. In the wireless environment where the chances to lose packets due to transmission bit errors are not negligible, though, this assumption may result in unnecessary TCP performance degradation. In this paper, we propose three schemes that improve the ability to conceal the packet losses in the wireless network while limiting the degree of violating TCP end-to-end semantics to a temporary incidents. If there happens a packet loss at the wireless link and there is a chance that the loss is noticed by the sending TCP, the proposed schemes send an indirect acknowledgement. Each of the proposed schemes uses different criteria to decide whether there is a chance that the packet loss occurred in the wireless part is noticed by the sender. In order to limit the buffer overhead in the base, the indirect acknowledgements are issued only when the length of buffer is less than a certain threshold. We use simulation to compare the overhead and the performance of the proposed schemes, and to show that the proposed schemes improve the TCP performance compared to Snoop with a limited amount of buffer at the base station.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.4
• /
• pp.226-238
• /
• 2010

OpenSSL is an open-source library implementing SSL that is a secure communication protocol. However, the library has a severe vulnerability that its security information can be easily exposed to malicious software when the library is used in a form of shared library on Linux and UNIX operating systems. We propose a scheme to attack the vulnerability of the OpenSSL library. The scheme injects codes into a running client program to execute the following attacks on the vulnerability in a SSL handshake. First, when a client sends a server a list of cryptographic algorithms that the client is willing to support, our scheme replaces all algorithms in the list with a specific algorithm. Such a replacement causes the server to select the specific algorithm. Second, the scheme steals a key for data encryption and decryption when the key is generated. Then the key is sent to an outside attacker. After that, the outside attacker decrypts encrypted data that has been transmitted between the client and the server, using the specified algorithm and the key. To show that our scheme is realizable, we perform an experiment of collecting encrypted login data that an ftp client using the OpenSSL shared library sends its server and then decrypting the login data.

• Journal of KIISE:Information Networking
• /
• v.36 no.6
• /
• pp.492-504
• /
• 2009

The delivery of multimedia that efficiently adapts its bit-rate to changing network characteristics and conditions is one of the important challenging tasks in the design of today's real-time multimedia streaming systems such as IPTV, Mobile IPTV and so on. In these work, the primary focus is on network congestion, to improve network stability and inter-protocol fairness. However, these existing works have problems which do not support QoE (Quality of Experience), because they did not consider essential characteristics of contents playback such as the media continuity. In this paper, we propose a novel rate control scheme for improving the QoE of multimedia streaming service in the Internet congestion, called NCAR (Network and Client-Aware Rate control), which is based on network-aware congestion control and client-aware flow control scheme. Network-aware congestion control of the NCAR offers an improving reliability and fairness of multimedia streaming, and reduces the rate oscillation as well as keeping high link utilization. Client-aware flow control of NCAR offers a removing the media discontinuity and a suitable receiver buffer allocation, and provides a good combination of low playback delay. Simulation results demonstrate the effectiveness of our proposed schemes.

• Journal of Advanced Navigation Technology
• /
• v.19 no.5
• /
• pp.423-432
• /
• 2015

This paper shows that design, manufacture and the performance of FC-NIC (fibre channel network interface card) for network unit configuration which is based on one of the 5 main configuration items of the common functional module for IMA (integrated modular Avionics) architecture. Especially, FC-NIC uses zynq SoC (system on chip) for host load reductions. The host merely transmit FC destination address, source memory location and size information to the FC-NIC. After then the FC-NIC read the host memory via DMA (direct memory access). FC upper layer protocol and sequence process at local processor and programmable logic of FC-NIC zynq SoC. It enables to free from host load for external communication. The performance of FC-NIC shows average 5.47 us low end-to-end latency at 2.125 Gbps line speed. It represent that FC-NIC is one of good candidate network for IMA.

• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.573-582
• /
• 2002

We propose centralized server based QoS routing schemes, where a route server is responsible for determining QoS paths on behalf of all the routers in a routing domain. In the proposed server based schemes, the dynamic link QoS state information, which is required for a QoS path computation, is implicitly maintained at route server as it assigns or gets back QoS paths. By maintaining the network state information this way, we may not only eliminate the overhead to exchange network state update message but also achieve higher routing performance by utilizing accurate network state information in path computation. We discuss path caching techniques for reducing the amount of path computation overhead at the route server, and evaluate the performance of the proposed schemes using simulation. The simulation results show that the path caching schemes may significantly reduce the route server load. The proposed schemes are also compared to the distributed QoS routing schemes proposed in the literature. It has been shown that the proposed server based schemes not only enhance the routing performance, but they are also competitive with respect to routing overheads.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.262-276
• /
• 2001

Recently much research for developing forwarding table that support fast router without employing both special hardware and new protocols. This article introduces a new forwarding data structure based on the software to enable forwarding lookup to be penormed at giga-bit speed. The forwarding table is known as a bottleneck of the routers penormance due to its high complexity proportional to the forwarding table size. The recent research that based on the software uses a Patricia trie and its variants. and also uses a hash function with prefix length key and others. The proposed forwarding table structure construct a forwarding table by the bit stream array in which it constructs trie from routing table prefix entries and it represents each pointer pointing the child node and the associated forwarding table entry with one bit The trie structure and routing prefix pointer need a large memory when representing those by linked-list or array. but in the proposed data structure, the needed memory size is small enough since it represents information with one bit. Additionally, by use a lookup method that start searching at desired middle level we can shorten the search path. The introduced data structure. called bit-map trie shows that we can implement a fast forwarding engine on the conventional Pentium processor by reducing the backbone routing table fits into Level 2 cache of Pentium II processor and shortens the searching path. Our experiments to evaluate the performance of proposed method show that this bit-map trie accomplishes 5.7 million lookups per second.

• Journal of Navigation and Port Research
• /
• v.43 no.6
• /
• pp.403-412
• /
• 2019

The characteristics of the manoeuvring motion of a ship are dependent on the ship type, as well as draft or speed in the same ship. In recent years, the number of extra-large vessels has increased significantly, which can cause enormous material and environmental damage in the event of a marine accident. Thus, the importance of ship maneuvering is increasing. The IMO has forced the officers to be trained in simulators through the STCW 95 amendment. However, FMSS is costly and difficult to access and the PC-based simulator has the disadvantage that only one person can engage in simulation. The purpose of this study was to solve the shortcomings of the FMSS and PC-based simulators by enabling multiple people to use their PCs to simulate based on a network. The simulator is implemented through the analysis and numerical calculation of the Nomoto model, Radar function mounting, data transfer protocol design, and GUI building. To verify the simulator, the simulation results were compared and analyzed with the test results of T.S. HANBADA according to the criteria of the Korean Register of Shipping(KR) and IMO standards for ship maneuverability. As a result, It showed a relative error of 0%~ 32.1% with an average of 13.7%, and it satisfied the IMO criteria for ship maneuverability.