The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Third International IFIP-TC6 Networking Conference Athens, Greece, May 9–14, 2004, Proceedings
We study in this paper two competing TCP connections that share a common bottleneck link. When congestion occurs, one (or both) connections will suffer a loss that will cause its throughput to decrease by a multiplicative factor. The identity of the connection that will suffer a loss is determined by a randomized “loss strategy” that may depend on the throughputs of the connections at the congestion...
Since TCP traffic is elastic, a fundamental issue is the behaviour of multiple TCP flows competing for bandwidth on a shared link. Motivated by the ubiquity of drop-tail queueing in current networks, our focus in this paper is on developing analytic models suited to characterising the throughput and fairness of competing TCP flows in drop-tail environments. Building on recent ideas from the theory...
It is well-known that the distribution of file sizes in the Internet has a long tail, and that the traffic mainly consists of small flows — “the mice”, while a large portion of the bytes are sent by large flows — “the elephants”. However, it is not yet well understood regarding how the mice and the elephants interact with each other when they share a common link. A simplified modelling assumption...
According to current TCP/IP implementations, the acceleration in additive-increase phase depends on the distance of connection. In this paper, the performance of Additive Increase and Multiplicative Decrease (AIMD) congestion control algorithm in TCP is analyzed in two ways, both focusing on effects of the heterogeneity or the mixture of different accelerations caused by different distances. First,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.