Learn More
According to the past researches, a TCP Ve-gas version is able to achieve higher throughput than TCP Tahoe and Reno versions, which are widely used in the current Internet. However, we need to consider a migration path for TCP Vegas to be deployed in the Internet. By fo-cusing on the situation where TCP Reno and Vegas connections share the bottleneck link,(More)
SUMMARY In the present paper, ImTCP-bg, a new background TCP data transfer mechanism that uses an inline network measurement technique, is proposed. ImTCP-bg sets the upper limit of the congestion window size of the sender TCP based on the results of the inline network measurement, which measures the available bandwidth of the network path between the(More)
In this paper, we focus on fairness and stability of the congestion control mechanisms adopted in several versions of TCP by investigating their time–transient behaviors through an analytic approach. In addition to TCP Tahoe and TCP Reno, we also consider TCP Vegas which has been recently proposed for higher throughput, and enhanced TCP Vegas, which is(More)
—Recent research on overlay networks has revealed that user-perceived network performance, such as end-to-end delay performance, could be improved by an overlay routing mechanism. However, these studies only consider end-to-end delay, and there are few works focusing on bandwidth-related information, such as available bandwidth and physical capacity. In the(More)
SUMMARY We previously proposed a new version of TCP, called Inline measurement TCP (ImTCP), in [2, 3]. The ImTCP sender adjusts the transmission intervals of data packets and then utilizes the arrival intervals of ACK packets for available bandwidth estimation. This type of active measurement is preferred because the obtained results are as accurate as(More)
1. Fairness among users may not be achieved • Tampered-TCP connections may selfishly monopolize the bandwidth ⇒ Normal TCPs suffer from low throughput 2. tampered-TCP may not work well ex. Augmenting increase ratio of congestion window ⇒ Congestion window becomes large rapidly ⇒ The number of loss packet increases and many timeouts occur ⇒ Tampered-TCP(More)
We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be provided for elastic applications sharing the link. Packet scheduling algorithms that we consider are FIFO (First In First Out), RED (Random Early Detection), and DRR (Deficit Round Robin).(More)
We have studied the recruitment and roles of distinct dendritic cell (DC) precursors from the circulation into Propionibacterium acnes-induced granulomas in mouse liver. During infection, F4/80(-)B220(-)CD11c(+) DC precursors appeared in the circulation, migrated into the perisinusoidal space, and matured within newly formed granulomas. Recruited DCs later(More)
– In this paper, the rate-based congestion control algorithm that has been standardized in the ATM Forum is evaluated. Its behavior is analyzed by utilizing a first-order fluid approximation to provide control parameter tuning. We obtain the maximum queue length at the switch and conditions for avoiding under-utilization. The results are then applied to TCP(More)