• Journal of Internet Computing and Services
• /
• v.10 no.2
• /
• pp.133-141
• /
• 2009

A tag collision problem occurs when many tags are placed in a interrogation zone in RFID system. A tag collision problem is one of core issues and various protocols have been proposed to solve the collision problems. Generally tree-based protocols generate unique prefixes and identify tags with them as quick as possible. In this paper, we propose the QT-BCS protocol which decreases the identification time by reducing the number of query-response. The QT-BCS protocol makes a prefixes using time slot and bit change sensing unit. This protocol compares the current bit of tags until the current bit is differ from the previous one. When this occurs, all of the bits scanned so far are transferred to slot-0 and slot-1 depending on the first bit value in Reader. Consequently, this method can reduce the number of queries by tracing prefixes easily. Simulation result shows QT-BCS is more efficient in identifying tags than Query Tree and 4-ary Query Tree protocol.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.217-220
• /
• 2005

VoD 시스템의 병목현상의 주요원인은 저장장치 또는 네트워크 입출력으로 인한 대역폭 요구량과 디지털 비디오의 장시간 서비스로 인한 높은 대역폭 요구량 때문이다. 패칭은 멀티캐스트 사용하여 VoD 시스템의 병목 현상을 극복한 가장 효과적인 기술 중 하나이다. 본 논문에서는 클라이언트를 이용한 프리픽스 패칭 사용과 함께 서버로부터 정규 멀티캐스트 스트림을 사용하여 기존의 패칭 기법을 개선하기 위한 P2Prefix 패칭 기법을 제안한다. 제안된 기법에서 각 클라이언트는 동일한 비디오 스트림을 요청하는 다른 클라이언트에게 프리픽스 스트림을 제공하기 위한 패칭 서버로서의 역할을 한다. 그 결과, 서버 대역폭 요구량은 서버로부터 패칭 채널을 제거하는 것으로 줄일 수 있다. 성능 평가에서 본 논문에서 제안한 패칭 기법이 기존의 패칭 기법과 비교해 볼 때 서버 대역폭 요구를 줄일 수 있음을 보인다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8B
• /
• pp.541-548
• /
• 2005

IP lookup and forwarding process becomes the bottleneck of packet transmission as IP traffic increases. Previous hardware-based IP address lookup schemes using an index-based table are not memory-efficient due to sparse distribution of the routing prefixes. In this paper, we propose memory-efficient hardware based IP lookup scheme called set-associative IP address lookup scheme, which provides the same IP lookup speed with much smaller memory requirement. In the proposed scheme, an NHA entry stores the prefix and next hop together. The IP lookup procedure compares a destination IP address with eight entries in a corresponding set simultaneously and finds the longest matched prefix. The memory requirement of the proposed scheme is about $42\%$ of that of Lin's scheme. Thus, the set-associative IP address lookup scheme is a memory-efficient hardware based IP address lookup scheme.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2006.05a
• /
• pp.127-136
• /
• 2006

풍부한 주소 공간 이외 IPv6 프로토콜이 가지는 주요한 장점 중의 하나는 호스트들의 주소 자동설정 기능이다. 하지만 IPv6 호스트들의 주소 자동설정 기능에 비해 IPv6 라우터는 수동 설정이 필요하기 때문에 IPv6 네트워크는 여전히 수동으로 설정되어야 한다. 이러한 문제를 해결하기 위해 본 논문에서는 여러 개의 라우터와 LAN들로 구성되는 소규모 IPv6 네트워크 상의 모든 라우터들을 자동 설정할 수 있는 새로운 프로토콜을 제안한다. 제안된 라우터 자동설정 프로토콜은 네트워크의 모든 라우터들을 논리적인 계층 구조로 구성하고, ISP에서 할당된 IPv6 네트워크 프리픽스를 사용하여 내부 라우터들의 모든 프리픽스와 라우팅 정보를 자동 생성하고 전달할 수 있는 기능을 가진다. 본 논문에서 제안된 라우터 자동 설정 기능은 특히 홈 네트워크이나 여러 개의 LAN들로 구성되는 소규모 사무실 등의 전문 네트워크 관리자를 두기 힘든 환경에서 네트워크의 자동 설정을 위해 많이 활용되리라 기대된다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.125-128
• /
• 2007

최근 사용자의 멀티미디어 서비스 요구가 보편화되면서 네트워크에 걸리는 부하가 늘어나게 되었고, 사용자들이 미디어를 다운로드한 후 플레이하는 방법보다 스트리밍 서비스를 선호함에 따라 실시간성이 더욱 중요시되고 있다. 웹 서비스에 전통적으로 사용되는 프록시 서버는 네트워크의 가장자리에 위치하여 클라이언트와 서버 사이의 거리 때문에 발생하는 문제를 주로 해결한다. 하지만 고 대역폭과 긴 서비스 시간이라는 특징을 가지는 멀티미디어 스트리밍 서비스에서는 전통적인 웹 프록시의 장점을 제대로 활용하기 어렵다. 본 논문에서는 미디어 스트리밍 서비스에서 네트워크 트래픽을 감소시키고 서비스 지연시간을 줄이기 위한 새로운 캐슁 전략을 제안한다. 제안된 전략에서 프록시 서버는 미디어 데이터의 일부와 미디어의 프리픽스를 캐슁하여 클라이언트가 요청한 미디어를 바로 인접한 프록시에서 찾도록 하여, 고 대역폭을 사용하는 스트리밍 시스템에서 네트워크 부하와 초기 지연을 줄인다.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.427-432
• /
• 2005

Packet arrival rates in internet routers have been dramatically increased due to the advance of link technologies, and hence wire-speed packet processing in Internet routers becomes more challenging. As IP address lookup is one of the most essential functions for packet processing, algorithm and architectures for efficient IP address lookup have been widely studied. In this paper, we Propose an efficient I address lookup architecture which shows yeW good Performance in search speed while requires a single small-size memory The proposed architecture is based on multi-way tree structure which performs comparisons of multiple prefixes by one memory access. Performance evaluation results show that the proposed architecture requires a 280kByte SRAM to store about 40000 prefix samples and an address lookup is achieved by 5.9 memory accesses in average.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.165-173
• /
• 2006

Network Mobility Basic Support protocol enables mobile network to change their point of attachment to the Internet, but causes some problems such as suboptimal muting and multiple encapsulations. The proposed scheme, combining Prefix Delegation protocol with HMIPv6 concept can provide more effective route optimization and reduce the amount of packet losses and the burden of location registration for handoff. It also uses hierarchical mobile network prefix (HMNP) assignment and provides tree-based routing mechanism to allocate the location address of mobile network nodes (MNNs) and support micro-mobility. In this scheme, Mobility Management Router (MMR) not only maintains the binding informations for all MNNs in nested mobile networks, but also supports binding procedures to reduce the volume of handoff signals oyer the mobile network. The performance is evaluated using NS-2.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.333-340
• /
• 2004

In order that routers forward a packet to its destination, they perform IP address lookup which determines the next hop according to the packet's destination address. In designing high speed routers, IP address lookup is an important issue. In order to design high speed routers, this paper proposes a parallel IP lookup scheme which consists of several IP lookup engines without any modification of already fabricated indirect IP lookup chipsets. Also, we propose a simple rule for partitioning IP prefix entries In an overall forwarding table among several IP lookup engines. And we evaluate the performance of the proposed scheme in terms of the memory size required for storing lookup information and the number of memory accesses on constructing the forwarding table. With additional hardware logics, the proposed scheme can reduce about 30% of the required memory size and 80% of the memory access counts.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.389-396
• /
• 2009

In RFID systems, identifying the tag attached to the subject begins with the request from a reader. When the reader sends a request, multiple tags in the reader's interrogation zone simultaneously respond to it, resulting in collision. The reader needs the anti collision algorithm which can quickly identify all the tags in the interrogation zone. We propose the Anti Collision Algorithm using Parity Mechanism(ACPM). In ACPM, a collision can be prevented because the tags which match with the prefix of the reader's request respond as followings; the group of tags with an even number of 1's in the bits to the prefix + 2nd bits responds in slot '0', while the group of tags with an odd number of 1's responds in slot '1'. The ACPM generates the request prefix so that the only existing tags according to the response in the corresponding slot. If there are two collided bits in tags, then reader identify tags by the parity mechanism. That is, it decreases the tag identification time by reducing the overall number of requests.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.341-354
• /
• 2005

The main bottleneck for large scale VOD systems is bandwidth of storage or network I/O due to the large number of client requests simultaneously, and then efficient techniques are required to solve the bottleneck problem of the VOD system. Patching is one of the most efficient techniques to overcome the bottleneck of the VOD system through the use of multicast scheme. In this paper, we propose a new patching scheme, called P2P proxy patching, for improving the typical patching technique by jointly using the prefix caching and P2P proxy. In our proposed scheme, each client plays a role in a proxy to multicast a regular stream to other clients that request the same video stream. Due to the use of the P2P proxy and the prefix caching, the client requests that ive out of the patching window range can receive the regular stream from other clients in the previous patching group without allocating the new regular channels from the VOD server to the clients. In the performance study, we show that our patching scheme can reduce the server bandwidth requirement about $33\%$ less than that of the existing patching technique with respect to prefix size and request interval.