• Journal of Advanced Navigation Technology
• /
• v.10 no.1
• /
• pp.70-78
• /
• 2006

This paper has addressed the scheme to design single rate Rate Adaptive Shaper (srRAS) proposed in RFC2963. srRAS is the shaper used in conjugation with downstream single rate Three Color Marker (srTCM) described in RFC269. it is tail-drop First Input First Out (FIFO) queue that is drained at a variable rate. srTCM meters IP packet streams from srRAS and marks its packets to be either green, yellow, or red. This shaper has been proposed to use at the ingress of differentiated services networks providing AF PHB. And then srRAS can reduce the burstiness of the upstream traffic of srTCM. This paper addresses algorithm, architecture of srRAS, and the scheme to implement srRAS using Field-Programmable Gate Arrays (FPGA) and the related technology.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.10A
• /
• pp.990-999
• /
• 2002

The object-oriented(OO) distributed real-time(RT) programming movement started in 1990's and is growing rapidly at this turn of the century. Distributed real-time simulation is a field in its infancy but it is bounded to receive steadily growing recognition for its importance and wide applicability. The scheme is called the distributed time-triggered simulation scheme which is conceptually simple and easy to use but widely applicable. A new generation object oriented(OO) RT programming scheme is called the time-triggered message triggered object(TMO) programming scheme and it is used to make specific illustrations of the issues. The TMO structuring scheme is a general-style components structuring scheme and supports design of all types of component including hard real time objects and non real time objects within one general structure.

• 한국ITS학회:학술대회논문집
• /
• v.2007 no.10
• /
• pp.7-10
• /
• 2007

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.4
• /
• pp.729-739
• /
• 1994

In a centralized spread-spectrum packet radio network, a random assignment -transmitter-based spreading code protocol(RA-T) is proposed which permits the contention mode only in the trasmission of a preamble while avoiding collision during the data packet transmission by assigning near-orthogonal spreading codes to each user. Compared to the conventional transmitter-based code scheme, this scheme allows reduction in receiver complexity when only a small number of distinct spreading codes are employed for the preamble transmission. Throughout theoretical and simulation results, it is shown that the use of the RA-T scheme with just two or three distinct codes for the preamble packet achieves most of the performance gain.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1843-1846
• /
• 2002

The object-oriented(OO) distributed real- time(RT) programming movement started in 1990’s and is growing rapidly at this turn of the century Distributed real-time simulation is a field in its infancy but it is bounded to receive steadily growing recognition for its importance and wide applicability. The scheme is called the distributed time-triggered simulation scheme which is conceptually simple and easy to use but widely applicable. A new generation object oriented(00) RT programming scheme is called the time-triggered message triggered object(TMO) programming scheme and it is used to make specific illustrations of the issues. The TMO structuring scheme is a general-style components structuring scheme and supports design of all types of component including hard real time 1 objects and non real time objects within one general structure.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.156-164
• /
• 2006

The SCTP (Stream Control Transmission Protocol) implementation with the DAR (Dynamic Address Reconfiguration) extension is called the mSCTP (Mobile SCTP) that is proposed recently for mobility support in transport layer. The mSCTP does not satisfy short handover latency for real-time applications and it has no specific handover decision mechanisms. In this paper, we propose fast handover schemes for mobile nodes that are moving into different subnet using pre-acquisition RA (Router Advertisement) and L3 trigger for improving handover performance. Furthermore, we introduce three specific methods which are RA cache, FMIPv6 (Fast Handovers for Mobile IPv6) and dual interface and how proposed scheme can be interoperated with handover process respectively. Finally, we show two experimental results which are the mSCTP and the mSCTP using FMIPv6 on Linux platforms. Experimental results show that handover performance is improved with reducing the time of receiving RA which takes most of total handover latency.

• Convergence Security Journal
• /
• v.16 no.7
• /
• pp.159-165
• /
• 2016

Through the NFV (Network Function Virtualization), companies such as network service providers and carriers have sought to dramatically reduce CAPEX / OPEX by improving the speed of new service provisioning and flexibility of network construction through the S/W-based devices provided by NFV. One of the most important considerations for establishing an NFV network to provide dynamic services is to determine how to dynamically allocate resources (VNFs), the basic building blocks of network services, in the right place. In this paper, we analyzed the latest research trends on VNF node, link allocation, and scheduling in nodes that are required to provide arbitrary NS in NFV framework. In this paper, we also propose VNF scheduling problems that should be studied further in RA (Resource Allocation).

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.4
• /
• pp.569-574
• /
• 2017

In order to transmit information in a channel environment in which noise exists, a coding technique of information is required. One of the coding techniques used for error detection and correction close to the Shannon limit is Low Density Parity Code(LDPC). LDPC and decoding characteristic features by Sum-product algorithm are matched for the performance to Turbo Code, RA(Repeat Accumulate) code, in case of very long code length of LDPC surpass their performance. This paper explains LDPC coding scheme of image data and decoding scheme, implements LDPC decoder in FPGA.

• The Journal of Information Technology
• /
• v.5 no.4
• /
• pp.165-171
• /
• 2002

We propose Dynamic Circle Location Register (DCLR) scheme where each visiting location register (VLR) has a given fixed circle registration area around itself and has IDs of other VLRs in this circle area. Whenever a terminal moves to another registration area (RA), system computes whether the terminal is located in the current DCLR area and sends the recent location information of terminal to the old or new DCLR according to computing results. Also, according to change DCLR circle dynamically, we can track terminal location by querying DCLR of the current terminal when a call originates. The our scheme solves the HLR bottleneck due to the terminals frequent RA crossings and distributes the registration traffic to each of the local signaling transfer point (LSTP) area in wireless communications (WC)

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.887-890
• /
• 2009

To transmit information over a channel in the presence of noise, there needs some technique to code the information. One of the coding techniques used for error detection and correction close to the Shannon limit is Low Density Parity Code. LDPC and decoding characteristic features by sum-product algorithm are matched for the performance to Turbo Code, RA(Repeat Accumulate) code, in case of very long code length of LDPC surpass their performance. This paper explains LDPC coding scheme of image data and decoding scheme, implements LDPC decoder in FPGA.