• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.12C
• /
• pp.1245-1250
• /
• 2002

For recent years, the environment of use on internet has been changed from the wired internet access to the wireless internet access increasingly, and the use of real time application data has been increased. Therefore the research and evolution of wireless network for providing of user's mobility and QoS at the same time must be essential. IETF already proposed Mobile IPv6 for providing mobility and RSVP for QoS through resource reservation. These future are expected to be used not only wired network but also wireless network. But there are not yet proposed the integration and efficient interworking of two mechanism. For the solution of problem on efficient interworking issue, for instance signaling overhead and reservation delay increasing due to often handoff, this paper first proposed to use of IETF Cellular IP based on Mobile IPv6 for wireless network model with fast mobility and a improved RSVP mechanism using the flow label field in IPv6 header.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.621-630
• /
• 2003

In this paper, we implemented SIP protocol that supports IPv6 and differentiated call processing scheme for NGN(Next Regeneration Network). In NGN, SIP processes call signaling among various application services. A softswitch and SIP server must give priority to sensitive services such as Fax, network management and home networking that require a fast call setup time. Also, the support of IPv6 is needed under consideration of All-IP. We proposed differentiated call processing scheme. The differentiated call processing scheme supports differentiated call processing as priority of service class on call processing in SW server We defined three service classes and use the Flow Label field of the IPv6 header for setting service class. Through the performance analysis, we proved that it improves throughput for call message with the high priority. The result of performance analysis demonstrates that differentiated call processing scheme gives better performance for the service requiring a fast session establishment in NGN.

• ETRI Journal
• /
• v.24 no.1
• /
• pp.43-55
• /
• 2002

This paper proposes a flow-based admission control algorithm through an Asynchronous Transfer Mode (ATM) based Multi-Protocol Label Switching (MPLS) network for multiple service class environments of Integrated Service (IntServ) and Differentiated Service (DiffServ). We propose the Integrated Packet Scheduler to accommodate IntServ and Best Effort traffic through the DiffServ-aware MPLS core network. The numerical results of the proposed algorithm achieve reliable delay-bounded Quality of Service (QoS) performance and reduce the blocking probability of high priority service in the DiffServ model. We show the performance behaviors of IntServ traffic negotiated by end users when their packets are delivered through the DiffServ-aware MPLS core network. We also show that ATM shortcut connections are well tuned with guaranteed QoS service. We validate the proposed method by numerical analysis of its performance in such areas as throughput, end-to-end delay and path utilization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.240-248
• /
• 2002

This paper presents a new motion-based segmentation algorithm of moving objects in image sequences. The procedure toward complete segmentation consists of two steps: pixel labeling and motion segmentation. In the first step, we assign a label to each pixel according to magnitude of velocity vector. And velocity vector is generated by optical flow. And, in the second step, we have modeled motion field as a markov random field for noise canceling and make a segmentation of motion through energy minimization. We have demonstrated the efficiency of the presented method through experimental results.

• Korean Journal of Optics and Photonics
• /
• v.20 no.1
• /
• pp.16-22
• /
• 2009

We propose a method to convert a two-dimensional movie to a three-dimensional movie using normalized cut and optical flow. In this paper, we segment an image of a two-dimensional movie to objects first, and then estimate the depth of each object. Normalized cut is one of the image segmentation algorithms. For improving speed and accuracy of normalized cut, we used a watershed algorithm and a weight function using optical flow. We estimate the depth of objects which are segmented by improved normalized cut using optical flow. Ordinal depth is estimated by the change of the segmented object label in an occluded region which is the difference of absolute values of optical flow. For compensating ordinal depth, we generate the relational depth which is the absolute value of optical flow as motion parallax. A final depth map is determined by multiplying ordinal depth by relational depth, then dividing by average optical flow. In this research, we propose the two-dimensional/three-dimensional movie conversion method which is applicable to all three-dimensional display devices and all two-dimensional movie formats. We present experimental results using sample two-dimensional movies.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.215-217
• /
• 2004

In wireless sensor networks, fair allocation of bandwidth among different nodes is one of the critical problems that effects the serviceability of the entire system. Fair bandwidth allocation mechanisms, like fair queuing, usually need to maintain state, manage buffers, and perform packet scheduling on a per flow basis, and this complexity may prevent them from being cost-effectively implemented and widely deployed. It is a very important and difficult technical issue to provide packet scheduling architecture for fairness in wireless sensor networks. In this paper, we propose an packet scheduling architecture for sensor node, called FISN (Fairness Improvement Sensor Network), that significantly reduces this implementation complexity yet still achieves approximately fair bandwidth allocations. Sensor node for sensing estimate the incoming rate of each sensor device and insert a label into each transmission packet header based on this estimate. Sensor node for forwarding maintain no per flow state; they use FIFO packet scheduling augmented by a probabilistic dropping algorithm that uses the packet labels and an estimate of the aggregate traffic at the gathering node. We present the detailed design, implementation, and evaluation of FISN using simulation. We discuss the fairness improvement and practical engineering challenges of implementing FISN in an experimental sensor network test bed based on ns-2.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.967-974
• /
• 1998

Access control scheme of the firewall systems protects the systems from threats by using the conventional discretionary access control mechanism. The discretionary access control mechanism is insufficient to control secure information flow on the multievel network. Thus, it is necessary to provide the mandatory access control mechanism to the firewall systems for the multilevel security environment. In this paper, we present a design scheme of the security mechanisms concerning the sensitivity label and the mandatory access control for securely processing the multilevel information.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.06a
• /
• pp.265-269
• /
• 2001

멀티캐스트 라우팅 데몬은, 패킷 포워딩이 가능한 호스트 상에서 작동하여 호스트를 멀티캐스트 라우팅이 가능한 라우터로 만들어주는 역할을 하는 응용 프로그램이다. 현재의 리눅스 IP$_{v}$ 6 멀티캐스트 환경을 살펴보면 로컬 네트워트 상에서의 멀티캐스트 통신만을 지원하도록 되어있다. 즉 서로 다른 서브넷 상에 존재하는 호스트들 사이에서는 멀티캐스트 통신을 할 수 없다. 따라서, 본 논문에서는 리눅스 IP$_{v}$ 6 환경에서 멀티캐스트 라우팅이 가능하도록 IP$_{v}$ 6용 멀티캐스트 라우팅 데몬을 구현하였다. 멀티캐스트 라우팅이 가능하기 위해서는 두가지 문제가 해결되어야 하는데 첫째는 멀티캐스트 라우팅 정보를 주고받는 데몬 프로그램이고, 둘째는 데몬이 주고받은 라우팅 정보를 이용하여 멀티캐스트 패킷을 포워딩하는 커널 포워딩 루틴이다. 이 두가지가 본 논문에서 중심으로 다룰 내용이다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.553-555
• /
• 2001

Markov Random Fields(MRF) 모델은 영상 분할 및 복원 등에 주로 사용되는 확률적 영상모델이다. 본 논문에서는 MRF 모델을 3차원으로 확장하여 분할을 위한 선 필드 모델(Line Field Model)과 움직임 검출을 위한 움직임 필드 모델(Motion Field Model)을 도입하여 동영상 내에서 움직이는 물체의 형상과 움직임을 추정한다. 제안된 방법을 이용하여 한국어 수화 동작에서 손의 형상과 이동방향을 검출하였다. 그 결과 optical flow를 사용하는 방법에 비해서 이동 방향이 왜곡되는 것을 방지하여 보다 정확한 이동 방향을 검출할 수 있었다. 또한 영상 추출의 경우에 있어서도 형상의 윤곽면과 내부가 하나의 라벨(label)로 묶이기 때문에 보다 깨끗한 영상을 추출할 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.334-336
• /
• 2000

IPv6는 IPv4의 단점을 보완한 차세대 인터넷 프로토콜이다. IPv6 헤더는 플로우 레이블 필드를 제공하여 레이블 값에 따라 차등적인 서비스를 제공할 수 있는 기반을 갖추었다. 본 논문에서는 이러한 레이블의 용도 외에 레이블을 이용한 포워딩 방법을 제안한다. 레이블을 이용한 포워딩은 기존의 MPLS 와 유사한 방식으로 이루어진다. 두 방법의 차이점은, 첫째 MPLS는 속도를 빠르게 하기 위하여 대부분의 스위칭이 2 계층에서 이루어지지만 플로우 레이블을 이용한 방법은 3 계층에서 처리된다. 둘째, 패킷에 플로우 레이블을 기록할 때 기존의 IPv6 헤더 필드를 이용하기 때문에 MPLS에서와 같이 별도의 헤더가 필요치 않다. 또한, 레이블과 플로우에 대한 서비스 정보를 매핑시킬 경우 좀더 수월하게 차등적 서비스를 지원할 수 있다. 본 논문에서는 IPv6 레이블 포워딩을 구현해서 실험한 실험 망과 현재 리눅스 커널(2.2.X)상에서 구현되어있는 IPv6의 포워딩 구조, 그리고 구현된 플로우 레이블 포워딩에 대하여 논한다.