• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3A
• /
• pp.195-202
• /
• 2005

The third generation cellular system requires the seamless macro/micro mobility support. Mobile IP provides a simple and scalable macro mobility solution but lacks the support for fast handoff control in micro-domain. However, A lot of micro-mobility protocols have been proposed to complement the Mobile IP capability by providing the fast, seamless, and local handoff control. Cellular If also provides the seamless mobility support in limited geographical area. But semi-soft handoff mechanism of Cellular IP produces the packet loss and the duplication problem due to the difference of propagation delay between the new path and the old path. In this paper, we present an efficient handoff mechanism in micro-domain. The proposed handoff mechanism uses the SCD (Suitable Cross Delay) in order to minimize the packet loss and the duplication problem during the handoff. Also, the proposed mechanism is verified by the performance evaluation through the NS-2 Simulation.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.481-488
• /
• 2005

The Mobile W provides an efficient and scalable mechanism for host mobility within the Internet. However, the mobility implies higher security risks than static operations in fixed networks. In this paper, the Mobile IP has been adapted to allow AAA protocol that supports authentication, authorization, and accounting(AAA) for security and collection for accounting information of network usage by mobile nodes(MNs). For this goal, we Propose the boundary tone overlapped network structure while solidifying the security for the authentication of an MN. That is, the Proposed scheme delivers the session keys at the wired link for MN's security instead of the wireless one, so that it provides a fast and seamless handoff mechanism. According to the analysis of modeling result, the proposed mechanism compared to the existing session key reuse method is up to about $40\%$ better in terms of normalized surcharge for the handoff failure rate that considers handoff total time.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2815-2826
• /
• 2000

This paper describes the design and implementation of a CHILL Run-time System(CRS) that provides a running environments of real-time distributed software like as ATM switching software on host computers. To do this, we have proposed an execution model of real-time distributed CHILL proRrams and developed a CHS executinR the software of the execution model on host computers. Because CRS provides transparent runninR environments of target operating system, programmers are able to develop target system software without target system. As it provides an environment for multiple users running programs concurrently, it guarantees the improvement of program productivity. Originally, CRS has developed as a simulator of SROS. But it can be easily modified for other operating systems.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.61-64
• /
• 2007

MPLS networks architectures have been prevailed as scalable approach to provide quality of service in the Internet. Many researches have been mainly focused on scalability and multi-path calculation scheme for failure restoration. However, the MPLS network have an scalability problem about traffic, and the existing failure restoration methods are wasted resources, and it has the problem that loss of a packet by a lot of delay occurs in too. Therefore in this paper, we propose a H-MPLS (Hierachical-Multiprotocol Label Switching)network for rapidly failure restorations and effective management of network extended. The proposed H-MPLS Network apply LSP multi-path routing algorithm and consists of several MPLS. After comparing the performance among the existing failure restoration methods with various network models, we use NS simulator in order to analyze the performance. Finally, we present an improvement scheme of the efficiency and scalability.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.65-67
• /
• 2018

We introduce a system that detects smoking in a specific area. The proposed system is implemented on a wireless ad hoc network consisting of Raspberry Pi boards. It is more economical owing to low-cost device than commercial smoking monitoring system and is scalable than the existing system with single Raspberry Pi. In this paper, the probability density function of carbon monoxide concentration during smoking and non-smoking is approximated as Gauusian distribution, respectively, using data measured from sensors for a long time. Based on this, a maximum likelihood detection technique is adopted to estimate the smoking status by observing the concentration of carbon monoxide. We aim at improving the reliability by estimating the smoking status using the collected values from multiple sensors connected to the ad hoc network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.697-710
• /
• 2004

Differentiated services (DiffServ) model has been prevailed as a scalable approach to provide quality of service in the Internet. However, there are difficulties in providing the guaranteed service in terms of end-to-end systems since differentiated services network considers quality of service of aggregated traffic due to the scalability and many researches have been mainly focused on per hop behavior or a single domain behavior. Furthermore quality of service may be time varying according to the network conditions. In this paper, we study dynamic class mapping mechanism to guarantee the end-to-end quality of service for multimedia traffics with the minimum network cost over differentiated services network. The proposed algorithm consists of an effective implementation of relative differentiated service model, quality of service advertising mechanism and dynamic class mapping mechanism. Finally, the experimental results are provided to show the performance of the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.1032-1039
• /
• 2015

Service function chaining(SFC) defines the creation of network services that consist of an ordered set of service function. A multiple service function instances should be deployed across networks for scalable and fault-tolerant SFC services. Therefore, an incoming flows should be distributed to multiple service function instances appropriately. In this paper, we formulate the flow distribution problem in SFC aiming at minimizing the end-to-end flow latency under resource constraints. Then, we evaluate its optimal solution in a realistic network topology generated by the GT-ITM topology generator. Simulation results reveal that the optimal solution can reduce the total flow latency significantly.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.11-19
• /
• 2014

In this paper, a low complexity parallel sphere decoder algorithm is proposed for high-order MIMO system. It reduces the computational complexity compared to the fixed-complexity sphere decoder (FSD) algorithm by static tree-pruning and dynamic tree-pruning using scalable node operators, and offers near-maximum likelihood decoding performance. Moreover, it also offers hardware-friendly node operation algorithm through fixing the variable computational complexity caused by the sequential nature of the conventional SD algorithm. A Monte Carlo simulation shows our proposed algorithm decreases the average number of expanded nodes by 55% with only 6.3% increase of the normalized decoding time compared to a full parallelized FSD algorithm for high-order MIMO communication system with 16 QAM modulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.201-203
• /
• 2015

Recently, rapid innovation of Smartphone is changing the paradigm of our daily life. Smartphone users, opinion experts more than 99 percent of the economically active population is using, it has reached the saturation past the early stages of formation. Smartphone is equipped with a general purpose OS possible the implementation of high performance environment similar level as a personal computer. Also, it is a mobile communication terminal scalable which can be removed or installed various applications. Such extensibility, it is possible to use different applications through the Apps store. In addition, it is also possible various services which are location based service. In this research, we aim to analyze factors influencing of the multimedia function on continue using intention of Smartphone In addition, we aim to analyze the causal relationship from perceived value to continue using intention. This study suggests practical and theoretical implications based on the results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9B
• /
• pp.581-590
• /
• 2005

The IEEE 802.17 Resilient Packet Ring Working Group develops standards to support the development and deployment of Resilient Packet Ring networks in Local, Metropolitan, and Wide Area Networks for resilient and efficient transfer of data Packets at rates scalable to many gigabits Per second. It was known that the fairness algorithm of the IEEE 802.17 Resilient Packet Ring suffers from throughput degradation under an unbalanced overload. This Paper proposes a congestion release advertisement method to improve this throughput degradation and discusses its performance. Under the proposed method, a congested node decides whether its congestion is released or not. If released, it advertises the congestion release to upstream nodes, and then upstream nodes transmit their traffic without uy regulation. The proposed method is compatible with the legacy fairness algorithm.