• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.139-145
• /
• 2016

Dumbbell is the most basic topology that can be used in almost all kind of network experiment within it or just by little expansion. While Transmission Control Protocol TCP is the basic protocol that is used for the connectivity among networks and stations. TCP major and basic goal is to provide path and services to different applications for communication. For that reason TCP has to transfer a lot of data through a communication medium that cause serious congestion problem. To calculate the congestion problem, different kind of pre-cure solutions are developer which are Loss Based Variant and Delay Based Variant. While LBV keep track of the data that is going to be passed through TCP protocol, if the data packets start dropping that means congestion occurrence which notify as a symptom, TCP CUBIC use LBV for notifying the loss. Similarly the DBV work with the acknowledgment procedure that is used in when data ACK get late with respect to its set data rate time, TCP COMPOUND/VAGAS are examples of DBV. Many algorithms have been purposed to control the congestion in different TCP variants but the loss of data packets did not completely controlled. In this paper, the congestion control algorithms are implemented and corresponding results are analyzed in Dumbbell topology, it is typically used to analyze the TCP traffic flows. Fairness of throughput is evaluated for different TCP variants using network simulator (NS-2).

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.12
• /
• pp.520-528
• /
• 2002

The ATM Forum recently introduced the Guaranteed Frame Rate(GFR) service category GFR service has been designed to support classical best effort traffic such as TCP/IP based traffic. The GFR service not only guarantees a minimum throughput, but also supports fair distribution of available bandwidth to completing VCs. In this paper, we proposed a new buffer management algorithm based on leaky bucket to provide minimum cell rate guarantee and improve fairness. The proposed algorithm reduces complexity and processing overhead of leaky-bucket algorithm to implement easily.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.6
• /
• pp.1078-1082
• /
• 2001

This is an example of ABSTRACT format. We made a HTTP server using 8 bit microprocessor It was TMP84c015 which applied a z80 core and RTL8019AS was installed for an ethernet physical layer. Assembly language was used to optimized a performance of the MPU, to overcome an restriction of memory sire and to maximize the throughput of packet using TCP, UDP, IP, ICMP, ARP protocol. We used LabVIEW to verify the each protocol on the client side.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1569-1572
• /
• 2005

인트라넷은 TCP 를 지원하는 기존의 LAN 환경에서 인터넷 기술을 그대로 채택하였다. 이는 인터넷 기반의 TCP Parameter 값을 그대로 인트라넷에 적용하였음을 의미하며 서로 다른 환경에서 같은 Parameter 값의 적용은 네트워크 성능 저하의 원인이 되기도 한다. 네트워크의 성능을 확인하는 방법으로 Rtt(Round Trip Time:응답시간)와 Thput(Throughput:처리률)이 있다. 이값은 전송 거리와 트래픽 양에 따라 다르게 나타난다. 따라서 본 논문에서는 LAN 기반으로 전송거리에 따른 즉, Topology diameter 와 TCP Parameter 와의 관계를 RTT 와 Thput 을 통해 분석해 보았다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.560-563
• /
• 2001

We made a HTTP server using 8 bit microprocessor. It was TMP84C015 which applied a 180 core and RTL8019AS was installed for an ethernet physical layer. Assembly language was used to optimize a performance of the MPU, to overcome an restriction of memory size and to maximize the throughput of packet using TCP, UDP, IP, ICMP and ARP protocol. We used LabVIEW to verified the each protocol on the client side.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.1003-1006
• /
• 2008

인터넷상에서 TCP 프로토콜은 사실상 표준으로써 널리 이용되고 있다. 그러나 네트워크 환경이 발전해 감에 따라서 무선 네트워크, CDMA, 3G 네크워크등 다양한 환경이 공존하게 되었고, 이러한 환경에서 TCP의 성능저하가 이슈가 되어 많은 연구가 진행되었으며, 많은 알고리즘들이 발표되었다. 본 논문에서는 무선환경에서 다양한 TCP 성능저하 원인 중에서 spurious RTO에 관한 문제를 해결하고자 한다. 이 전의 연구인 E-RTO는 delay spike문제를 효과적으로 다루고 있다 하지만 delay spike이후 혼잡 윈도우를 회복하는 과정을 효과적으로 다루고 있지 못하다. 우리는 BCR를 제안하여 이러한 문제를 해결하고자 한다. BCR의 성능평가는 NS2를 이용하여 이루어 졌으며 throughput, goodput에서 좋은 성능을 보여주고 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1298-1310
• /
• 2019

Network coding (NC) is a promising technology that can improve available bandwidth and packet throughput in wireless sensor networks (WSNs). Sliding window is an improved technology of NC, which is a supplement of TCP/IP technology and can improve data throughput and network lifetime on WSNs. This paper proposes a network coding-based maximum lifetime algorithm for sliding window in WSNs (NC-MLSW) which improves the throughput and network lifetime in WSN. The packets on the source node are sent on the WSNs. The intermediate node encodes the received original packet and forwards the newly encoded packet to the next node. Finally, the destination node decodes the received encoded data packet and recovers the original packet. The performance of the NC-MLSW algorithm is studied using NS2 simulation software and the network packet throughput, network lifetime and data packet loss rate were evaluated. The simulations experiment results show that the NC-MLSW algorithm can obviously improve the network packet throughput and network lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.86-100
• /
• 2004

To provide the end-to-end service differentiation for assured services, the random early demotion and promotion (REDP) marker in the edge router at each domain boundary monitors the aggregate flow of the incoming in-profile packets and demotes in-profile packets or promotes the previously demoted in-profile packets at the aggregate flow level according to the negotiated interdomain service level agreement (SLA). The REDP marker achieves UDP fairness in demoting and promoting packets through random and early marking decisions on packets. But, TCP fairness of the REDP marker is not obvious as for UDP sources. In this paper, to improve TCP fairness of the REDP marker, we propose a modified REDP marker where we combine a dropper, meters and a token filling rate configuration component with the REDP marker. To make packet transmission rates of TCP flows more fair, at the aggregate flow level the combined dropper drops incoming excessive in-profile packets randomly with a constant probability when the token level in the leaky bucket stays in demotion region without incoming demoted in-profile packets. Considering the case where the token level cannot stay in demotion region without the prior demotion, we propose a token filling rate configuration method using traffic meters. By using the token filling rate configuration method, the modified REDP marker newly configures a token filling rate which is less than the negotiated rate determined by interdomain SLA and larger than the current input aggregate in-profile traffic rate. Then, with the newly configured token filling rate, the token level in the modified REDP marker can stay in demotion region pertinently fir the operation of the dropper to improve TCP fairness. We experiment with the modified REDP marker using ns2 simulator fur TCP sources at the general case where the token level cannot stay in demotion region without the prior demotion at the negotiated rate set as the bottleneck link bandwidth. The simulation results demonstrate that through the combined dropper with the newly configured token filling rate, the modified REDP marker also increases both aggregate in-profile throughput and link utilization in addition to TCP fairness improvement compared to the REDP marker.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.131-138
• /
• 2007

In wired networks, packet losses mostly occur due to congestion. TCP reacts to the congestion by decreasing its congestion window, thus to reduce network utilization. In wireless networks, however, losses may occur due to the high bit-error rate of the transmission medium or due to fading and mobility. Nevertheless, TCP still reacts to packet losses according to its congestion control scheme, thus to reduce the network utilization unnecessarily. This reduction of network utilization causes the performance of TCP to decrease. In this paper, we predict packet loss by using RSS(Received Signal Strengths) on the wireless and suggest adding RSS flag bit in ACK packet of MH. By using RSS flag bit in ACK, the FH(Fixed Host) decides whether it adopt congestion control scheme or not for the maximum throughput. The result of the simulation by NS-2 shows that the proposed mechanism significantly increases sending amount and receiving amount by 40% at maximum.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2553-2562
• /
• 2013

It is difficult for TCP congestion control algorithm to ensure the bandwidth and delay bound required for media streaming services in broadband wireless network environments. In this paper, we propose the COIN TCP (COncave INcrease TCP) scheme for providing a high-quality media streaming services. The COIN TCP concavely increases the congestion window size by adjusting the increment rate of congestion window, that is inversely proportional to the amount of data accumulated in the router queue. As a result, our scheme can quickly occupy the available bandwidth and prevent the heavy congestion. It also improves the link utilization by adjusting the decrement rate of congestion window according to the packet loss rate with the random loss. Through the simulation results, we prove that our scheme improves the total throughput in broadband wireless network.