• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.221-224
• /
• 2000

The issue of supporting TCP traffic over ATM networks is currently one of the most important issues in the field of data networks. One important part of this issue is congestion control. In general, congestion control uses method such as packet drop to relieve network resource when the network is congested so as to maintain high throughput and low delay. In addition, congestion control is required to ensure fair sharing of resources among all users during congestion. In this paper we propose a new congestion control method using WRED & per-VC accounting mechanism. This packet discard scheme is proposed with the goal to provide both good performance in terms of throughput and fairness in terms of bandwidth exploitation of the output link among all virtual circuits.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.86-88
• /
• 2004

As the rapid incensement of the number of internet users has occurred recently, many multimedia application services have been emerging. To improve quality of service, traffic can be suggested to be classified with priority in EPON(Ethernet Passive Optical Network), which is supporting the multimedia application services. In this paper, multimedia application services treat bandwidth classifying device in serving both delay sensitive traffic for real-time audio, video and voice data such as VoIP(Voice over Internet Protocol), and nonreal-time traffic such as BE(Best Effort). With looking through existing mechanisms, new mechanism to improve the quality will be suggested. The delay performances and packet losses of traffic achieved by supporting bandwidth allocation of upstream traffic in suggested mechanism will be analyzed with simulation.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.119-120
• /
• 2008

본 논문에서는 ECMA 표준에 기반한 multi-gigabit packet 수신기를 위한 프레임 검출 방안을 제안한다. ECMA 표준은 60 GHz 대역에서 multi-gigabit 전송률을 달성하기 위하여 버스트 (burst) 송수신 방식을 사용하며 프리앰볼 (preamble)과 데이터 (data)로 이루어진 프레임 (frame)을 통하여 데이터 송수신이 이루어진다. 본 논문에서는 ECMA 표준 중 DBPSK (Differential Binary Phase Shift Keying)와 DQPSK (Differential Quadrature Phase Shift Keying) 그리고 OOK (On-Off Keying) 변조 방식을 지원하는 multi-gigabit 송수신 시스템을 위한 프레임 검출기를 설계하였다. 설계된 프레임 검출기는 동일한 구조 및 동작 방식을 통하여 고려한 모든 변조 방식들을 지원할 수 있을 뿐만 아니라 하드웨어 구현 복잡도가 낮은 장점을 지닌다.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.594-596
• /
• 1999

It is extremely important to compress a very large multimedia data under the currently used communication networks because of the forthcoming high fast multimedia informations. Wavelets are very popular and useful mathematical tool in the field of signal processing recently. In this paper, signal compression methods using the wavelet packet transform are compared with the other compression method under same threshold condition. As the result, the compression of using the wavelet packet transform is much more effective than the other compressing methods.

• Proceedings of the IEEK Conference
• /
• 2002.06b
• /
• pp.205-208
• /
• 2002

An existing ATM switch fabric uses VPI(Virtual Path Identifier) and VCI(Virtual Channel Identifier) information to route ATM cell. But AAL type 2 switch which efficiently processes delay-sensitive, low bit-rate data such as a voice routes the ATM cell by using CID(Channel Identification) field in addition to VPI and VCI. In this paper, we research the AAL type 2 switch that performs the process of CPS packet. The Receive unit extracts the CPS packet from the inputted ATM cell. The designed receive unit consists of input FIFO, r)( status table, CAM(Content Addressable Memory), new CID table and partial packet memory. Also the designed receive unit supports the PCI interface with host processor. The receive unit is implemented in Xilinx FPGA and operates at 72MHz.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2327-2330
• /
• 2003

This paper deals with face detection and recognition using ellipsodal information and wavelet packet analysis. We proposed two methods. First, Face detection method uses general ellipsodal information of human face contour and we find eye position on wavelet transformed face images A novel method for recognition of views of human faces under roughly constant illumination is presented. Second, The proposed Face recognition scheme is based on the analysis of a wavelet packet decomposition of the face images. Each face image is first located and then, described by a subset of band filtered images containing wavelet coefficients. From these wavelet coefficients, which characterize the face texture, the Euclidian distance can be used in order to classify the face feature vectors into person classes. Experimental results are presented using images from the FERET and the MIT FACES databases. The efficiency of the proposed approach is analyzed according to the FERET evaluation procedure and by comparing our results with those obtained using the well-known Eigenfaces method. The proposed system achieved an rate of 97％(MIT data), 95.8％(FERET databace)

• 한국정보통신설비학회:학술대회논문집
• /
• 2006.08a
• /
• pp.43-46
• /
• 2006

IEEE 802.16 WirelessMAN aiming to broadband wireless access (BWA) is evolving to 4G mobile communication system through the standardization of IEEE 802.16e supporting mobility on existing fixed WirelessMAN system. It is necessary for hand-over to provide seamless data service while MS (Mobile Station) moves to another BS (Base Station). Because the performance of handover affects packet loss or delay of any communications, it must consider low latency handover mechanism in packet based network. In this paper, we describes handover scheme of IEEE 802.16e with the cell edge interference problem and shows the way to solve the problem in frequency reuse one deployment. Our scheme reduces the handover latency and packet loss probability.

• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.660-664
• /
• 2010

This paper proposes a backoff control scheme for guaranteeing fair packet transmissions in TDMA wireless networks. In order to maximize the system performance, the number of packets transmitted in a frame should be kept at a proper level. In the proposed scheme, the base station calculates the packet transmission probability according to the offered loads and then broadcasts to all the mobile stations. Mobile stations attempt to transmit a packet with the received probability. Simulation results show that the proposed scheme can offer better system throughput and delay performance than the conventional one regardless of the offered loads.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4451-4466
• /
• 2014

We present joint radio selection and relay scheme that delivers data from a source to a sink in heterogeneous stationary sensor networks consisting of various radio interfaces. The proposed scheme finds the optimal relay nodes and their corresponding radio interfaces that minimize energy consumption throughout the network while satisfying the end-to-end packet deadline requirement. We formulate the problem of routing through radio interface selection into binary integer programs, and obtain the optimal solution by solving with an optimization solver. We examine a trade-off relationship between energy consumption and packet delay based on network level simulations. We show that given the end-to-end deadline requirement, our routing algorithm finds the most energy-efficient routing path and radio interface across mesh hops. We demonstrate that the proposed routing scheme exploits the given packet delivery time to turn into network benefit of reducing energy consumption compared to routing based on single radio interface.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.2
• /
• pp.82-102
• /
• 2008

Packet losses tend to occur during short error bursts separated by long periods of relatively error-free transmission. There is also a significant spatial correlation in loss among the receiver nodes in a multicast session. To recover packet transmission errors at the transport layer, tree-based protocols construct a logical tree for error recovery before data transmission is started. The current tree construction scheme does not scale well because it overloads the sender node. We propose a scalable recovery tree construction scheme considering these properties. Unlike the existing tree construction schemes, our scheme distributes some tasks normally handled by the sender node to specific nodes acting as repair node distributors. It also allows receiver nodes to adaptively re-select their repair node when they experience unacceptable error recovery delay. Simulation results show that our scheme constructs the logical tree with reduced message and time overhead. Our analysis also indicates that it provides fast error recovery, since it can reduce the number of additional retransmissions from its upstream repair nodes or sender node.