• Journal of Korea Society of Industrial Information Systems
• /
• v.4 no.4
• /
• pp.1-6
• /
• 1999

When continuous media are transmitted over the communication networks, asynchrony which can not maintain temporal relationships among packets my occur due to a random transit delay. There exist two types of synchronization schemes ; for guaranteed or non-guaranteed resource networks. The former which applies a resource reservation technique maintains delay characteristics however, the latter supply a best-effort service. In this paper, I propose a intra-media synchronization scheme to transmit continuous media on general networks not guaranteeing a bounded delay time. The scheme controls transmission times of the packets by estimating next delay time with the delay distribution So, the arriving packets my be maintained within a limited delay boundary, and playout will be performed after buffering to smoothen small delay variations. To prevent network congestion and maintain minimum quality of service the transmitter performs media scaling-down by dropping the current packet when informed excessive delay from the receiver.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1322-1330
• /
• 1999

The major source of errors in high-speed networks such as Broadband ISDN(B-ISDN) is buffer overflow during congested conditions. These congestion errors are the dominant sources of errors in high-speed networks and result in cell losses. Conventional communication protocols use error detection and retransmission to deal with lost packets and transmission errors. As an alternative, we have presented a method to recover consecutive cell losses using forward error correction(FEC) in ATM(Asynchronous Transfer Mode) networks to reduce the problem. The method finds the lost cells by observing new cell sequence number($SN^{\ast}$). We have used the LI field together with SN and ST fields to consider the $SN^{\ast}$ which provides more correcting coverage than SN in ATM standards. The $SN^{\ast}$ based on the additive way such as the addition of LI capacity to original SN capacity is numbered a repeatedly 0-to-80 cycle. Another extension can be based on the multiplicative way such that LI capacity is multiplied by SN capacity. The multiplicative $SN^{\ast}$ is numbered in a repeatedly 0-to-1025 cycle.

• Journal of KIISE:Information Networking
• /
• v.34 no.4
• /
• pp.276-286
• /
• 2007

Existing streaming mechanisms have no consideration for the characteristics of streaming applications because they only consider network stability. In this paper, in order to overcome limitations of the previous work on video streaming, we propose a new video streaming mechanism called "HAViS(Hybrid Approach for Video Streaming)". The proposed mechanism includes more sophisticated features that consider both network and user requirements. Therefore, the HAViS mechanism improves the network stability by adjusting the sending rate of video stream based on the network state and it also provides the smooth playback by preventing the buffer underflow or overflow. Moreover, it is designed to take into consideration the streaming video content. Through the simulation, we prove that the HAViS mechanism efficiently uses the buffer resources and provides improved network stability and smooth playback.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.245-252
• /
• 2004

Stream Control Transmission Protocol(SCTP) is a new connection-oriented, reliable delivery transport protocol operating on top of an unreliable connectionless packet service such as IP. It inherits many of the functions developed for TCP, including flow control and packet loss recovery functions. In addition, it also supports transport layer multihoming and multistreaming In this paper, we study the impact of multi-homing on the performance of SCTP. We first compare performance of single-homed SCTP. multi-homed SCTP, TCP Reno and TCP SACK. We, then describe potential flaw in the current SCTP retransmission policy, when SCTP host is multihomed. Our Results show that SCTP performs better than TCP Reno and TCP SACK due to several changes from TCP in its congestion control mechanism. In particular. multi-homed SCTP shows the best result among the compared schemes. Through experimentation for multi-homed SCTP, we found that the current SCTP retransmission policy nay deteriorate the perfomance when the retransmission path it worse than the original path. Therefore, the condition of retransmission path is a very important factor In SCTP performance and a proper mechanism would be required to measure the condition of the retransmission path.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.41 no.2
• /
• pp.53-65
• /
• 2016

Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol : end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6A
• /
• pp.667-667
• /
• 2004

We must design the buffer algorithm that protects traffic congestion and decreasing throughput at satellite communication network. It is important that buffer algorithm is satisfied with the good performance of transmission packet, responsibility of many connecting traffic and the QOS for connecting character. Old buffer algorithms are not the suitable algorithms when we have the satellite communication network environment. RED buffer algorithm is proposed by Floyd. It has a better performance than old buffer algorithm. But this algorithm is not well adapted a number of connecting TCP packet and changing network, so this algorithm has a bad performance on satellite communication network that is many of connecting user at same time. This paper propose the TARED(Target Adaptive RED). It has a good performance, adaptation and stability on satellite communication network and has not overflow and underflow of the buffer level.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6A
• /
• pp.666-676
• /
• 2004

We must design the buffer algorithm that protects traffic congestion and decreasing throughput at satellite communication network. It is important that buffer algorithm is satisfied with the good performance of transmission packet, responsibility of many connecting traffic and the 005 for connecting character. Old buffer algorithms are not the suitable algorithms when we have the satellite communication network environment. RED buffer algorithm is proposed by Floyd. It has a better performance than old buffer algorithm. But this algorithm is not well adapted a number of connecting TCP packet and changing network, so this algorithm has a bad Performance on satellite communication network that is many of connecting user at same time. This paper Propose the TARED(Target Adaptive RED). It has a good performance, adaptation and stability on satellite communication network and has not overflow and underflow of the buffer level.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.4
• /
• pp.555-560
• /
• 2016

Recently, many countries have placed great attention on energy security and climate changes. Governments are promoting the construction of renewable energy projects with regulatory support in Korea. Despite an increasing penetration of renewable resources, however, the photovoltaic and wind power are underutilized due to the endemic problems such as difficulties of output control and intermittent output. The Energy Storage System (ESS) is proposed as a good solution for solving the problems and has been studied in both the private business and the government. However, because of inefficient aspects, the research has been carried out for improving high costs and a small capacity. In addition, the ESS is currently installed for using only one purpose which is frequency regulation or transmission congestion relief such that has an economic limitation. Therefore, methods which are becoming economically justifiable to increase the penetration of the ESS is required. Thus, this paper presents in terms of operation efficiency to improve economic feasibility of the ESS currently used. mainly, there are two aspects for the operation efficiency. Firstly, it is intended to improve the utilization rate through a process that can utilize the ESS for various purposes. It is necessary to be able to use for other purposes by classifying and clustering for increasing the efficiency of availability. The clustering method is proposed to conduct the grouping the ESS. Especially, it is proposed to utilize ESS for frequency regulation service which is the one of ancillary services in the power system. Through case studies, it is confirmed to secure the necessary resources by clustering small size ESS.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.3
• /
• pp.39-49
• /
• 2010

Ad hoc network is infrastructureless network, that the network topology is configured by each node. Each node capacity device function namely, accomplishes a network control and a function of management because not being Network device of the exclusively. Ad hoc networks what kind of node join or leave the network topology to facilitate the expansion of arbitrary topology, to the case which is the distance whose traffic is distant the place must overtake through the route of intermediate nodes, like these facts give an effect to performance fluctuation. Consequently, each node in order to maintain traffic of oneself stably there is a necessity which will consider traffic and congestion control from the node which traffic of a condition and oneself of traffic of the circumference and the route which compose the network will overtake through. This paper assumes the path of the band with a finite resource, and path traffic to occupy the competition and its impact on transmission performance of these competing arguments to configure the model factor to analyse the performance impact on the results presented. Like this result with the fact that from the study, it will contribute in network management policy and the technique.

• Journal of Korea Multimedia Society
• /
• v.13 no.1
• /
• pp.38-46
• /
• 2010

A stable game managing system is absolutely needed to accept simultaneous interlacing of many users for on- line game system. The proposed P2P on-line game system in this paper is able to get stable and real-time game managing within limited time stamp utilizing through reorganizing peers according to synchronous time which can be avoid congestion on one region, it is possible to synchronize for game nodes within limited time stamp utilizing. Reorganizing M-tree which leads 10 distribute loads. The system manages each region unit, and it is execute no matter how big game sizes are. Thus to ensure such as the problems of expand server and stabilization or message transmission. Also, prove efficiency of the suggested system through the simulation.