• Title/Summary/Keyword: Recovery Scheme

Search Result 479, Processing Time 0.021 seconds

Enhancements to the fast recovery Algorithm of TCP NewReno using rapid loss detection (빠른 손실 감지를 통한 TCP NewReno의 Fast Recovery 개선 알고리듬)

  • 김동민;김범준;김석규;이재용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7B
    • /
    • pp.650-659
    • /
    • 2004
  • Domestic wireless network environment is changing rapidly while adapting to meet service requirements of users and growth of market. As a result, reliable data transmission using TCP is also expected to increase. Since TCP assumes that it is used in wired networt TCP suffers significant performance degradation over wireless network where packet losses are not always result of network congestion. Especially RTO imposes a great performance degradation of TCP. In this paper, we propose DAC$^{+}$ and EFR in order to prevent performance degradation by quickly detecting and recovering loss without RTO during fast recovery. Compared with TCP NewReno, proposed scheme shows improvements in steady-state in terms of higher fast recovery Probability and reduced response time.

A study of error correction scheme using RTP for real-time transmission (Realtime 전송을 위해 RTP를 사용한 Error Correction Scheme 연구)

  • 박덕근;박원배
    • Proceedings of the IEEK Conference
    • /
    • 2000.06a
    • /
    • pp.9-12
    • /
    • 2000
  • A forward error correction (FEC) is usually used to correct the errors of the real-time data occurred at the reciever side which require a real-time transmission. The data transmission is peformed after being encapsulating by RTP and UDP. In the ITU-T study group 16, four FEC schemes using the XORing are presented. In the paper, a new supplementary scheme is proposed. In the delay problem the new scheme performs better than the scheme 3 but in the recovery ability for successive packet loss is worse than scheme 3. The proposed scheme which supplements the present schemes can be adapted easily to the current network environment.

  • PDF

Delay Performance Analysis of the NAK-based SR-ARQ Protocol with the Reverse Acknowledgment (RA) Scheme

  • Han, Je-Chan;Lee, Jai-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11B
    • /
    • pp.989-997
    • /
    • 2008
  • The reverse acknowledgment (RA) scheme supports a fast loss recovery for negative acknowledgment (NAK)-based selective repeat automatic repeat request (SR-ARQ) by detecting a retransmission failure quickly before a retransmission timer expires. In this paper, we evaluate the performance of a NAK-based SR-ARQ protocol with the RA scheme and compare it with the conventional NAK-based SR-ARQ protocol. Particularly, we propose a simple analysis model for the transport delay of the NAK-based SR-ARQ protocol considering the traffic condition, the retransmission persistence, the timer-based retransmissions and the RA scheme's behavior. Both NAK-based SR-ARQ protocols with and without the RA scheme are implemented by using the OPNET simulator. We verified the analysis model's accuracy through the simulation results. Also, we evaluate the performance of the NAK-based SR-ARQ protocol with the RA scheme based on analysis and simulation results.

A New Flash-aware Buffering Scheme Supporting Virtual Page Flushing

  • Lim, Seong-Chae
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.14 no.3
    • /
    • pp.161-170
    • /
    • 2022
  • Recently, NAND-type flash memory has been regarded to be new promising storage media for large-scale database systems. For flash memory to be employed for that purpose, we need to reduce its expensive update cost caused by the inablity of in-place updates. To remedy such a drawback in flash memory, we propose a new flash-aware buffering scheme that enables virtual flushing of dirty pages. To this end, we slightly alter the tradional algorithms used for the logging scheme and buffer management scheme. By using the mechanism of virtual flushing, our proposed buffering scheme can efficiently prevent the frequenct occureces of page updates in flash storage. Besides the advantage of reduced page updates, the proposed viurtual flushing mechanism works favorably for shorneing a recocery time in the presense of failure. This is because it can reduce the time for redo actions during a recovry process. Owing to those two benefits, we can say that our scheme couble be very profitable when it is incorporated into cutting-edge flash-based database systems.

Extended ROHC Compression Algorithm for The Efficient Data Traffic Transmission in the IPv6 (차세대 IP체계에서 효율적인 데이터 전송을 위한 확장된 ROHC 알고리즘)

  • Kim Kyung-shin;Kang Moon-sik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.5 s.37
    • /
    • pp.187-198
    • /
    • 2005
  • In this paper, we propose the enhanced header compression scheme for the efficient data traffic transmission in Ipv6 networks. The bandwidth of wireless links and IP networks will probably be limited due to properties of the physical medium and regulatory limits on the use of frequencies for radio communications. That is major cause of user throughput reduction. Therefore, We discuss the IPHC(RFC2507) and ROHC(RFC3095) scheme. IPHC is simple header compression scheme and ROHC is enhanced header compression that have fast optimal recovery scheme. We have studied the enhanced header compression scheme in ROHC. We will show that indication of compression context values preventing from packet losses can provide the fast recovery of compression state. Computer simulations show that the proposed scheme has better performance than the previous one.

  • PDF

Secure Format-Preserving Encryption for Message Recovery Attack (메시지 복구 공격에 안전한 형태보존암호)

  • Jeong, Sooyong;Hong, Dowon;Seo, Changho
    • Journal of KIISE
    • /
    • v.44 no.8
    • /
    • pp.860-869
    • /
    • 2017
  • Recently, due to the personal information security act, the encryption of personal information has attracted attention. However, if the conventional encryption scheme is used directly, the database schema must be changed because the conventional encryption scheme does not preserve the format of the data, which can yield a large cost. Therefore, the Format-Preserving Encryption(FPE) has emerged as an important technique that ensures the confidentiality of the data and maintains the database schema naturally. Accordingly, National Institute of Standards and Technology(NIST) recently published the FF1 and FF3 as standards for FPE, although problems have been found in the security of FF1 and FF3 against message recovery attacks. In this paper, we study and analyze FF1 and FF3 as the standards of FPE, as well as the message recovery attack on these schemes. We also study a secure FPE against message recovery attack and verify the efficiency by implementing standardized FF1 and FF3.

A Timing Recovery Scheme for Variable Symbol Rate Digital M-ary QASK Receiver (가변 심볼율 MQASK(M-ary Quadrature Amplitude Keying) 디지털 수신기를 위한 타이밍 복원 방안)

  • Baek, Daesung;Lim, Wongyu;Kim, Chong-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.7
    • /
    • pp.545-551
    • /
    • 2013
  • Timing recovery loop composed of the Timing Error Detector(TED), loop filter and resampler is widely used for the timing synchronization in MQASK receivers. Since TED is sensitive to the delay between the symbol period of the signal and sampling period, the output is averaged out when the symbol rate and sampling rate are quite different the recovery loop cannot work at all. This paper presents a sampling frequency discriminator (SRD), which detects the frequency offset of the sampling clock to the symbol clock of the MQASK data transmitted. Employing the SRD, the closed loop timing recovery scheme performs the frequency-aided timing acquisition and achieve the synchronization at extremely high sampling frequency offset, which can be used in variable symbol rate MQASK receivers.

Secured Telemedicine Using Whole Image as Watermark with Tamper Localization and Recovery Capabilities

  • Badshah, Gran;Liew, Siau-Chuin;Zain, Jasni Mohamad;Ali, Mushtaq
    • Journal of Information Processing Systems
    • /
    • v.11 no.4
    • /
    • pp.601-615
    • /
    • 2015
  • Region of interest (ROI) is the most informative part of a medical image and mostly has been used as a major part of watermark. Various shapes ROIs selection have been reported in region-based watermarking techniques. In region-based watermarking schemes an image region of non-interest (RONI) is the second important part of the image and is used mostly for watermark encapsulation. In online healthcare systems the ROI wrong selection by missing some important portions of the image to be part of ROI can create problem at the destination. This paper discusses the complete medical image availability in original at destination using the whole image as a watermark for authentication, tamper localization and lossless recovery (WITALLOR). The WITALLOR watermarking scheme ensures the complete image security without of ROI selection at the source point as compared to the other region-based watermarking techniques. The complete image is compressed using the Lempel-Ziv-Welch (LZW) lossless compression technique to get the watermark in reduced number of bits. Bits reduction occurs to a number that can be completely encapsulated into image. The watermark is randomly encapsulated at the least significant bits (LSBs) of the image without caring of the ROI and RONI to keep the image perceptual degradation negligible. After communication, the watermark is retrieved, decompressed and used for authentication of the whole image, tamper detection, localization and lossless recovery. WITALLOR scheme is capable of any number of tampers detection and recovery at any part of the image. The complete authentic image gives the opportunity to conduct an image based analysis of medical problem without restriction to a fixed ROI.

Adaptive Video Watermarking Using Half-cell Motion Vector (반화소 움직임 벡터를 이용한 적응적 비디오워터마킹)

  • Shinn Brian-B.;Kim Min-Yeong;D Khongorzul;Lee In-Sung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.7
    • /
    • pp.1214-1221
    • /
    • 2006
  • Header compression scheme is suggested as a solution to reduce the inefficient overhead of general packet stream data. Especially, it is shown that there are more overhead rate for real-time media stream links such as voice because of its short payload size, and it is possible to get higher bandwidth efficiency using the header compression scheme. There are two kinds of error recovery in header compression such as Periodic Header Refresh(PHR) and Header Request(HR) schemes. In this paper, we analyze the performance of these two compression recovery schemes, and some results such as the overhead rate, bandwidth gain and bandwidth efficiency(BE) are presented.

A Clock and Data Recovery Circuit with Adaptive Loop Bandwidth Calibration and Idle Power Saved Frequency Acquisition

  • Lee, Won-Young;Jung, Chae Young;Cho, Ara
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.17 no.4
    • /
    • pp.568-576
    • /
    • 2017
  • This paper presents a clock and data recovery circuit with an adaptive loop bandwidth calibration scheme and the idle power saved frequency acquisition. The loop bandwidth calibration adaptively controls injection currents of the main loop with a trimmable bandgap reference circuit and trains the VCO to operate in the linear frequency control range. For stand-by power reduction of the phase detector, a clock gating circuit blocks 8-phase clock signals from the VCO and cuts off the current paths of current mode D-flip flops and latches during the frequency acquisition. 77.96% reduction has been accomplished in idle power consumption of the phase detector. In the jitter experiment, the proposed scheme reduces the jitter tolerance variation from 0.45-UI to 0.2-UI at 1-MHz as compared with the conventional circuit.