tcp - ip analyzes
RSS tcp - ip analyzesPredicting Short-Transfer Latency From TCP Arcana: A Trace-Based Validation
White Paper This paper analyzes the predictive abilities of these techniques using traces from a variety of Web servers, and show that they can achieve useful accuracy in many, but not all, cases. In some contexts it may be useful to predict the latency for... [11 Aug 2008]
Wireline TCP Options Behaviour in the GPRS Network
White Paper This paper analyzes the TCP SACK and Timestamps options performance in a busy GPRS network. These applications work with the TCP protocol, a protocol that evolves by constantly adopting more functions and options. [03 Jul 2008]
Binomial Congestion Control Algorithms
White Paper This paper introduces and analyzes a class of nonlinear congestion control algorithms called binomial algorithms, motivated in part by the needs of streaming audio and video applications for which a drastic reduction in transmission rate upon each... [03 Jul 2008]
Traffic Analysis: From Stateful Firewall to Network Intrusion Detection System
White Paper Stateful firewall analyzes packets up to their layer 4 headers while NIDS analyzes the whole packet. This paper also suggests some improvement over TCP state management and TCP flow normalization. Computer network is already an indispensable part... [24 Apr 2008]
Impact of TCP-Like Congestion Control on the Throughput of Multicast Groups
White Paper With a simple analytical model, this paper analyzes the throughput degradation within a multicast (one-to-many) tree under TCP like congestion and flow control. This paper studies the impact of randomness (i.e.variation of queuing delay due to... [04 Apr 2008]
Loss Recovery Time of the Impatient Variant of TCP NewReno
White Paper This paper analyzes the average loss recovery time of the Impatient variant of NewReno. The Impatient variant of TCP NewReno responds to partial ACKs more aggressively than the Slow-but-Steady variant. [15 Jan 2008]
TCP in Presence of Bursty Losses
White Paper This paper analyzes the performance of a TCP-like flow control in a lossy environment. This approximates the performance of several versions of TCP that divide their congestion window by two when a loss is detected. [15 Jan 2008]
On the Transient Behavior of TCP Vegas
White Paper This paper analyzes and improve the transient behavior of TCP Vegas, an important issue in today's large "bandwidth-delay product" networks. Research has shown that TCP Vegas performs better than TCP Reno with respect to overall network utilization... [15 Jan 2008]
Reorder Detecting TCP (RD-TCP) With Explicit Packet Drop Notification (EPDN)
White Paper This paper considers wired networks and analyzes the performance of such networks when reordering of packets occurs. Reordering of packets decreases the TCP performance of a network, mainly because it leads to overestimation of the congestion of... [15 Jan 2008]
RD-TCP : Reorder Detecting TCP
White Paper This paper considers wired networks with transmission that follows predominantly, but not necessarily exclusively, symmetric routing paths, and it analyzes the performance of such networks when reordering of packets occurs. [15 Jan 2008]
On the Performance of TCP Spoofing in Satellite Networks
White Paper This paper analyzes the performance of TCP in a network that consists of both satellite and terrestrial components. Spoofing involves the transparent splitting of a TCP connection between the source and destination by some entity within the network... [15 Jan 2008]
Improving the Performance of TCP in the Case of Packet Reordering
White Paper This paper considers wired networks and analyzes the performance of such networks when reordering of packets occurs. Reordering of packets decreases the TCP performance of a network, mainly because it leads to overestimation of the congestion of... [15 Jan 2008]
Modeling RED With Idealized TCP Sources
White Paper This paper analyzes the dynamic behavior of a single RED controlled queue interacting with a large population of idealized TCP sources, i.e.sources obeying the rules of linear increase and multiplicative decrease. [15 Jan 2008]
Impact of Segments Aggregation on TCP Reno Flows in Optical Burst Switching Networks
White Paper It analyzes the TCP send rate, i.e.the amount of data sent per time unit, taking into account of the burst assembly mechanism, called burstification process; the burst loss events inside the OBS network. [15 Jan 2008]
Performance Analysis of AIMD Mechanisms Over a Multi-State Markovian Path
White Paper This paper analyzes the performance of an Additive Increase Multiplicative Decrease (AIMD)-like flow control mechanism. AIMD captures the steady state behavior of TCP in the absence of timeouts and in the absence of maximum window size limitation. [15 Jan 2008]
