A new estimation scheme for the effective number of users in internet congestion control
Date
2011ISSN
1063-6692Source
IEEE/ACM Transactions on NetworkingVolume
19Issue
5Pages
1499-1512Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
Many congestion control protocols have been recently proposed in order to alleviate the problems encountered by TCP in high-speed networks and wireless links. Protocols utilizing an architecture that is in the same spirit as the ABR service in ATM networks require estimates of the effective number of users utilizing each link in the network to maintain stability in the presence of delays. In this paper, we propose a novel estimation algorithm that is based on online parameter identification techniques and is shown through analysis and simulations to converge to the effective number of users utilizing each link. The algorithm does not require maintenance of per-flow states within the network or additional fields in the packet header, and it is shown to outperform previous proposals that were based on pointwise division in time. The estimation scheme is designed independently from the control functions of the protocols and is thus universal in the sense that it operates effectively in a number of congestion control protocols. It can thus be successfully used in the design of new congestion control protocols. In this paper, to illustrate its universality, we use the proposed estimation scheme to design a representative set of Internet congestion control protocols. Using simulations, we demonstrate that these protocols satisfy key design requirements. They guide the network to a stable equilibrium that is characterized by high network utilization, small queue sizes, and max-min fairness. In addition, they are scalable with respect to changing bandwidths, delays, and number of users, and they generate smooth responses that converge quickly to the desired equilibrium. © 2011 IEEE.
Collections
Cite as
Related items
Showing items related by title, author, creator and subject.
-
Article
Global asymptotic stability of max-min congestion control schemes
Lestas, Marios; Ioannou, Petros A.; Pitsillides, Andreas; Hadjipollas, George (2017)A number of congestion control schemes which adopt the max-min fairness criterion and do not require maintenance of per flow states within the network have been proposed in the literature. The establishment of global ...
-
Article
Adaptive nonlinear congestion controller for a differentiated-services framework
Pitsillides, Andreas; Ioannou, Petros A.; Lestas, Marios; Rossides, Loukas (2005)The growing demand of computer usage requires efficient ways of managing network traffic in order to avoid or at least limit the level of congestion in cases where increases in bandwidth are not desirable or possible. In ...
-
Article
A bio-inspired approach for streaming applications in wireless sensor networks based on the Lotka-Volterra competition model
Antoniou, Pavlos Ch.; Pitsillides, Andreas (2010)In the new era of Ambient Intelligence, wireless sensor networks (WSNs) are seen to bridge the gap between physical world and the Internet, making a large amount of information accessible anywhere, anytime. Over the last ...