• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.165-168
• /
• 2000

Since the IP multicast was proposed, there have been many research works on reliable multicast protocols［1］. In multicast communication, many reliable multicast schemes were studied in order to overcome packet losses in the network. However the fact that packets are lost in the underlying networks but the solutions are sought in the end hosts makes the search for solutions difficult. If routers can identify packets before dropped from congestion, the routers can initiate recovery process. recovery scheme by routers is proposed. This scheme is much faster than by sender-initiated or receiver-initiated recovery and latency is smaller.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.8
• /
• pp.27-33
• /
• 2004

A new multicast scheme for mobile nodes is proposed to support real-time communication in a more efficient way. In the proposed multicast scheme, the Xcast (a very flexible data plane mechanism) is integrated with the SIP (a very flexible control plane protocol) to support multicast for mobile nodes. The simulation results verify that the proposed scheme reduces unnecessary network traffic and achieves low latency of packets in the network.

• Journal of Korea Multimedia Society
• /
• v.21 no.9
• /
• pp.1090-1098
• /
• 2018

MQTT is a lightweight messaging protocol that can be used for low power IoT devices. The MQTT basically uses single MQTT broker to indirectly share message information between publishers and subscribers. This approach has a weakness in regard to traffic overflow, connection fault, security, etc. In this paper, we propose a distributed MQTT broker architecture that solves the problems in single MQTT broker structure. The distributed MQTT broker architecture is expected to support new application services that cannot be supported by a conventional MQTT architecture. We have designed and implemented a distributed MQTT broker architecture based on the RPL protocol that has been widely used for IoT network. The experiment results show that the proposed MQTT broker architecture represents better publishing/subscribing latency and network stability than the conventional MQTT broker architecture.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.3
• /
• pp.477-493
• /
• 2011

The IEEE 802.16 mobile multi-hop relay (MMR) task group 'j' (TGj) has introduced the multi-hop relaying concept in the IEEE 802.16 Wireless MAN, wherein a relay station (RS) is employed to improve network coverage and capacity. Several RSs can be deployed between a base station and mobile stations, and configured to form a tree-like multi-hop topology. In such architecture, we consider the problem of a path selection through which the mobile station in and outside the coverage can communicate with the base station. In this paper, we propose a new path selection algorithm that ensures more efficient distribution of resources such as bandwidth among the relaying nodes for improving the overall performance of the network. Performance of our proposed scheme is compared with the path selection algorithms based on loss rate and the shortest path algorithm. Based on the simulation results using ns-2, we show our proposal significantly improves the performance on throughput, latency and bandwidth consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2379-2397
• /
• 2017

Content distribution technology, which routes content to the cache servers, is considered as an effective method to reduce the response time of the user requests. However, due to the exponential increases of content traffic, traditional content routing methods suffer from high delay and consequent inefficient delivery. In this paper, a content selection policy is proposed, which combines the histories of cache hit and cache hit rate to collaboratively determine the content popularity. Specifically, the CGM policy promotes the probability of possible superior paths considering the storage cost and transmission cost of content network. Then, the content routing table is updated with the proportion of the distribution on the paths. Extensive simulation results show that our proposed scheme improves the content routing and outperforms existing routing schemes in terms of Internet traffic and access latency.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.4-6
• /
• 2001

본 논문에서는 SAN(Storage Area Network) 기반의 공유파일시스템인 Asphodel 파일 시스템을 이용하여 를러스터 웹 서버를 구성하였다. 그리고 Asphodel 공유 파일 시스템이 가지는 락(lock) 서버를 이용하여 효율적인 웹 분배 정책인 CARD(Cache-Aware Request Dispatch)를 제안하고 이를 설계 구현하였다. 그 결과 후위 서버의 메모리 캐쉬의 적중률을 높임으로써 보통의 분배 정책인 라운드로빈(Round-Robin) 방식에 비해 웹 서버의 throughput과 latency에서의 성능 향상을 보였다.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.10
• /
• pp.12-19
• /
• 1996

Many recent supercomputers employ a kind of switch-based multistage interconnection network architectrues (MINs) for constructing scalabel parallel compters. This paper proposed a new routing method, hybrid wormhole and virtual-cut through routing (HWCR) for the prevention of rapid performance degradation comming from a conflict in links usage at hot traffic situation. This HWCR through (VCT) for the fast removing temporal stagger, result in seamless flow of packet stream. When the blocked link is removed, wormhole routing is resumed. The HWCR method adopted a hierachical buffer scheme for improving the network performance and reducing the cost in BMINs. We could get optimum buffer size and communicatin latency through the computer simulation based on proposed HWCR, and the results were compared to those using wormhole and VCT.

• The Journal of the Acoustical Society of Korea
• /
• v.30 no.2
• /
• pp.86-91
• /
• 2011

In the underwater communications, the acoustic channel is in poor communication conditions, such as long propagation delay, narrow bandwidth, and high bit-error rate. For these bad acoustic channels, we propose an efficient automatic repeat request (ARQ) for multi-hop underwater network by using the concepts of concurrent bi-directional transmission, multiple sub-packets, and overhearing data packet instead of the acknowledgement signal. Our results show that the proposed ARQ significantly reduces the transmission latency especially in high BER compared with the existing Stop and Wait ARQ.

• Journal of Convergence Society for SMB
• /
• v.4 no.4
• /
• pp.19-23
• /
• 2014

Group communication is becoming increasingly popular in Internet applications such as videoconferences, online chatting programs, games, and gambling. For secure communications, the integrity of messages, member authentication, and confidentiality must be provided among group members. To maintain message integrity, all group members use the Group Key (GK) for encrypting and decrypting messages while providing enough security to protect against passive attacks. Tree-based Group Diffie-Hellman (TGDH) is an efficient group key agreement protocol to generate the GK. TGDH assumes all members have an equal computing power. One of the characteristics of distributed computing and grid environments is heterogeneity; the member can be at a workstation, a laptop or even a mobile computer. Member reordering in the TDGH protocol could potentially lead to an improved protocol; such reordering should capture the heterogeneity of the network as well as latency. This research investigates dynamic reordering mechanisms to consider not only the overhead involved but also the scalability of the proposed protocol.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.5
• /
• pp.1047-1049
• /
• 2009

This paper presents an intelligent electronic device(IED) platform which is based on a new frequency estimation algorithm. The IED platform features not only the accurate estimation of frequency but also the fast network-based transmisstion of fault data and waveforms. The simulation results show that the proposed frequency estimation algorithm improves convergence speed, and has lower frequency estimation error compared with those of conventional algorithms. The network-based IED is designed to ensure transmission latency being less than 1.0% of sampling interval.