• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6B
• /
• pp.548-553
• /
• 2004

Due to the recent advance in wireless communication technology, it is now more demanding to enjoy the high quality of service in the wireless Internal. TCP, which many Internet applications depend on for the end-to-end transport service, is optimized for the wired environment. Consequently, TCP suffers from severe performance degradation in the wireless environment where the bit error rate is relatively high and the burst errors frequently take place. In this paper, we propose a Robust TCP algorithm, which can effectively react against the burst error and significantly improve the TCP performance in wireless Internet. It is shown through the simulations that the Robust TCP performs well in the wireless environment, especially under the burst error condition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9B
• /
• pp.793-805
• /
• 2003

In OBS (Optical Burst Switching) networks which decouple the burst from its header, the fault of a fiber link can lead to the failure of all the light-path that traverses the fiber. Because each light-path is expected to operate at a rate of a few Gbps by using WDM (Wavelength Division Multiplexing) technology, any failure may lead to large data loss. Therefore, an efficient recovery scheme must be provided. In this paper, we analyze network utilization and BCP (Burst Control Packet) loss rate according to each link failure by applying the conventional restoration schemes in OBS networks. And through these simulation results, an ASPR scheme is proposed improve the fault management scheme in terms of recovery time and throughput. Finally, We compare the performance of our proposed scheme with that of the conventional one with respect to burst loss rate, resource utilization and throughput by OPNET simulations.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.127-134
• /
• 2005

Lost packet robustness is an most important quality measure for voice over IP networks(VoIP). Recovery of the lost packet from the received information is crucial to realize this robustness. So, this paper proposes the lost packet recovery method from the received information for real-time communication for CELP coder. The proposed BS-PLC (Both Side Packet Loss Concealment) based WSOLA(Waveform Shift OverLab Add) allow the lost packet to be recovered from both the 'previous' and 'next' good packet as the LP parameter and the excitation signal are respectively recovered. The burst of packet loss is modeled by Gilbert model. The proposed scheme is applied to G.729 most used in VoIP and is evaluated through the SNR(signal to noise) and the MOS(Mean Opinion Score) test. As a simulation result, The proposed scheme provide 0.3 higher in Mean Opinion Score and 2 dB higher in terms of SNR than an error concealment procedure in the decoder of G.729 at $20\%$ average packet loss rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1599-1609
• /
• 2014

TCP does not ensure the bandwidth and delay bound required for multimedia streaming services in broadband wireless network environments. In this paper, we propose a new congestion control scheme for efficient multimedia transmission, called COLO TCP (Concave Increase Slow Start Logarithmic Increase Congestion Avoidance TCP). The COLO TCP prevents the burst packet loss by applying the concave increase algorithm in slow start phase. In the congestion avoidance phase, COLO TCP uses the logarithmic increase algorithm that quickly recovers congestion window after packet loss. To highly utilize network bandwidth and reduce packet loss ratio, COLO TCP uses additive increase algorithm and adaptive decrease algorithm. Through simulation results, we prove that our COLO TCP is more robust for random loss. It is also possible for efficient multimedia transmission.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8B
• /
• pp.514-524
• /
• 2005

In optical burst switching(OBS) networks, the ingress edge router assembles packets in the same class queue into the appropriate size of burst. A burst control packet(BCP) is generated for channel reservation of corresponding data burst and sent earlier than the corresponding data burst with an offset time. Offset time is determined considering the number of hops from source to destination and the required quality of service(QoS). After offset time, the burst data is passed through tile pre-configured optical switches without any O/E/O conversion. But a failure in OBS networks may lead to the loss of bursts until the ingress nodes receive the failure indication signal. This results in a significant degradation in QoS. Therefore, in this paper, we propose a fault-tolerant node architecture based on sub-carrier multiplexing to reduce the effects of failure in OBS networks. The Performance of the proposed fault-tolerant node architecture exhibits considerable improvement as compared with the previous ones.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2257-2264
• /
• 2011

Sensor nodes in Wireless sensor network have limited resources and consume almost all energy to the communication. For its traffic feature as a burst traffic type toward a sink node, it has high probability to network congestion. Network congestion causes packet drops and retransmission of dropped packets draws energy consumption. In particular, the loss of packet that is from the sensor node far away from a sink node requires additional energy consumption by frequent retransmission. This paper presents a traffic control mechanism that determines packet transfer by considering priority of packet and congestion level as well as hop count. Analysis of proposed mechanism by simulation demonstrated that it improved energy efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12B
• /
• pp.1037-1043
• /
• 2006

There has been proposed an algorithm to reduce data burst processing delay in group scheduling in core nodes of optical burst switching networks. Since, in this algorithm, look-up tables containing all the void time information in scheduling windows are generated as soon as the primary group scheduling session terminates, it becomes faster to reassign dropped data bursts to proper voids in different data channels by referring to the tables. The group scheduling with this algorithm showed almost the same channel utilization as the one without using the algorithm but performed a little better in both burst loss probability and wavelength conversion rate. On the other hand, per-burst processing time has been reduced dramatically in the load region of higher than 0.8, showing a factor of 2.1 reduction at 0.9.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.6
• /
• pp.736-745
• /
• 2002

In network delivery of compressed video, packets may be lost if the channel is unreliable like Internet. Such losses tend to of cur in burst like continuous bit-stream error. In this paper, we propose an effective error-concealment approach to which an error resilient video encoding approach is applied against burst errors and which reduces a complexity of error concealment at the decoder using data hiding. To improve the performance of error concealment, a temporal and spatial error resilient video encoding approach at encoder is developed to be robust against burst errors. For spatial area of error concealment, block shuffling scheme is introduced to isolate erroneous blocks caused by packet losses. For temporal area of error concealment, we embed parity bits in content data for motion vectors between intra frames or continuous inter frames and recovery loss packet with it at decoder after transmission While error concealment is performed on error blocks of video data at decoder, it is computationally costly to interpolate error video block using neighboring information. So, in this paper, a set of feature are extracted at the encoder and embedded imperceptibly into the original media. If some part of the media data is damaged during transmission, the embedded features can be extracted and used for recovery of lost data with bi-direction interpolation. The use of data hiding leads to reduced complexity at the decoder. Experimental results suggest that our approach can achieve a reasonable quality for packet loss up to 30% over a wide range of video materials.

• Journal of information and communication convergence engineering
• /
• v.8 no.2
• /
• pp.168-172
• /
• 2010

The Network-based handover still has problems such as the transmission delays and the packet losses in the case of macro mobility, though technological advances have been made in the wireless and mobile communication. For end-to-end handover, the link bandwidth has been reduced in the wireless network due to its burst errors and congestion control. To overcome such problems, we propose a new scheme of the macro handover according to the protocol layer. The proposed macro handover is implemented on the network layer to partially substitute wired signaling for wireless signaling, to flexibly employ buffers, and on the transport layer to postpone its retransmission time. We have performed extensive simulation using ns-2 and the result shows that our proposed scheme outperforms the other existing schemes in terms of transmission delay, packet loss, and data transfer rate during the handovers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8B
• /
• pp.721-729
• /
• 2004

In this paper, we applied a group scheduling algorithm to core nodes in an optical burst switching (OBS) network and measured its performance by simulation. For the case of core nodes with multi-channel input/output ports, performance of the group scheduling has been compared to that of the immediate scheduling. Since the group scheduling has a characteristic of scheduling a group of bursts simultaneously in a time window using information collected from corresponding burst header packets arrived earlier to a core node, simulation results show that the group scheduling outperforms the immediate scheduling in terms of both burst loss probability and channel utilization and the difference gets larger as the load increases. Another node configuration in which wavelength converters are equipped at the output ports has also been considered. In this case, even though both performance metrics of the group scheduling are almost the same as those of the immediate scheduling in the offered load range between 0.1 and 0.9, the group scheduling has lower wavelength conversion rate than the immediate scheduling by at least a factor of seven. This fact leads us to the conclusion that the group scheduling makes it possible to implement more economical OBS core nodes.