• Title/Summary/Keyword: Delay based TCP

Search Result 118, Processing Time 0.025 seconds

Congestion Control with Multiple Time Scale under Self-Similar Traffic (자기유사성 트래픽 조건에서 다중 시간 간격을 이용한 혼잡제어)

  • Park, Dong-Suk;Ra, Sang-Dong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.1
    • /
    • pp.65-75
    • /
    • 2005
  • Measurement of network traffic have shown that the self-similarity is a ubiquitous phenomenon spanning across diverse network environments. In previous work, we have explored the feasibility of exploiting the long-range correlation structure in a self-similar traffic for the congestion control. We have advanced the framework of the multiple time scale congestion control and showed its effectiveness at enhancing performance for the rate-based feedback control. Our contribution is threefold. First, we define a modular extension of the TCP-a function called with a simple interface-that applies to various flavours of the TCP-e.g., Tahoe, Reno, Vegas and show that it significantly improves performance. Second, we show that a multiple time scale TCP endows the underlying feedback control with proactivity by bridging the uncertainty gap associated with reactive controls which is exacerbated by the high delay-bandwidth product in broadband wide area networks. Third, we investigate the influence of the three traffic control dimensions-tracking ability, connection duration, and fairness-on performance.

Slective Buffering Macro Handover Which Applies The F-SNOOP in Hierarchical structure (계층 구조에서 F-SNOOP을 적용한 선택적 버퍼링 매크로 핸드오버)

  • Ahn Chi-Hyun;Kim Dong-Hyun;Kim Hyoung-Chul;Ryou Hwang-Bin;Lee Dae-Young;Jun Kye-Suk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5B
    • /
    • pp.413-420
    • /
    • 2006
  • HMIPv6 is designed to reduce the signaling load to external network and improve handover speed of MN by including Mobility Anchor Point(MAP) in local handover. However in this case of macro handover, it's just used pervious MIPv6 handover algorithm. So, it occurs packet loss and transmission delay problem. In this paper, we propose the mechanism applying the HMIPv6 for Fast Handover to choose suitable to the condition buffering handover. The condition for the selection is result distance measurement between MN and CN, between MN and NAR. Furthermore, using F-SNOOP protocol, it is possible to improve wireless network performance. Wireless network has high Bit Error Rate(BER) characteristic because of path loss, fading, noise and interference. TCP regards such errors as congestion and starts congestion control. This congestion control makes packet transmission rate low. However, F-SNOOP improves TCP performance based on SNOOP and Freeze TCP that use Zero Window Advertisement(ZWA) message when handoff occurs in wireless network.

Congestion Control of Self-Similar Traffic in Two-way Network (양방향 네트워크에서 자기유사성 트래픽 혼잡 제어)

  • 석경휴;송선희;김철영;나상동
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.2
    • /
    • pp.295-303
    • /
    • 2004
  • In this Paper, we discuss an active TCP link of unsynchronized transmission mode network in two-way traffic and the Improvement of its traffic patron thorough the network pathway of protocol is shown. This is because the traffic pattern is performed on the basis of existing windows which are distributing information in several periods of time in the way of interfacing LTS control module, which is controlling by an information of exceeding the time limit of feedback loop determined by RTP, with TCP. The simulation to utilize this efficiently is performed with the circumstance of bench mark based on physical modeling of the self-similarity traffic in the performance of TCP. In this paper, we use a methodology to understand and evaluate the effect of change of transmitting protocol in sticks under the condition of the self-similar traffic in two-way network and it is shown that an improvement of congestion control by self-similarity under a heavy condition.

A Study on the Design of Hardware Switching Mechanism using TCP/IP Communication (TCP/IP를 이용한 하드웨어 전환장치 설계에 관한 연구)

  • Kim, Chong-Sup;Cho, In-Je;Lim, Sang-Soo;Ahn, Jong-Min;Kang, Im-Ju
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.13 no.7
    • /
    • pp.694-702
    • /
    • 2007
  • The SSWM(Software Switching Mechanism) of I-processor concept using non-real time in-house software simulation program is an effective method in order to develop the flight control law in desktop or HQS environment. And, this system has some advantages compare to HSWM(Hardware Switching Mechanism) such as remove the time delay effectiveness and reduce the costs of development. But, if this system loading to the OFP(Operational Flight Program), the OFP guarantee the enough throughput in order to calculate the two control law at once. Therefore, the HSWM(Hardware Switching Mechanism) of 2-processor concept is necessary. This paper addresses the concept of HSWM of the HQS-PC interface using TCP/IP(Transmission Control Protocol/Internet Protocol) communication based on flight control law of advanced supersonic trainer. And, the fader logic of TFS(Transient Free Switch) and stand-by mode of reset '0' type are designed in order to reduce the abrupt transient response and minimize the integrator effect in pitch axis. The result of the analysis based on HQS pilot simulation using HSWM reveals that the flight control systems are switching between two computers without any problem.

Congestion Control Scheme for Wide Area and High-Speed Networks (초고속-장거리 네트워크에서 혼잡 제어 방안)

  • Yang Eun Ho;Ham Sung Il;Cho Seongho;Kim Chongkwon
    • The KIPS Transactions:PartC
    • /
    • v.12C no.4 s.100
    • /
    • pp.571-580
    • /
    • 2005
  • In fast long-distance networks, TCP's congestion control algorithm has the problem of utilizing bandwidth effectively. Several window-based congestion control protocols for high-speed and large delay networks have been proposed to solve this problem. These protocols deliberate mainly three properties : scalability, TCP-friendliness, and RTT-fairness. These protocols, however, cannot satisfy above three properties at the same time because of the trade-off among them This paper presents a new window-based congestion control algorithm, called EM (Exponential Increase/ Multiplicative Decrease), that simultaneously supports all four properties including fast convergence, which is another important constraint for fast long-distance networks; it can support scalability by increasing congestion window exponentially proportional to the time elapsed since a packet loss; it can support RTT-fairness and TCP-friendliness by considering RTT in its response function; it can support last fair-share convergence by increasing congestion window inversely proportional to the congestion window just before packet loss. We evaluate the performance of EIMD and other algorithms by extensive computer simulations.

Implementation and Performance Evaluation of Transaction Protocol for Wireless Internet Services (무선 인터넷 서비스를 위한 트랜잭션 프로토콜의 구현과 성능평가)

  • Choi, Yoon-Suk;Lim, Kyung-Shik
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.4
    • /
    • pp.447-458
    • /
    • 2002
  • In this paper, we design and implement Wireless Transaction Protocol(WTP) and evaluate it for wireless transaction processing in mobile computing environments. The design and implementation of WTP are based on the coroutine model that might be suitable for light-weight portable devices. We test the compatibility between our product and the other products such as Nokia, Kannel and WinWAP For the evaluation of WTP, we use an Internet simulator that can arbitrary generate random wireless errors based on the Gilbert model. In our experiment, the performance of WTP is measured and compared to those of Transmission Control Protocol(TCP) and TCP for Transactions. The experiment shows that WTP outperforms the other two protocols for wireless transaction processing in terms of throughput and delay. Especially, WTP shows much higher performance In ease of high error rate and high probability of burst errors. This comes from the fact that WTP uses a small number of packets to process a transaction compared to the other two protocols and introduces a fixed time interval for retransmission instead of the exponential backoff algorithm. The experiment also shows that the WTP performance is optimized when the retransmission counter is set to 5 or 6 in case of high burst error rate.

Design and Performance Evaluation of the QoS based Multimedia Services under Wibro Network Environment (휴대 인터넷 환경에서 QoS 기반 멀티미디어 서비스 제공 방안 및 성능 평가)

  • Yoe, Hyun;Eom, Ki-Bok;Cho, Sung-Eon
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.3
    • /
    • pp.306-312
    • /
    • 2007
  • Present TCP/IP networks have some service quality problems. They delay various kinds of traffic, while increased traffic bottle necks, a phenomena experienced by too many internet users. Therefore, as use of the network increases, building up a stable network service is needed. Thus, network managers desperately need the best, most effective traffic control and wide-band services. Until now there has been no other way of increasing wide-band use of lines, particularly because of the expenses a limit solutions of solving continuously to increasing traffic problems. This study suggests a problem solving method under the base of 802.16e(Wibro) which will be widely used in the future.

  • PDF

IMPLEMENTATION EXPERIMENT OF VTP BASED ADAPTIVE VIDEO BIT-RATE CONTROL OVER WIRELESS AD-HOC NETWORK

  • Ujikawa, Hirotaka;Katto, Jiro
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.668-672
    • /
    • 2009
  • In wireless ad-hoc network, knowing the available bandwidth of the time varying channel is imperative for live video streaming applications. This is because the available bandwidth is varying all the time and strictly limited against the large data size of video streaming. Additionally, adapting the encoding rate to the suitable bit-rate for the network, where an overlarge encoding rate induces congestion loss and playback delay, decreases the loss and delay. While some effective rate controlling methods have been proposed and simulated well like VTP (Video Transport Protocol) [1], implementing to cooperate with the encoder and tuning the parameters are still challenging works. In this paper, we show our result of the implementation experiment of VTP based encoding rate controlling method and then introduce some techniques of our parameter tuning for a video streaming application over wireless environment.

  • PDF

HWbF(Hit and WLC based Firewall) Design using HIT technique for the parallel-processing and WLC(Weight Least Connection) technique for load balancing (병렬처리 HIT 기법과 로드밸런싱 WLC기법이 적용된 HWbF(Hit and WLC based Firewall) 설계)

  • Lee, Byung-Kwan;Kwon, Dong-Hyeok;Jeong, Eun-Hee
    • Journal of Internet Computing and Services
    • /
    • v.10 no.2
    • /
    • pp.15-28
    • /
    • 2009
  • This paper proposes HWbF(Hit and WLC based Firewall) design which consists of an PFS(Packet Filter Station) and APS(Application Proxy Station). PFS is designed to reduce bottleneck and to prevent the transmission delay of them by distributing packets with PLB(Packet Load Balancing) module, and APS is designed to manage a proxy cash server by using PCSLB(Proxy Cash Server Load Balancing) module and to detect a DoS attack with packet traffic quantity. Therefore, the proposed HWbF in this paper prevents packet transmission delay that was a drawback in an existing Firewall, diminishes bottleneck, and then increases the processing speed of the packet. Also, as HWbF reduce the 50% and 25% of the respective DoS attack error detection rate(TCP) about average value and the fixed critical value to 38% and 17%. with the proposed expression by manipulating the critical value according to the packet traffic quantity, it not only improve the detection of DoS attack traffic but also diminishes the overload of a proxy cash server.

  • PDF

Evaluating the capacity of a Web Server using Scalable Client (확장가능한 클라이언트를 이용한 웹서버 성능평가 기법)

  • Lee, Seung-Kyu;Park, Yung-Rok;Lee, Geon-Wha;Bae, Cheol-Su
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.6 no.4
    • /
    • pp.216-223
    • /
    • 2013
  • As the fast growth of using Internet, the requests of clients having different types and pressing loads on the server have been increased in World Wide Web. Thus the interesting issue is how to measure the real capacity of a Web Server. There have been much recent studies about measuring the capacity of web server. But the cause of Server response time delay is not just server itself but also network packet loss. To measure the practical capacity of web server, we generate scalable clients using Posix Thread, transport packets which were generated by scalable clients to the server using UDP and receive the packets which were the remain packet from network packet loss using TCP. In this paper, we propose a method to measure the practical capacity of a web server using the Scalable Clients based on Posix Thread and the transport on Application level.