• Journal of Internet Computing and Services
• /
• v.3 no.5
• /
• pp.31-39
• /
• 2002

A rapid growth of internet and sudden increase of multimedia data demands for high-speed transfer media and if optimizec usage from the interface system. To achieve this level of network bandwidth, multiple NICs for support of high-speed network bandwidth have been developed and studied. Furthermore, the use of multiple NICs can provide high-speed LAN environment without large network environment modification, supports backward compatibility of current system and reduce overhead. However. if system failure is caused by SPOF(Single Point of Failure) fault of large-capacity multiple NICs, incredible loss will be met because it services large capacity of multimedia data, Therefore, to prevent loss coming from faults, we describe 'Fault tolerance of multiple NICs', which use the fault prevention mechanism. Considering inefficiency of availability and serviceability that is occurred with existing TMR, Primary-Standby approach and Watchdog time mechanism, we propose and design the efficient fault tolerance mechanism, which minimize down time as changing of detection period dynamically. Consequently, the fault tolerance mechanism proposed for reducing overhead time when the fault is occurred, should minimize system downtime overall.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.675-684
• /
• 2004

There have been several efforts to avoid unnecessary retransmission timeouts (RTOs), which is the main cause for TCP throughput degradation. Unnecessary RTOs can be classified into three groups according to their cause. RTOs due to multiple packet losses in the same window for TCP Reno, the most prevalent TCP version, can be avoided by TCP NewReno or using selective acknowledgement (SACK) option. RTOs occurring when a packet is lost in a window that is not large enough to trigger fast retransmit can be avoided by using the Limited Transmit algorithm. In this Paper, we comparatively analyze these schemes to cope with unnecessary RTOs by numerical analysis and simulations. On the basis of the results in this paper, TCP performance can be quantitatively predicted from the aspect of loss recovery probability. Considering that overall performance of TCP is largely dependent upon the loss recovery performance, the results shown in this paper are of great importance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1295-1304
• /
• 2010

This paper proposes a fault-tolerant data aggregation which provides energy efficient and reliable data collection in wireless sensor networks. The traditional aggregation scheme does not provide the countermeasure to packet loss or the countermeasure scheme requires a large amount of energy. The proposed scheme applies caching and re-transmission based on the track topology to the adaptive timeout scheduling. The proposed scheme uses a single-path routing based on the traditional tree topology at normal, which reduces the dissipated energy in sensor nodes without any countermeasure against packet loss. The proposed scheme, however, retransmits the lost packet using track topology under event occurrences in order to fulfill more accurate data aggregation. Extensive simulation work under various workloads has revealed that the proposed scheme decrease by 8% in terms of the dissipated energy and enhances data accuracy 41% when the potential of event occurrence exists as compared with TAG data aggregation. And the proposed scheme decrease by 53% in terms of the dissipated energy and shows a similar performance in data accuracy when the potential of event occurrence exists as compared with PERLA data aggregation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.387-395
• /
• 2005

In this paper, we propose an end-to-end mobility management and TCP flow control scheme which considers different link characteristics for vertical handover environments. The end-to-end mobility management is performed by using SIP protocol. When a mobile node moves to a new network, it informs its movement of the correspondent node by sending SIP INFO message containing a new IP address which will be used in the new network. And then the corresponding node encapsulates all packets with the new IP address and sends them to the mobile node. in general, RTT of WLAN is shorter than RTT of cdma2000. when the MN moves from WLAN network to cdma2000 network, TCP retransmission timeout will be occurred in spite of non congestion situations. Thus, TCP congestion window size will be decreased and TCP throughput will be also decreased. To prevent this phenomenon, we propose a method using probe packets after handover to estimate a link delay of the new network. We also propose a method using bandwidth ratio of each network to update RTT. It is shown through NS-2 simulations that the proposed schemes can have better performance than the previous works.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.396-405
• /
• 2005

Snoop protocol is one of the efficient schemes to compensate TCP packet loss and enhance TCP throughput in wired-cum-wireless networks. However, Snoop protocol has a problem; it cannot perform local retransmission efficiently under the bursty-error prone wireless link. In this paper, we propose Enhanced Snoop(E-Snoop) protocol to solve this problem of Snoop protocol. With E-Snoop protocol, packet losses can be noticed by receiving new ACK packets as well as by receiving duplicate ACK packets or local retransmission timeout. Therefore, TCP throughput can be enhanced by fast recognition of bursty packet losses and fast local retransmissions. From the simulation results, E-Snoop protocol can improve TCP throughput more efficiently than Snoop protocol and can yield more TCP improvement especially in the channel with high packet loss rates.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.4
• /
• pp.423-429
• /
• 2002

Time-out is one of the basic but important functions in real-time programming. However, the C language used commonly in the embedded real-time systems doesn't support this capability. For this capability, there have been numerous studies on language extension and/or special purpose real-time kernel (or engine). Those require preprocessor or new kernel support. In this paper, we propose a time-out facility supported by a library and some macro functions with a minimum dependency on operating systems. Furthermore, we also provide a structured _within statement, a macro function which makes programming easy. We have implemented this for the LINUX and the DOS environment, and for the POSIX multithread environment as well.

• 대한공업교육학회지
• /
• v.33 no.1
• /
• pp.233-248
• /
• 2008

Stream Control Transmission Protocol(SCTP) is a new transport protocol that is known to provide improved performance than Transmission Control Protocol(TCP) in multi-homing environment that is having two and more IP addresses. But currently single-homed computer is used primarily that is having one IP address. To identify whether mean transfer time for SCTP is faster that for TCP in single-homed environment considering packet loss, we make up real testbed regulating the bandwidth, delay time and packet loss rate on router and observe the transfer time. We write server and client applications to measure SCTP and TCP mean transfer time by C language. Analysis of these experimental results from the testbed implementation shows that mean transfer time of SCTP is not better than performance of TCP in single homed environment exceptional case. Main reasons of performance are that SCTP compared to TCP stops transmitting data by timeout and data transmission is often delayed when SACK congestion happens. The result of study shows that elaborate performance tuning is required in developing a new SCTP module or using a implemented SCTP module.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.213-220
• /
• 2002

Distributed competing system gives a new system architecture to be taken into consideration for solving the problems of interoperability of heterogeneous systems. In the present paper, CORBA based on multi-threaded interoperates with software blocks at physically isolated hardware. We show how archives optimal CORBA system from analysis of required functions, implementations of protocols and benchmarking of system performance in the Open Multi-service Network System Environment. The core features of our CORBA system are restricted Quality of Service based on priority, timeout service and exception status information notify to the related software blocks. And the objectives are design and implementation of high performance multi-threaded middleware and satisfied with extendibility, flexibility and stability of CORBA platform.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.7
• /
• pp.45-51
• /
• 2009

We have presented a routing mechanism that selects a route by considering channel statuses in order to fast transfer delay-sensitive data in WSNs (Wireless Sensor Networks). The existing methods for real-time data transfer select a path whose latency is the shortest or the number of hops is the smallest. An algorithm to select a real-time transfer path based on link error rates according to the characteristic of wireless medium was also suggested. However, the propagation delay and retransmission timeout affected by link error rates are shorter than channel assessment time and backoff time. Therefore, the mechanism proposed in this paper estimated the time spent in using a clear channel and sending out a packet, which is based on channel backoff rates. A source node comes to select a route with the shortest end-to-end delay as a fast transfer path for real-time traffic, and sends data along the path chosen. We found that this proposed mechanism improves the speed of event-to-sink data transfer by performing experiments under different link error and channel backoff rates.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.189-197
• /
• 2009

As the web service technology matures. research is focused on the composite web services that combine individual web services within an enterprise or between enterprises. Quality of service is the critical competitiveness factor in this mature technology stage where there are many services with similar functionalities differing only in some non-functional properties. Monitoring is the key component for the service quality management of a web service. A service quality monitoring system design using a broker is presented in this paper. OWL-S is used to specify the composite service process and a service policy (inputs and outputs of each service, quality attributes and values, etc.) built by WS-Policy is applied to the composite service process. If there is any discrepancy between the service policy and the monitored data, the service provider and the user are notified of it so as to take necessary measures. We have implemented a travel reservation system as an example of the presented design and the experimental results are shown. Average response time was monitored and the timeout policy was applied in the experiment.