• The KIPS Transactions:PartA
• /
• v.15A no.3
• /
• pp.161-166
• /
• 2008

In this paper, an efficient digit-serial systolic array is proposed for multiplication in finite field GF($2^m$) using the polynomial basis representation. The proposed systolic array is based on the most significant digit first (MSD-first) multiplication algorithm and produces multiplication results at a rate of one every "m/D" clock cycles, where D is the selected digit size. Since the inner structure of the proposed multiplier is tree-type, critical path increases logarithmically proportional to D. Therefore, the computation delay of the proposed architecture is significantly less than previously proposed digit-serial systolic multipliers whose critical path increases proportional to D. Furthermore, since the new architecture has the features of a high regularity, modularity, and unidirectional data flow, it is well suited to VLSI implementation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.111-118
• /
• 2008

RIA(Rich Internet Application) has the best User Interface and easy way to use. It is used in many Application System and Web Application. This Paper introduces a RIA technology for Implementation of u-Hospital Application. This System uses a history of customers in the hospital and question about diseases, so we can improve the satisfaction of service. This paper shows that the u-Hospital System using RIA is more fast and easy than HTML application. Because RIA has special features that data can be obtained from server without reloading entire page and every user interaction does not require web server response. The proposed technology can improve the efficient u-Hospital System because it can be extended to ubiquitous mobile application.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1B
• /
• pp.11-16
• /
• 2007

This paper describes the design and performance of a secure routing protocol with time-space cryptography for mobile ad-hoc networks. The proposed time-space scheme works in the time domain for key distribution between source and destination as well as in the space domain for intrusion detection along the route between them. For data authentication, it relies on the symmetric key cryptography due to high efficiency and a secret key is distributed using a time difference from the source to the destination. Also, a one-way hash chain is formed on a hop-by-hop basis to prevent a compromised node or an intruder from manipulating the routing information. In order to evaluate the performance of our routing protocol, we compare it with the existing AODV protocol by simulation under the same conditions. The proposed protocol has been validated using the ns-2 network simulator with wireless and mobility extensions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.3
• /
• pp.310-317
• /
• 1993

This paper presents a mechanism for improving performance of the IEEE 802.6 MAN(Metropolitan Area Network), a dual-bus structured high-speed communication network, by a more efficient use of bandwidth. The MAN protocol is able to handle various traffic and offers better transmission speed than the conventional LAN, but the unidirectional bus structure and propagation delay of request bits results in unfairness since higher nodes use more bandwidth. As the number of stations and the distances between them are increased, the problem becomes mere serious. As a solution, this paper presents a method that every station enables to identify the used slots, and that a specified class denoted 'erasure station' has with the functions of destination release, slot reuse. As a result, it is export to improve network bandwidth values of each station and the throughput and delay time was analytically analyzed, and it is shown that according to computer simulation results, this mechanism improves the network performance.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.419-428
• /
• 2001

Advances in circuit and integration technology are continuously boosting the speed of processors. One of the main challenges presented by such developments is the effective use of powerful processors in shared memory multiprocessor system. We believe that the interconnection problem is not solved even for small scale shared memory multiprocessor, since the speed of shared buses is unlikely to keep up with the bandwidth requirements of new powerful processors. In the past few years, point-to-point unidirectional connection have emerged as a very promising interconnection technology. The single slotted ring is the simplest form point-to-point interconnection. The main limitation of the single slotted ring architecture is that latency of access increase linearly with the number of the processors in the ring. Because of this, we proposed the dual slotted ring as an alternative to single slotted ring for cache-based multiprocessor system. In this paper, we analyze the proposed dual slotted ring architecture using new snooping protocol and enforce simulation to compare it with single slotted ring.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.281-286
• /
• 2002

In this paper we, implement LSB-first digit-serial systolic multiplier for computing modular multiplication $A({\times})B$mod G ({\times})in finite fields GF $(2^m)$. If input data come in continuously, the implemented multiplier can produce multiplication results at a rate of one every [m/L] clock cycles, where L is the selected digit size. The analysis results show that the proposed architecture leads to a reduction of computational delay time and it has more simple structure than existing digit-serial systolic multiplier. Furthermore, since the propose architecture has the features of regularity, modularity, and unidirectional data flow, it shows good extension characteristics with respect to m and L.

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

Network-based computing such as cluster computing requires a reliable high-speed transport protocol. TCP is a representative reliable transport protocol on the Internet, which implements many mechanisms, such as flow control, congestion control, and retransmission, for reliable packet delivery. This paper, however, finds out that Myrinet does not incur any packet losses caused by network congestion. In addition, we ascertain that Myrinet supports reliable and ordered packet delivery. Consequently, most of reliable routines implemented in TCP produce unnecessarily additional overheads on Myrinet. In this paper, we show that we can attain the reliability only by flow control on Myrinet and propose a new reliable protocol based on UDP named RUM (Reliable UDP on Myrinet) that performs a flow control. As a result, RUM achieves a higher throughput by 45% than TCP and shows a similar one-way latency to UDP.