• Title/Summary/Keyword: congestion loss rate

Search Result 119, Processing Time 0.03 seconds

Cell Loss Recovery Algorithm for ATM Networks (ATM 망에서의 셀 손실 복구 기법에 관한 연구)

  • Shim, Yun-Sup;Chun, Sang-Hun;Kwak, Kyung-Sup
    • Journal of IKEEE
    • /
    • v.3 no.1 s.4
    • /
    • pp.22-28
    • /
    • 1999
  • The existing CREG-VP, a technique to compensate the successive cell losses caused by traffic congestion using the FEC method on the Vp, has the merits of the short average encoding decoding time and the compatibility with the ATM standard cell format, but it has the restriction in the number of regenerable cells. In this thesis, we propose a scheme to efficiently regenerate the cell losses even in the burst traffic property by the expansion of the CREG-VP. The proposed scheme improves the detection capability of the lost cells by changing the CRP and the regeneration performance of the successive cells by using the interleaved parity cell. The simulation result shows that the proposed method produces much improvements compared with the existing ones in the cell loss rate reduction factor.

  • PDF

A Modified Random Early Detection Algorithm: Fuzzy Logic Based Approach

  • Yaghmaee Mohammad Hossein
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.337-352
    • /
    • 2005
  • In this paper, a fuzzy logic implementation of the random early detection (RED) mechanism [1] is presented. The main objective of the proposed fuzzy controller is to reduce the loss probability of the RED mechanism without any change in channel utilization. Based on previous studies, it is clear that the performance of RED algorithm is extremely related to the traffic load as well as to its parameters setting. Using fuzzy logic capabilities, we try to dynamically tune the loss probability of the RED gateway. To achieve this goal, a two-input-single-output fuzzy controller is used. To achieve a low packet loss probability, the proposed fuzzy controller is responsible to control the $max_{p}$ parameter of the RED gateway. The inputs of the proposed fuzzy controller are 1) the difference between average queue size and a target point, and 2) the difference between the estimated value of incoming data rate and the target link capacity. To evaluate the performance of the proposed fuzzy mechanism, several trials with file transfer protocol (FTP) and burst traffic were performed. In this study, the ns-2 simulator [2] has been used to generate the experimental data. All simulation results indicate that the proposed fuzzy mechanism out performs remarkably both the traditional RED and Adaptive RED (ARED) mechanisms [3]-[5].

Analysis of Flow and Congestion control in USN (USN의 전송 계층 프로토콜에서 에러 및 흐름제어의 성능 평가)

  • Cha, Hyun-Soo;Kang, Chul-Kun;Yoo, Seung-Wha;Kim, Ki-Hyung
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.45-50
    • /
    • 2008
  • Many applications of sensor network require connection to the Internet. The transmission protocol of traditional sensor network was designed within the sensor network itself. However, based on 6LoWPAN which can be accessed using IPv6, direct connection is possible between the sensor network and the TCP/IP network outside. Transmission of data in applications of sensor network falls into two main categories. One is a small packet that is periodically produced such as packet related to temperature and humidity. The other is a relatively large packet that brings about network overheads such as images. We investigated the conformance test and pros and cons of application data over the transmission protocol of Zigbee and 6LoWPAN. As a result, both Zigbee and 6LoWPAN have shown low rate of loss for periodic data and have in creased reliability of data transfer. When transmitting streaming image data, both ACK, non ACK mode of Zigbee and UDP of 6LoWPAN minimized transmission time but suffered the consequences of high packet loss. Even though TCP of 6LoWPAN required a long transmission time, we were able to confirm that no loss has occurred.

  • PDF

Duplicate Video Packet Transmission for Packet Loss-resilience (패킷 손실에 강인한 중복 비디오 패킷 전송 기법)

  • Seo Man-keon;Jeong Yo-won;Seo Kwang-deok;Kim Jae-Kyoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.8C
    • /
    • pp.810-823
    • /
    • 2005
  • The transmission of duplicate packets provides a great loss-resilience without undue time-delay in the video transmission over packet loss networks. But this method generally deteriorates the problem of traffic congestion because of the increased bit-rate required for duplicate transmission. In this paper, we propose an efficient packetization and duplicate transmission of video packets. The proposed method transmits only the video signal with high priority for each video macroblock that is quite small in volume but very important for the reconstruction of the video. The proposed method significantly reduces the required bit-rate for duplicate transmission. An efficient packetization method is also proposed to reduce additional packet overhead which is required for transmitting the duplicate data. The duplicated high priority data of the Previous video slice is transmitted as a Piggyback to the data Packet of the current video slice. It is shown by simulations that the proposed method remarkably improves the packet loss-resilience for video transmission only with small increase of redundant duplicated data for each slice.

Reconstruction of the Medial Canthus Using an Ipsilateral Paramedian Forehead Flap

  • Kim, Jin Hyung;Kim, Jeong Min;Park, Jang Wan;Hwang, Jae Ha;Kim, Kwang Seog;Lee, Sam Yong
    • Archives of Plastic Surgery
    • /
    • v.40 no.6
    • /
    • pp.742-747
    • /
    • 2013
  • Background The medial canthus is an important area in determining the impression of a person's facial appearance. It is composed of various structures, including canthal tendons, lacrimal canaliculi, conjunctiva, the tarsal plate, and skin tissues. Due to its complexity, medial canthal defect reconstruction has been a challenging procedure to perform. The contralateral paramedian forehead flap is usually used for large defects; however, the bulkiness of the glabella and splitting at the distal end of the flap are factors that can reduce the rate of flap survival. We reconstructed medial canthal defects using ipsilateral paramedian forehead flaps, minimizing glabellar bulkiness. Methods This study included 10 patients who underwent medial canthal reconstruction using ipsilateral paramedian forehead flaps between 2010 and 2012. To avoid an acute curve of the pedicle, which can cause venous congestion, we attempted to make the arc of the pedicle rounder. Additionally, the pedicle was skeletonized from the nasal root to the glabella to reduce the bulkiness. Results All patients had basal cell carcinoma, and 3 of them had recurrent basal cell carcinoma. All of the flaps were successful without total or partial flap loss. Two patients developed venous congestion of the flap, which was healed using medicinal leeches. Four patients developed epiphora, and 2 patients developed telecanthus. Conclusions Large defects of the medial canthus can be successfully reconstructed using ipsilateral paramedian forehead flaps. In addition, any accompanying venous congestion can be healed using medicinal leeches.

(A New Queue Management Algorithm Improving Fairness of the Internet Congestion Control) (인터넷 혼잡제어에서 공정성 향상을 위한 새로운 큐 관리 알고리즘)

  • 구자헌;최웅철;정광수
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.3
    • /
    • pp.437-447
    • /
    • 2003
  • In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection) algorithm. However, RED algorithm simple but does not protect traffic from high-bandwidth flows, which include not only flows that fail to use end-to-end congestion control such as UDP flow, but also short round-trip time TCP flows. In this paper, in order to solve this problem, we propose a simple fairness queue management scheme, called AFQM(Approximate Fair Queue Management) algorithm, that discriminate against the flows which submit more packets/sec than is allowed by their fair share. By doing this, the scheme aims to approximate the fair queueing policy Since it is a small overhead and easy to implement, AFQM algorithm controls unresponsive or misbehaving flows with a minimum overhead.

The equation-based scheme for multicast considering wireless loss probability in wired and wireless networks (유.무선 네트워크에서 무선 손실률을 고려한 equation 기반의 멀티캐스트 기법)

  • Park, Soo-Hyun;Ahn, Hong-Beom;Hong, Jin-Pyo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2010.06d
    • /
    • pp.343-347
    • /
    • 2010
  • TFMCC(TCP-Friendly Multicast Congestion Control)방식은 equation 기반의 멀티캐스트 혼잡 제어 메커니즘으로 TFRC(TCP-Friendly Rate Control) 프로토콜을 유니캐스트에서 멀티캐스트 도메인으로 확장한 방식이다. TFMCC 방식은 현재 무선 환경에 적용 시 유선 환경에서의 혼잡에 의한 패킷 손실뿐만 아니라, 무선 환경에서 무선 링크 에러를 네트워크의 혼잡으로 인식하며, single-rate 멀티캐스트 혼잡제어의 특성인 가장 낮은 수신단의 성능으로 전체 네트워크 전송률이 급격히 저하된다. 이에 본 논문에서는 무선 환경에서의 TFMCC의 성능 향상을 위해 네트워크의 무선 환경의 손실률과 유선 환경 손실률을 모델링하여 구분한 ARC(Analytical Rate Control)의 TCP 전송률 equation 을 TFMCC에 맞게 적용하였으며, 멀티캐스트 도메인에서 전송률 제어 시 무선 손실률을 별도로 고려하는 방식(M-ARC)을 제안하였다. 또한 성능 평가를 위해서 시뮬레이션 한 결과 무선 환경을 고려한 M-ARC(Multicast-Analytical Rate Control)가 기존의 TFMCC에 비해 더 높은 전송률을 유지함을 볼 수 있었다.

  • PDF

The Study on New Wireless TCP-Westwood Algorithm having Available Bandwidth Estimation within Allowable Range (허용범위내 가용대역측정값을 가지는 새로운 무선 TCP-Westwood 알고리즘에 대한 연구)

  • Yoo, Chang-Yeol;Kim, Dong-Hoi
    • Journal of Digital Contents Society
    • /
    • v.15 no.2
    • /
    • pp.147-154
    • /
    • 2014
  • There have been company researches for TCP-Westwood algorithms in wireless TCP environment with high packet loss rate. Because the TCP-Westwood algorithm adjusts the congestion window according to the ABE(Available Bandwidth Estimation), the algorithm has a problem which the accuracy of ABE decreases as the error rate increases. To solve such a problem, the proposed scheme in this paper adopts the existing packet pattern based algorithm that the ABE is ignored when the arriving interval time of ACK is longer than a given interval time and uses new algorithm that the ABE is reallocated to a given allowable ABE when the ABE is over the allowable range. The proposed scheme shows the simulation result that the ABE is closest to the setting bandwidth for simulation compared to the existing algorithms.

Buffer Management Algorithm for Performance Improvement in WBAN (WBAN 환경에서 성능향상을 위한 버퍼 관리 알고리즘)

  • Kim, JiWon;Kim, Kanghee;Lee, ChangHo;Choi, SangBang
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.5
    • /
    • pp.106-114
    • /
    • 2015
  • Wireless Body Area Network(WBAN) is a network standard around a human body which connects various medical sensor and devices It has to satisfy various demands such as data transmission rate, priority, and delay time. In this paper, considering a data priority and transmission delay time, is proposed to improve efficiency of WBAN service depending on congestion status of network. The proposed algorithm operates with adapted data removal probability according to data priority when the hub buffer is congested than before. And in the case of lower congestion within the hub buffer data is served considering data delay time. Through the comparison with other existing scheduling algorithms, it is confirmed that quality of WBAN service is improved due to lower data loss rate of medical data and less delay time in the proposed algorithm.

Performance Improvement on RED Based Gateway in TCP Communication Network

  • Prabhavat, Sumet;Varakulsiripunth, Ruttikorn
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.782-787
    • /
    • 2004
  • Internet Engineering Task Force (IETF) has been considering the deployment of the Random Early Detection (RED) in order to avoid the increasing of packet loss rates which caused by an exponential increase in network traffic and buffer overflow. Although RED mechanism can prevent buffer overflow and hence reduce an average values of packet loss rates, but this technique is ineffective in preventing the consecutive drop in the high traffic condition. Moreover, it increases a probability and average number of consecutive dropped packet in the low traffic condition (named as "uncritical condition"). RED mechanism effects to TCP congestion control that build up the consecutive of the unnecessary transmission rate reducing; lead to low utilization on the link and consequently degrade the network performance. To overcome these problems, we have proposed a new mechanism, named as Extended Drop slope RED (ExRED) mechanism, by modifying the traditional RED. The numerical and simulation results show that our proposed mechanism reduces a drop probability in the uncritical condition.

  • PDF