• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.118-123
• /
• 2009

In this paper, we propose packet selection and significance based interval allocation algorithm for real-time streaming service. In real-time streaming of inter-frame (and layer) coded video, minimizing packet loss does not imply maximizing QoS. It is true that packet loss adversely affects the QoS but one single packet can have more impact than several other packets. We exploit the fact that the significance of each packet loss is different from the frame type it belongs to and its position within GoP. Using packet dependency and PSNR degradation value imposed on the video from the corresponding packet loss, we find each packet's significance value. Based on the packet significance, the proposed algorithm determines which packets to send and when to send them. The proposed algorithm is tested using publicly available MPEG-4 video traces. Our scheduling algorithm brings significant improvement on user perceivable QoS. We foresee that the proposed algorithm manifests itself in last mile connection of the network where intervals between successive packets from the source and to the destination are well preserved.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.1-10
• /
• 2009

In a network-based approach such as Proxy Mobile IPv6 (PMIPv6), the serving network controls the mobility management on behalf of a Mobile Node (MN), thereby eliminating a MN from any mobility-related signaling. Although PMIPv6 is being standardized by the IETF NetLMM WG, PMIPv6 still suffers from a lengthy handover latency and the on-the-fly packet loss during a handover. Therefore, this paper presents an enhanced fast handover scheme for PMIPv6. The proposed handover scheme uses the Neighbor Discovery message of IPv6 to reduce the handover latency and packet buffering at the Mobile Access Gateway (MAG) to avoid the on-the-fly packet loss during a handover. In addition, it uses an additional packet buffering at the Local Mobility Anchor (LMA) to solve the packet ordering problem. We evaluate the performance of the proposed handover scheme using both analytical model and simulation. The numerical analysis shows that the proposed scheme has a relatively shorter handover latency. Simulation results demonstrate that the proposed scheme could avoid the on-the-fly packet loss and ensure the packet sequence.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.9
• /
• pp.373-383
• /
• 2003

In this paper we discuss the effect of the delay limit and the packet size related to the quality of service on a VoIP system using the Internet. We also provide a guideline to determining the optimal packet size of the voice data for a given delay limit. Empirical studies are done with two personal computers connected through the packet switched public IP network. The sender encodes the voice signal from the microphone to get PCM and ADPCM data and sends the data to the receiver using UDP packets. The receiver plays the reconstructed voice from the stream with lost and delayed packets. The quality of the reconstructed voice is evaluated offline by the MNB (Measuring Normal Block) method using the data acquired from the both sides. The result shows that under the delay limit of 100ms for 40Kbps, 32Kbps and l6Kbps of ADPCM data, the minimum packet size should be 300bytes, 400bytes and 600bytes respectively and the maximum packet size should be l200bytes commonly for the best quality of voice.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.1
• /
• pp.69-76
• /
• 2010

We describe an all-optical circuit which recognizes the header information of packet-by-packet in the access networks based on FTTH. The circuit's operation is confirmed by an experiment in the recognition of 3 and 4 header bits. The output from the header recognition circuit appears in a signal assigned in the time axis according to the header information. The recognition circuit of header for self-routing has a very simple structure using only delay lines and switches. The circuit is expected that it can be constructed of the high reliability and the low cost. Also, the circuit can solve the problems of the power loss and private security which is the weak point of the TDM-PON method by being established a unique transmission line to each subscriber.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1045-1057
• /
• 1999

Packet-switched multistage interconnection networks(MINs) have been widely used for digital switching systems and super computers. In this paper we show that multiple packets in a switching element can move to the succeeding switching element in one network cycle by fully utilizing the cycle bandwidth. Only one packet movement was usually assumed in typical MINs. we present an analytical model for the MNs with the multiple packet movement scheme, and validate it by computer simulation. Comparisons with the traditional MINs of single packet movement reveal that the throughput is increased up to about 30% for practical size MINs. Similar result was also obtained for delays. The performance increase is more significant when the network traffic is nonuniform.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5A
• /
• pp.495-501
• /
• 2011

IEFT proposed MIPv6 for supporting IP movement. Mobile Node is involved signaling that cause handover latency in MIPv6. Recently, Proxy Mobile IPv6 is proposed by IETF for network-based mobility management to reduce overhead in mobile node still suffers from packet loss. PMIPv6 can decrease handover latency which related overhead in MN by using network agent. Therefore, MIPSHOP Working Group proposed fast handover for PMIPv6, fu this paper, we proposed packet bicasting scheme on dual interface mobile node that can support fast handover using PMIPv6 schemes. Further, a numerical analysis is provided to show the benefits of our scheme. In the analysis, various parameters are used to compare our scheme with another procedure.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.2
• /
• pp.67-75
• /
• 2005

In this paper, we design and implement real time IP security packet analyzer on IPv4 and IPv6 network. This packet analyzer sniffs and analyzes the packets generated by the protocols that are used by IPsec, IKE, IPv4 and IPv6 such as AH, ESP, ISAKMP, IP, ICMP and so on. The purpose of this analyzer is to check current security status of the network automatically. In this paper we provide implementation details and the examples of security evaluation by using our security packet analyzer system.

• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.319-326
• /
• 2004

To help network intrusion detection systems(NIDSs) keep up with the demands of today's networks, that we the increasing network throughput and amount of attacks, a radical new approach in hardware and software system architecture is required. In this paper, we propose a Network Processor(NP) based In-Line mode NIDS that supports the packet payload inspection detecting the malicious behaviors, as well as the packet filtering and the traffic metering. In particular, we separate the filtering and metering functions from the deep packet inspection function using two-level searching scheme, thus the complicated and time-consuming operation of the deep packet inspection function does not hinder or flop the basic operations of the In-line mode system. From a proto-type NP-based NIDS implemented at a PC platform with an x86 processor running Linux, two Gigabit Ethernet ports, and 2.5Gbps Agere PayloadPlus(APP) NP solution, the experiment results show that our proposed scheme can reliably filter and meter the full traffic of two gigabit ports at the first level even though it can inspect the packet payload up to 320 Mbps in real-time at the second level, which can be compared to the performance of general-purpose processor based Inspection. However, the simulation results show that the deep packet searching is also possible up to 2Gbps in wire speed when we adopt 10Gbps APP solution.

• ETRI Journal
• /
• v.39 no.4
• /
• pp.525-534
• /
• 2017

A hardware-acceleration architecture that separates virtual network functions (VNFs) and network control (called HSN) is proposed to solve the mismatch between the simple flow steering requirements and strong packet processing abilities of software-defined networking (SDN) forwarding elements (FEs) in SDN/network function virtualization (NFV) architecture, while improving the efficiency of NFV infrastructure and the performance of network-intensive functions. HSN makes full use of FEs and accelerates VNFs through two mechanisms: (1) separation of traffic steering and packet processing in the FEs; (2) separation of SDN and NFV control in the FEs. Our HSN prototype, built on NetFPGA-10G, demonstrates that the processing performance can be greatly improved with only a small modification of the traditional SDN/NFV architecture.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.691-693
• /
• 2004

Mobile Ad hoc network은 stationary infrastructure의 도움 없이 이동 노드들이 필요 시 multi-hop wireless links network 형태를 구성하여 통신이 이루어지게 하는 network이다. 따라서 효율적인 라우팅 프로토콜의 개발이 중요한 issue인데 최근에는 routing overhead가 적은 on-demand 프로토콜이 주목을 받고 있다. On-demand 프로토콜은 새로운 route을 구성하기 위해서 query packet을 broadcasting하게 되는데, 특히 노드들의 mobility가 많은 mobile ad hoc network(MANET)의 경우에는 더욱더 자주 발생하게 되는데, blind broadcasting은 neighbor 노드들 간의 radio transmission region overlap에 의해 redundancy, contention, collision 같은 broadcast storm 문제를 발생시키게 된다. 본 논문은 on-demand 프로토콜의 broadcast storm 문제를 해결하기 위해 Neighbor Topology을 고려 한 Dynamic Adaptation Query flooding scheme을 제시한다. 또한 Dynamic Adaptive Query flooding scheme은 broadcast storm 문제 해결뿐만 아니라 network의 congestion을 감소시켜 data packet의 성능 향상에도 기여 할 것이다.