• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.01a
• /
• pp.395-396
• /
• 2014

최근 소셜 네트워크 서비스로 대표되는 정보유통 매체의 급격한 발전으로 인해 데이터 빅뱅(Data Big Bang)이라 할 수 있는 데이터의 폭발적인 증가 현상에 따라 빅데이터에 대한 관심이 급격히 증대되고 있다. 빅데이터 관련 기술들은 기본적으로 대용량 데이터를 하나의 노드로 관리하는 것이 아닌 여러 노드를 연결하기 때문에 효율적인 데이터 관리를 위해서 노드 간 연결을 담당하는 라우팅 알고리즘의 중요성 역시 대두되고 있다. 본 논문에서 대용량 데이터를 위한 효율적 라우팅 알고리즘을 위해 새로운 라우팅 메시지 재전송 기법을 위한 혼잡 확률 연산 알고리즘을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.12
• /
• pp.1417-1422
• /
• 1991

In this paper we develop an analytic model for end-to-end communication protocols and study the window mechanism for flow control in store-and-forward computer networks. We develop a flow control model in which the parameters of the system are not dynamically adjusted to the stochastic fluctuation of the system load. Simulation results are presented and it is shown that the throughput-delay performance of a network can be improved by proper selection of the design parameter, such as timeout, the number of retransmission, etc.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.8
• /
• pp.50-58
• /
• 2009

Fourth generation mobile communication network have the technology of extensive form include basic service technology and it has been developed from the radio access technology and network topology. Not only fourth generation mobile communication network have basically done new highspeed radio access technology which is suitable to high and low speed environment of transfer, but also it is possible that they have been made for freely vertical handover. ETRI also has made fourth generation mobile communication network which is WiNGS(Wireless Initiative for Next Generation Service) satisfied that demand. This paper is made by lossless handover method through the local retransmission ARQ agent that is one of the main technology of fourth generation mobile communication network. Lossless handover method through local retransmission ARQ agent has been basically made by WiNGS and it was better than original local retransmission of layer by simulation.

• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.97-104
• /
• 2001

In this paper, we present a new hierarchical model for performance analysis of channel allocation and packet service protocol in wireless n network. The proposed hierarchical model consists of two parts : upper and lower layer models. The upper layer model is the structure state model representing the state of the channel allocation and call service. The lower layer model, which captures the performance of the system within a given structure state, is the wireless packet retransmission protocol model. These models are developed using SRN which is an modeling tool. SRN, an extension of stochastic Petri net, provides compact modeling facilities for system analysis. To get the performance index, appropriate reward rates are assigned to its SRN. Fixed point iteration is used to determine the model parameters that are not available directly as input. That is, the call service time of the upper model can be obtained by packet delay in the lower model, and the packet generation rates of the lower model come from call generation rates of the upper model.

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

The performance of transmission control protocol (TCP) is largely dependent upon its loss recovery. Therefore, it is a very important issue whether the packet losses may be recovered without retransmission timeout (RTO) or not. Although TCP SACK can recover multiple packet losses in a window, it cannot avoid RTO if a retransmitted packet is lost again. In order to alleviate this problem, we propose a simple change to TCP SACK, which is called TCP SACK+ in simple. We use a stochastic model to evaluate the performance of TCP SACK+, and compare it with TCP SACK. Numerical results evaluated by simulations show that SACK+ can improve the loss recovery of TCP SACK significantly in presence of random losses.

• 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.

• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.84-93
• /
• 2009

This paper focuses on message complexity performance analysis of mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs) in reference to link errors generated by mobile wireless nodes. An enhancement was made using a proposed retransmission limit, S, to be computed for error recovery (based on the link error probability), to measure message complexity of AAPs in reference to the link error probability, $P_e$. The control procedures for the retransmission limit have been included for each of the AAPs. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating on limited portable energy. O-notation has been applied to analyze the upper bound of the number of messages generated by a MANET group of nodes. The AAPs investigated in this paper are strong duplicate address detection (DAD), weak DAD with proactive routing protocol (WDP), weak DAD with on-demand routing protocol (WDO), and MANETConf. Each AAP reacts different to link errors, as each AAP has different operational procedures. The required number of broadcasting, unicasting, relaying, and received messages of the nodes participating in a single-node joining procedure is investigated to asymptotically calculate the message complexity of each AAP. Computer simulation was conducted and the results have been analyzed to verify the theoretical message complexity bounds derived. The message complexity of WDP was lowest, closely followed byWDO, based on the simulation results and analysis of the message complexity under nominal situations. The message complexity of MANETConf was higher than WDO, and strong DAD resulted to be most complex among the four AAPs.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.11
• /
• pp.135-142
• /
• 2010

QoS in the proxy system are under heavy influence from interferences such as congestion, latency, and retransmission. Also, multi-level streaming services affects from temporal synchronization, which lead to degrade the service quality. This paper proposes a new segment-based buffer management mechanism which reduces performance degradation of streaming services and enhances throughput of streaming due to drawbacks of the proxy system. The proposed paper optimizes streaming services by: 1) Use of segment-based buffer management mechanism, 2) Minimization of overhead due to congestion and interference, and 3) Minimization of retransmission due to disconnection and delay. This paper utilizes fuzzy value $\mu$ and cost weight $\omega$ to process the result. The simulation result shows that the proposed mechanism has better performance in buffer cache control rate, average packet loss rate, and delay saving rate with stream relevance metric than the other existing methods of fixed segmentation method, pyramid segmentation method, and skyscraper segmentation method.

• Journal of Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.54-63
• /
• 2004

This paper describes a hybrid QoS guarantee scheme for high quality audio streaming services on the Internet. The continuous playback of the audio data requires the isochronous transmission of the audio data packet through the Internet. In order to retain the QoS at the ultimate destination (client) as the same as servers provide, the transmission protocols should consider the error conditions such as packet loss, and out of order delivery. Generally, the protocols supporting the transmission of continuous media data do not try to recover the errors. The protocols are working somehow for the toll quality multimedia streaming services, but rot for the high quality streaming services, such as the DVD sound/music payback. The hybrid QoS guarantee scheme includes the three mechanisms to overcome the problem. The selective retransmission for the lost packet, the adaptive buffering at client-side, and the adaptive transmission rate at server-side are totally adopted to recover the packet loss with the minimal overhead, to prevent from the buffer starvation during the retransmission, and to maintain the isochronous transmission even after the retransmission. The experiments have shown good results for the high Quality audio streaming services on the Internet.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12A
• /
• pp.1267-1275
• /
• 2007

An improved backoff algorithm for retransmission randomization for OFDMA/CDMA/slotted ALOHA used in the ranging subchannel of IEEE 802.16 network is proposed. Exploiting the fact that a base station coordinates channel access using UL-/DL-MAP in the IEEE 802.16 networks, we propose a minor modification of the existing IEEE 802.16 in order to increase throughput, decrease delay variation and achieve a graceful performance degradation in case of overload channel condition of the random access protocol. The algorithm basically estimates the number of backlogged users and arrival rate using which, the BS calculates retransmission probability for the subscriber stations involved in a collision. Computer simulation is performed to demonstrate the effectiveness of the proposed algorithm and to compare the performance with existing binary exponential backoff algorithm.