• Journal of Advanced Navigation Technology
• /
• v.19 no.5
• /
• pp.423-432
• /
• 2015

This paper shows that design, manufacture and the performance of FC-NIC (fibre channel network interface card) for network unit configuration which is based on one of the 5 main configuration items of the common functional module for IMA (integrated modular Avionics) architecture. Especially, FC-NIC uses zynq SoC (system on chip) for host load reductions. The host merely transmit FC destination address, source memory location and size information to the FC-NIC. After then the FC-NIC read the host memory via DMA (direct memory access). FC upper layer protocol and sequence process at local processor and programmable logic of FC-NIC zynq SoC. It enables to free from host load for external communication. The performance of FC-NIC shows average 5.47 us low end-to-end latency at 2.125 Gbps line speed. It represent that FC-NIC is one of good candidate network for IMA.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.181-190
• /
• 2002

IEEE1394 is a de facto standard for the home network interfaces of digital multimedia home devices including digital A/V systems, digital camcorders, and PCs. Recently, it has been used in applications to guarantee the real-time characteristics such as home automation system and IICP (Instrument and Industrial Control Protocol). In order to guarantee real-time requirements in these IEEE1394-based real-time applications, this thesis proposes the software architecture of an IEEE1394 based home network that supports the guarantee for service's react-time characteristics. The proposed architecture has a real-time IEEE1394 device driver and event service architecture for guarantee real-time characteristics. The real-time device driver supports priority-based queueing of packets and mechanism to reduce the interrupt latency time in ISR. The event service architecture supports a real-time events delivery based on home network service using real-time event channel. This architecture can accommodate the real-time requirements of various applications and services such as digital multimedia services with QoS guarantees. home automation system required real-tine characteristics.

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

Several nv6 mobility support protocols for mobile Internet services are proposed in IETP : Mobile Ipv6, Hierarchical Mobile Ipv6, and Fast Handovers over Mobile Ipv6. Recently, IEEE 802.11 network has also been widely deployed in public areas for mobile Internet services. In the near future, IPv6 mobility support over IEEE 802.11 network is expected to be a key function to actualize the All If-based mobile various services. For appropriate application of these protocols, the IPv6 mobility support protocols should be analyzed according to their characteristics in terms of signaling, handover latency, lost packets, and required buffer sire as well as the impact of lower layer such as IEEE 802.11 network. In this paper, we analyze the performance of the protocols over IEEE 802.11 network. We define a packet-level traffic model, a network system model, and a mobility model. From these models, we construct a framework for the performance analysis. We also make cost functions to formalize each protocol's performance. Lastly, we analyze the effect of varying parameters used to show diverse numerical results, and compare with each other. From the analysis results, it is concluded that each Protocol has contrary or contrastive advantages with other Protocols, so there is no protocol that holds a dominant position.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11C
• /
• pp.1077-1087
• /
• 2003

In this paper, we proposed an architecture of a cryptosystem with various operating modes for the network security and implemented in hardware using the ASIC library. For configuring a cryptosystem, the standard block ciphers such as AES, SEED and 3DES were included. And the implemented cryptosystem can encrypt and decrypt the data in real time through the wired/wireless network with the minimum latency time (minimum 64 clocks, maximum 256 clocks). It can support CTR mode which is widely used recently as well as the conventional block cipher modes such as ECB, CBC and OFB, and operates in the multi-bit mode (64, 128, 192, and 256 bits). The implemented hardware has the expansion possibility for the other algorithms according to the network security protocol such as IPsec and the included ciphering blocks can be operated simultaneously. The self-ciphering mode and various ciphering mode can be supported by the hardware sharing and the programmable data-path. The global operation is programmed by the serial communication port and the operation is decided by the control signals decoded from the instruction by the host. The designed hardware using VHDL was synthesized with Hynix 0.25$\mu\textrm{m}$ CMOS technology and it used the about 100,000 gates. Also we could assure the stable operation in the timing simulation over 100㎒ using NC-verilog.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.625-634
• /
• 2003

More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.

• Journal of Advanced Navigation Technology
• /
• v.10 no.2
• /
• pp.120-127
• /
• 2006

Data-caching of a client is an important technology for interaction with a server where data are cached and operated at the client node. Caching reduces network latency and increases resource utilization at the client. In a Client-server environment, the absence of cache consistency algorithm, we cannot guarantee the correctness of client applications. In this paper, we propose a new asynchronous avoidance-based cache consistency algorithm. We remove the additional callback due to the lock escalation in AACC. With a comprehensive performance analysis, we show that the proposed algorithm has less message exchange than the AACC. One-copy serializability is used for proving correctness of the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7B
• /
• pp.991-1000
• /
• 2010

The Hierarchical Mobile IPv6 (HMIPv6) has been proposed to accommodate frequent mobility of the Mobile Node. HMIPv6 can effectively reduce the signaling overhead and latency. However, it has a problem that the registration of a mobile node concentrates on the furthest MAP(Mobility Anchor Point) when the mobile node enters into a new domain. This paper proposes a new load distribution mechanism by using the concept of Nash Bargaining Solution. The main advantage of the proposed scheme can prevent load concentration from being registered to the specified MAP based on the weight value according to the available resource-ratio of a MAP. With a simulation study, the proposed scheme can improve network performance under widely diverse traffic load intensities.

• Journal of Internet Computing and Services
• /
• v.21 no.4
• /
• pp.51-57
• /
• 2020

Currently, High-efficient video coding (HEVC) has become the most promising video coding technology. However, the implementation of HEVC in video streaming systems is restricted by factors such as cost, design complexity, and compatibility with existing systems. While HEVC is considering deploying to various systems with different reached methods, H264/AVC can be one of the best choices for current video streaming systems. This paper presents an adaptive method for manipulating video streams using video coding on an integrated circuit (IC) designed with a private network processor. The proposed system allows to transfer multimedia data from cameras or other video sources to client. For this work, a series of video or audio packages from the video source are forwarded to the designed IC via HDMI cable, called Tx transmitter. The Tx processes input data into a real-time stream using its own protocol according to the Real-Time Transmission Protocol for both video and audio, then Tx transmits output packages to the video client though internet. The client includes hardware or software video/audio decoders to decode the received packages. Tx uses H264/AVC or HEVC video coding to encode video data, and its audio coding is PCM format. By handling the message exchanges between Tx and the client, the transmitted session can be set up quickly. Output results show that transmission's throughput can be achieved about 50 Mbps with approximately 80 msec latency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.1
• /
• pp.5-24
• /
• 2010

Data fusion is an attractive technology because it allows various trade-offs related to performance metrics, e.g., energy, latency, accuracy, fault-tolerance and security in wireless sensor networks (WSNs). Under a complicated environment, each sensor node must be equipped with more than one type of sensor module to monitor multi-targets, so that the complexity for the fusion process is increased due to the existence of various physical attributes. In this paper, we first investigate the process and performance of multi-attribute fusion in data gathering of WSNs, and then propose a self-adaptive threshold method to balance the different change rates of each attributive data. Furthermore, we present a method to measure the energy-conservation efficiency of multi-attribute fusion. Based on our proposed methods, we design a novel energy equilibrium routing method for WSNs, viz., multi-attribute fusion tree (MAFT). Simulation results demonstrate that MAFT achieves very good performance in terms of the network lifetime.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.659-668
• /
• 2006

Various schemes for mobility support are currently proposed in NGN. However the performance comparison of all existing schemes is not relatively examined as yet. Therefore, in this paper, we investigate the location registration and handover procedure of MIPv6, IP2, Q.MMF, IMS, compare and analyze the location registration time and cost and handover latency time using various performance parameters and simulation for the performance analysis. As a result of analysis, when Location Manager locates in the center of core network, IP2 showed better performance than other schemes.