The Mulitplicative Increase Multiplicative Decrease (MIMD) congestion control algorithm in the form of Scalable TCP has been proposed for high speed networks. We study fairness amo...
Eitan Altman, Konstantin Avrachenkov, B. J. Prabhu
— To discover an efficient fair sending rate for a flow, Transmission Control Protocol (TCP) saturates the bottleneck link and its buffer until the router discards a packet. Su...
— This paper presents a semi-Markov model that evaluates the performance of TCP connections with asymmetric Additive Increase and Multiplicative Decrease (AIMD) congestion contro...
— We consider the problem of allocating resources (time slots, frequency, power, etc.) at a base station to many competing flows, where each flow is intended for a different re...
— This paper is focused on the influence of geometry on the combination of inter-cell and intra-cell interferences in the downlink of large cdma networks. We use an exact repres...