TCP Congestion Control dengan Menggunakan Algoritma Smooth Start TCP Congestion Control with Smooth Start Algorithm

Transmission Control Protocol (TCP) menyediakan mekanisme pengiriman data yang reliabel bagi paket IP. TCP congestion control adalah mekanisme dalam TCP yang menangani terjadinya kongesti. Seiring dengan makin luasnya penggunaan internet, efisiensi dari TCP congestion control patut mendapatkan perhatian yang besar. TCP congestion control terdiri dari empat fase, yaitu Slow Start, Congestion Avoidance, Fast Retransmission, Fast Recovery. Sekarang ini sudah banyak usulan perbaikan TCP congestion control di antaranya adalah TCP Vegas, TCP SACK, TCP FACK, TCP Reno, TCP NewReno. Semua usulan perbaikan TCP congestion control tersebut memodifikasi bagian akhir dari fase TCP congestion control (Fast Retransmission dan Fast Recovery). Algoritma Smooth Start memodifikasi bagian awal dari fase TCP congestion control.Pada Tugas akhir ini dievaluasi performansi dari algoritma Smooth Start dengan mensimulasikannya di Network Simulator. Algoritma Smooth Start diimplementasikan di TCP Reno, menggantikan algoritma Slow start.Algoritma Slow Start hanya berpengaruh signifikan pada koneksi pendek. Hal ini karena algoritma Smooth Start hanya memodifikasi fase awal dari TCP congestion control. Pada jaringan yang padat, algoritma Smooth Start mempunyai packet loss yang lebih rendah dan throughput yang lebih tinggi dari pada algoritma Slow Start. Pada jaringan yang tidak padat, algoritma Smooth Start mempunyai packet loss yang lebih rendah tetapi dengan throughput yang lebih rendah juga dibanding algoritma Slow Start. kongesti, congestion control, Smooth Star

Network coding meets TCP

We propose a mechanism that incorporates network coding into TCP with only minor changes to the protocol stack, thereby allowing incremental deployment. In our scheme, the source transmits random linear combinations of packets currently in the congestion window. At the heart of our scheme is a new interpretation of ACKs - the sink acknowledges every degree of freedom (i.e., a linear combination that reveals one unit of new information) even if it does not reveal an original packet immediately. Such ACKs enable a TCP-like sliding-window approach to network coding. Our scheme has the nice property that packet losses are essentially masked from the congestion control algorithm. Our algorithm therefore reacts to packet drops in a smooth manner, resulting in a novel and effective approach for congestion control over networks involving lossy links such as wireless links. Our experiments show that our algorithm achieves higher throughput compared to TCP in the presence of lossy wireless links. We also establish the soundness and fairness properties of our algorithm.Comment: 9 pages, 9 figures, submitted to IEEE INFOCOM 200

Performance Analysis of a Low-Interference N-Continuous OFDM Scheme

This paper investigates two issues of power spectrum density (PSD) and bit error rate (BER) of an N-continuous orthogonal frequency division multiplexing (NC-OFDM) aided low-interference time-domain scheme, when the smooth signal is designed by the linear combination of basis signals truncated by a window. Based on the relationship between the continuity and sidelobe decaying, the PSD performance is first analyzed and compared, in terms of the highest derivative order (HDO) N and the length of the smooth signal L. Since the high-order derivative of the truncation window has the finite continuity, the N-continuous signal has two finite continuities, which may have different continuous derivative orders. In this case, we develop a close PSD expression by introducing another smooth signal, which is also linearly combined by other basis signals, to explain the sidelobe decaying related to N and L. Then, in the context of BER, considering the multipath Rayleigh fading channel, based on the effect of the delayed tail of the smooth signal to the received signal, we provide a procedure for calculating the BER expressed in the form of an asymptotic summation.Comment: 7 pages, 6 figure

Mobile Networking

We point out the different performance problems that need to be addressed when considering mobility in IP networks. We also define the reference architecture and present a framework to classify the different solutions for mobility management in IP networks. The performance of the major candidate micro-mobility solutions is evaluated for both real-time (UDP) and data (TCP) traffic through simulation and by means of an analytical model. Using these models we compare the performance of different mobility management schemes for different data and real-time services and the network resources that are needed for it. We point out the problems of TCP in wireless environments and review some proposed enhancements to TCP that aim at improving TCP performance. We make a detailed study of how some of micro-mobility protocols namely Cellular IP, Hawaii and Hierarchical Mobile IP affect the behavior of TCP and their interaction with the MAC layer. We investigate the impact of handoffs on TCP by means of simulation traces that show the evolution of segments and acknowledgments during handoffs.Publicad

Smooth Multirate Multicast Congestion Control

A significant impediment to deployment of multicast services is the daunting technical complexity of developing, testing and validating congestion control protocols fit for wide-area deployment. Protocols such as pgmcc and TFMCC have recently made considerable progress on the single rate case, i.e. where one dynamic reception rate is maintained for all receivers in the session. However, these protocols have limited applicability, since scaling to session sizes beyond tens of participants necessitates the use of multiple rate protocols. Unfortunately, while existing multiple rate protocols exhibit better scalability, they are both less mature than single rate protocols and suffer from high complexity. We propose a new approach to multiple rate congestion control that leverages proven single rate congestion control methods by orchestrating an ensemble of independently controlled single rate sessions. We describe SMCC, a new multiple rate equation-based congestion control algorithm for layered multicast sessions that employs TFMCC as the primary underlying control mechanism for each layer. SMCC combines the benefits of TFMCC (smooth rate control, equation-based TCP friendliness) with the scalability and flexibility of multiple rates to provide a sound multiple rate multicast congestion control policy.National Science Foundation (ANI-9986397, ANI-0092196

Design and analysis for TCP-friendly window-based congestion control

The current congestion control mechanisms for the Internet date back to the early 1980’s and were primarily designed to stop congestion collapse with the typical traffic of that era. In recent years the amount of traffic generated by real-time multimedia applications has substantially increased, and the existing congestion control often does not opt to those types of applications. By this reason, the Internet can be fall into a uncontrolled system such that the overall throughput oscillates too much by a single flow which in turn can lead a poor application performance. Apart from the network level concerns, those types of applications greatly care of end-to-end delay and smoother throughput in which the conventional congestion control schemes do not suit. In this research, we will investigate improving the state of congestion control for real-time and interactive multimedia applications. The focus of this work is to provide fairness among applications using different types of congestion control mechanisms to get a better link utilization, and to achieve smoother and predictable throughput with suitable end-to-end packet delay

Susceptibilities near the QCD (tri)critical point

Based on the proper-time renormalization group approach, the scalar and the quark number susceptibilities in the vicinity of possible critical end points of the hadronic phase diagram are investigated in the two-flavor quark-meson model. After discussing the quark-mass dependence of the location of such points, the critical behavior of the in-medium meson masses and quark number density are calculated. The universality classes of the end points are determined by calculating the critical exponents of the susceptibilities. In order to numerically estimate the influence of fluctuations we compare all quantities with results from a mean-field approximation. It is concluded that the region in the phase diagram where the susceptibilities are enhanced is more compressed around the critical end point if fluctuations are included.Comment: 14 pages, 19 figures; v3 typos and minor changes, references adde