• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2323-2340
• /
• 2012

Recent advances in cognitive radio technology have drawn immense attention to higher layer protocols above medium access control, such as transmission control protocol (TCP). Most proposals to improve the TCP performance in cognitive radio (CR) networks have assumed that either all nodes are in CR networks or the TCP sender side is in CR links. In those proposals, lower layer information such as the CR link status could be easily exploited to adjust the congestion window and improve throughput. In this paper, we consider a TCP network in which the TCP sender is located remotely over the Internet while the TCP receiver is connected by a CR link. This topology is more realistic than the earlier proposals, but the lower layer information cannot be exploited. Under this assumption, we propose an enhanced TCP protocol for CR networks called TCP for cognitive radio (TCP-CR) to improve the existing TCP by (1) detection of primary user (PU) interference by a remote sender without support from lower layers, (2) delayed congestion control (DCC) based on PU detection when the retransmission timeout (RTO) expires, and (3) exploitation of two separate scales of the congestion window adapted for PU activity. Performance evaluation demonstrated that the proposed TCP-CR achieves up to 255% improvement of the end-to-end throughput. Furthermore, we verified that the proposed TCP does not deteriorate the fairness of existing TCP flows and does not cause congestions.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.6
• /
• pp.445-453
• /
• 2016

Fixed robust routing is attracting attention as routing that achieves high robustness against changes in traffic patterns without conducting traffic measurement and performing dynamic route changes. Fixed robust routing minimizes the worst-case maximum link load by distributing traffic of every source-destination (s-d) router pair onto multiple candidate paths (multipath routing). Multipath routing, however, can result in performance degradation of Transmission Control Protocol (TCP) because of frequent out-of-order packet arrivals. In this paper, we first investigate the influence of multipath routing on TCP performance under fixed robust routing with a simulation using ns-2. The simulation results clarify that TCP throughput greatly degrades with multipath routing. We next propose a candidate path selection method to improve TCP throughput while suppressing the worst-case maximum link load to less than the allowed level under fixed robust routing. The method selects a single candidate path for each of a predetermined ratio of s-d router pairs in order to avoid TCP performance degradation, and it selects multiple candidate paths for each of the other router pairs in order to suppress the worst-case maximum link load. Numerical examples show that, provided the worst-case maximum link load is less than 1.0, our proposed method achieves about six times the TCP throughput as the original fixed robust routing.

• Journal of Korea Society of Industrial Information Systems
• /
• v.22 no.1
• /
• pp.33-40
• /
• 2017

In this Paper, Analyse the Steady State Behavior of TCP and TFRC with Packet Error when both TCP and TFRC Flows Co-exist in the Network. First, Model the Network with TCP and TFRC Connections as a Discrete Time System. Second, Calculate Average Round Trip Time of the Packet Between Source and Destination on Packet Loss Environment. Then Derive the Steady State Performance i.e. Throughput of TCP and TFRC, and Average Buffer Size of RED Router Based on the Analytic Network Model. The Throughput of TCP and TFRC Connection Decrease Rapidly with the Growth of Sending Window Size and Their Transmission Rate but Their Declines become Smoothly when the Number of Sending Window Arrives on Threshold Value. The Average Queue Length of RED Router Increases Slowly on Low Transmission Rate but Increases Rapidly on High Transmission Rate.

• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.76-87
• /
• 2000

ATM is a key technology of integration of multimedia service. Recently, Many study have been concentrated on performance testing for evaluation network performance are stronger everyday. The performance testing is on evaluation of maximal throughput of network by measuring and analyzing of various performance parameters. There are two ways to test ATM network performance; one is using QoS in cell level on the point of network's view, and the other is using metric in frame level in the point of user's view. And, the standardization process is also under way. In this paper, we derive a performance requirement of TCP in TCP/IP data transmission over ATM UBR service. By applying the derived requirements to ATM and packet networks, we evaluate the performance of TCP over UBR based on the result of our simulations. Therefore, we evaluate the result of simulation and find degradation of network throughput by interaction between TCP congestion control and ATM cell drop policy. So we suggest the accelerated Vegas that modify traditional TCP Vegas in congestion control mechanism for batter network throughput.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3260-3268
• /
• 1999

As the proliferation of multimedia traffic over High-speed Internet increases, ATM network will be vital to adopt as backbone network over various parts of Internet. In this paper, we investigate the performance of TCP/IP traffic flow over ABR and UBR of ATM service to study for the high throughput and good fairness by simulation technique. Although TCP is run in the transport layer, it is controlled by several methods, e.g, EPD, PPD, RED, EFCI, ER etc, in ATM layer when TCP uses the ABR/UBR service. Therefore, if one cell is discarded in ATM layer, a packet of TCp will be laost. And, also, along with the increasing of the number of VC among switches, the throughput and fairness will be degraded. In order to improve these degradations, we propose the effective parameter control operations of EFCI and ER on ABR service, and also suggest the buffer management methods on UBR service. Finally, through the simulation results, the improved throughput and fairness are shown.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.242-250
• /
• 2001

This paper deals with the TCP bandwidth guarantee problem in a differentiated serviccs(Diffserv) network. The Diffserv assured s<:rvice differentiates packet drop probabilities to guarantee the promised bandwidth even under network congestion. However a token buffer marker fails to show adequate performance because TCI' generates packets according to the unique Tel' congestion control mechanism. We propose a marker that uses a data buffer as well as a token buffer. The marker with a data buffer works well with the assured service mechanism because it smooths Tel' traffic. We showed that the marker with a data buffer achieves the target throughput better than a marker with a token buffer only. We also showed that the optimal buffer size is proportional to reserved throughput and HTT.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.4
• /
• pp.82-87
• /
• 1999

The Asynchronous Transfer Mode(ATM) networks are being adopted as backbones over various parts of Internet. TCP is one of the most widespread transport protocols and can be used with ATM. But, TCP shows poor end-to-end performance on ATM networks. Effective throughput of TCP over ATM can be quite low when cells are dropped at the congested ATM switch. As congested link transmits cells from corrupted packets, it wastes bandwidth and throughput becomes low. This paper examines the behavior of TCP over ATM-UBR using EPD switch in a broadband environment. As threshold value closes to the buffer size, the buffer can be used more efficiently, but more drops and retransmission occur. If the threshold value is much less than buffer size, efficiency becomes low, but few drops can be happen. Therefore, the decision of threshold value becomes important factor.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1257-1260
• /
• 2002

유선에서와는 달리 무선망에서는 채널의 대역폭이 이동 단말기의 위치와 시간에 따라 변하는 특성을 가지고 있다. 유선 망의 대역폭과 TCP의 RTT와의 관계에 대한 논문은 이미 많이 발표 되어 있다[1]. 하지만 고정된 대역폭에서 최적화 되어있는 TCP 의 혼잡 제어 알고리즘이 다양한 변화를 가지는 무선 환경에서도 좋은 성능을 내는 지에 대해 발표된 연구 결과는 많지 않다. 이 논문에서는 RTT 에 영향을 받는 TCP 의 throughput 이 무선 채널의 변화와는 어떤 관계가 있는 지를 살펴보고자 한다[2]. 오랫동안 지속되는 TCP 연결에 의해 생성되는 CDMA 1X EV-DO 시스템에서 사용되는 비례 공정 스케줄링과 기존의 스케줄링을 이용하여 packet 을 전송하였을 경우 무선 채널의 변화와 RTT의 관계에 의해 나타나는 결과를 살펴보겠다.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.499-509
• /
• 2010

A plethora of transmission control protocol (TCP) congestion control algorithms have been devoted to achieving the ultimate goal of high link utilization and fair bandwidth sharing in high bandwidth-delay product (HBDP) networks. We present a new insight into the TCP congestion control problem; in particular an end-to-end delay-based approach for an HBDP network. Our main focus is to design an end-to-end mechanism that can achieve the goal without the assistance of any network feedback. Without a router's aid in notifying the network load factor of a bottleneck link, we utilize goodput and throughput values in order to estimate the load factor. The obtained load factor affects the congestion window adjustment. The new protocol, which is called TCP-goodput and throughput (GT), adopts the carefully designed inversely-proportional increase multiplicative decrease window control policy. Our protocol is stable and efficient regardless of the link capacity, the number of flows, and the round-trip delay. Simulation results show that TCP-GT achieves high utilization, good fairness, small standing queue size, and no packet loss in an HBDP environment.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.6
• /
• pp.73-81
• /
• 2009

TCP assumes that packet loss is always happened by congestionlike wired networks because is can not distinguish between congestion loss and transmission error loss,. This assumption results in unnecessary TCP performance degradation in wireless networks by reducing sender's congestion window size and retransmitting the lost packets. Also, repeated retransmissions loed to waste the limited battery power of mobile devices. In this paper, we propose the new congestion control scheme that add the algorithms monitoring networks states and the algorithms preventing congestion to improve TCP throughput performance and energy efficiency in wireless ad-hoc networks. Using NS2, we showd our scheme improved throughput performance and energy efficiency.