• Title/Summary/Keyword: round trip time

Search Result 193, Processing Time 0.029 seconds

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

Network Adaptive Congestion Control Scheme to Improve Bandwidth Occupancy and RTT Fairness in HBDP Networks (HBDP 네트워크에서 대역폭 점유와 RTT 공정성 향상을 위한 네트워크 적응적 혼잡제어 기법)

  • Oh, Junyeol;Chung, Kwangsue
    • Journal of KIISE
    • /
    • v.42 no.9
    • /
    • pp.1162-1174
    • /
    • 2015
  • These days, the networks have exhibited HBDP (High Bandwidth Delay Product) characteristics. The legacy TCP slowly increases the size of the congestion window and drastically decreases the size of a congestion window. The legacy TCP has been found to be unsuitable for HBDP networks. TCP mechanisms for solving the problems of the legacy TCP can be categorized into the loss-based TCP and the delay-based TCP. Most of the TCP mechanisms use the standard slow start phase, which leads to a heavy packet loss event caused by the overshoot. Also, in the case of congestion avoidance, the loss-based TCP has shown problems of wastage in terms of the bandwidth and RTT (Round Trip Time) fairness. The delay-based TCP has shown a slow increase in speed and low occupancy of the bandwidth. In this paper, we propose a new scheme for improving the over shoot, increasing the speed of the bandwidth and overcoming the bandwidth occupancy and RTT fairness issues. By monitoring the buffer condition in the bottleneck link, the proposed scheme does congestion control and solves problems of slow start and congestion avoidance. By evaluating performance, we prove that our proposed scheme offers better performance in HBDP networks compared to the previous TCP mechanisms.

Deployment and Performance Analysis of Nation-wide OpenFlow Networks over KREONET (KREONET 기반의 광역 규모 오픈플로우 네트워크 구축 및 성능 분석)

  • Hong, Won-Taek;Kong, Jong-Uk;Chung, Jin-Wook
    • The KIPS Transactions:PartC
    • /
    • v.18C no.6
    • /
    • pp.423-432
    • /
    • 2011
  • Recently, OpenFlow has been paid attention to as a fundamental technology which provides a function of virtualization and programmability in network. In Korea, deployment of OpenFlow networks in campuses and the interconnection between them through tunneling in layer 3 has been performed. However, the performance of the interconnected networks is decreased due to delay in IP layer. In this paper, we design and deploy nation-wide, not local, OpenFlow networks in a pure layer 2 environment over KREONET. After that, we do end-to-end Round-trip Time measurements and TCP/UDP performance tests in OpenFlow and normal networks, and do comparison and analysis on the test results. The results show that the nation-wide OpenFlow networks provide equal performance to normal networks except for the initial packet loss for UDP streaming. In regards to the performance decrease due to early UDP packet loss, we can mitigate it by implementing exceptional procedures in a controller which deal with the same continuous "Packet_in" events.

Improved Bitcoin Network Neighbors Connection Algorithm to Reduce Block Propagation Time (블록 전파 시간 단축을 위한 비트코인 네트워크 이웃 연결 알고리즘 개선)

  • Bang, Jiwon;Choi, Mi-Jung
    • KNOM Review
    • /
    • v.23 no.1
    • /
    • pp.26-33
    • /
    • 2020
  • Bitcoin is an electronic money that does not rely on centralized institutions such as banks and financial institutions, unlike the world's paper currencies such as dollar, won, euro and yen. In Bitcoin network, a block with transaction details is generated by mining, and the message that the block has been created is broadcast to all participating nodes in a broadcasting method to secure reliability through verification. Likewise, the mining and block propagation methods in the Bitcoin network are greatly affected by the performance of the P2P network. For example, in the case of mining, the node receiving the reward for mining varies depending on whether the block is first mined in the network and the proof of mining is propagated faster. In this paper, we applied local characteristics and Round-to-Trip(RTT) measurement to solve the problems of the existing neighbor connection method and block propagation method performed in Bitcoin network. An algorithm to improve block propagation speed is presented. Through experiments, we compare the performance of the improved algorithm with the existing algorithm to verify that the overall block propagation time is reduced.

Mean Transfer Time for SCTP in Initial Slow Start Phase (초기 슬로우 스타트 단계에서 SCTP의 평균 전송 시간)

  • Kim, Ju-Hyun;Lee, Yong-Jin
    • 대한공업교육학회지
    • /
    • v.32 no.2
    • /
    • pp.199-216
    • /
    • 2007
  • Stream Control Transmission Protocol(SCTP) is a transport layer protocol to support the data transmission. SCTP is similar to Transmission Control Protocol(TCP) in a variety of aspects. However, several features of SCTP including multi-homing and multi-streaming incur the performance difference from TCP. This paper highlights the data transfer during the initial slow start phase in SCTP congestion control composed of slow start phase and congestion avoidance phase. In order to compare the mean transfer time between SCTP and TCP, we experiment with different performance parameters including bandwidth, round trip time, and data length. By varying data length, we also measure the corresponding initial window size, which is one of factors affecting the mean transfer time. For the experiment, we have written server and client applications by C language using SCTP socket API and have measured the transfer time by ethereal program. We transferred data between client and server using round-robin method. Analysis of these experimental results from the testbed implementation shows that larger initial window size of SCTP than that of TCP brings the reduction in the mean transfer time of SCTP compared with TCP by 15 % on average during the initial slow start phase.

System Identification of Internet transmission rate control factors

  • Yoo, Sung-Goo;Kim, Young-Seok;Chong, Kil-To
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.652-657
    • /
    • 2004
  • As the real-time multimedia applications through Internet increase, the bandwidth available to TCP connections is oppressed by the UDP traffic, result in the performance of overall system is extremely deteriorated. Therefore, developing a new transmission protocol is necessary. The TCP-friendly algorithm is an example meeting this necessity. The TCP-friendly (TFRC) is an UDP-based protocol that controls the transmission rate based on the available round transmission time (RTT) and the packet loss rate (PLR). In the data transmission processing, transmission rate is determined based on the conditions of the previous transmission period. If the one-step ahead predicted values of the control factors are available, the performance will be improved significantly. This paper proposes a prediction model of transmission rate control factors that will be used for the transmission rate control, which improves the performance of the networks. The model developed through this research is predicting one-step ahead variables of RTT and PLR. A multiplayer perceptron neural network is used as the prediction model and Levenberg-Marquardt algorithm is used for the training. The values of RTT and PLR were collected using TFRC protocol in the real system. The obtained prediction model is validated using new data set and the results show that the obtained model predicts the factors accurately.

  • PDF

MARS: Multiple Access Radio Scheduling for a Multi-homed Mobile Device in Soft-RAN

  • Sun, Guolin;Eng, Kongmaing;Yin, Seng;Liu, Guisong;Min, Geyong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.1
    • /
    • pp.79-95
    • /
    • 2016
  • In order to improve the Quality-of-Service (QoS) of latency sensitive applications in next-generation cellular networks, multi-path is adopted to transmit packet stream in real-time to achieve high-quality video transmission in heterogeneous wireless networks. However, multi-path also introduces two important challenges: out-of-order issue and reordering delay. In this paper, we propose a new architecture based on Software Defined Network (SDN) for flow aggregation and flow splitting, and then design a Multiple Access Radio Scheduling (MARS) scheme based on relative Round-Trip Time (RTT) measurement. The QoS metrics including end-to-end delay, throughput and the packet out-of-order problem at the receiver have been investigated using the extensive simulation experiments. The performance results show that this SDN architecture coupled with the proposed MARS scheme can reduce the end-to-end delay and the reordering delay time caused by packet out-of-order as well as achieve a better throughput than the existing SMOS and Round-Robin algorithms.

Implementation of echo canceller for mobile communications interworking switch network (스위치네트워크와 연동에 의한 이동통신용 반향제거장치 구현)

  • 오돈성;이두수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.8
    • /
    • pp.2033-2042
    • /
    • 1996
  • In this papre, we describe a recently implemented echo canceller for digital cellular communication of Code Division Multiple Access(CDMA) that features time sharing of digital signal processor(DSP) over four channels in one DSP to reduce per channel costs. In the Public Land Mobile Network(PLMN), it is important to cancel the echo reflected from the Public Switched Telephone Network(PSTN) side. In case of digital mobile system, the round-trip delay of the echo is in excess of about 180 milliseconds due to frame-by-frame voice coding. It is necessary to cancel the echo in PLMN. We have developed a multi-channel echo canceller tht operates with Time Switch Module in a Mobile Switching Center(MSC). The general echo canceller needs PCM trunk interface circuits and the tone detection and disabling circuits, but the multi-channel echo canceller linked with Time Switch Module does not need them. Therefore we could develop the effective and economical echo canceller.

  • PDF

Performance enhancement of GSO FSS TCP/IP network (정지위성 TCP/IP 네트워크 전송 성능 향상)

  • Hong, Wan-Pyo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2B
    • /
    • pp.118-123
    • /
    • 2007
  • This paper studied the transmission control protocol over IP network to enhance the performance of the GSO satellite communication networks. The focus of this study is how to reduce the long round trip time and the transmission data rates over satellite link in the bidirectional satellite network. To do it, this study applied the caching and spoofing technology. The spoofing technology is used to reduce the required time for the link connection during communication. The caching technology is to improve the transmission bandwidth efficiency in the high transmission data rate link The tests and measurements in this study was performed in the commercial GSO communication satellite network and the terrestrial Internet network. The results of this paper show that the studied protocol in this paper highly enhance the performance of the bidirectional satellite communication network compare to the using TCP/IP satellite network protocol.

Development of a Supporting Tool for Conceptual Component Modeling and Component Construction on the J2EE Platform (J2EE 플랫폼에서의 개념적 컴포넌트 모델링 및 컴포넌트 생성 지원 도구 개발)

  • Lee, U-Jin;Kim, Min-Jeong;Jeong, Yang-Jae;Yun, Seok-Jin;Choe, Yeon-Jun
    • The KIPS Transactions:PartD
    • /
    • v.8D no.6
    • /
    • pp.761-770
    • /
    • 2001
  • As software industry is rapidly evolving, IT business enterprises have been meeting with cutthroat competition in developing software. As software reusability, time to market, and maintainability are considered as a competitive edge, software component techniques have lately attracted considerable attention. Currently, although there are some supporting tools for developing software components, they do not have tight connections among component developing processes such as component identification, component modeling, detailed design, code generation, deployment, and testing. And it is restrictive for users to construct various scales of components on component platform architecture. In this paper, we provide an implementation and a design of a supporting tool for constructing platform-independent software components, which covers all development lifecycles of components. In the phase of component modeling, platform independent, conceptual components are identified from domain model information in the view of system partitioning. Detailed design and implementation of a component are performed on the J2EE platform architecture. And the changes on the design model and source codes are consistently managed by using round-trip techniques.

  • PDF