Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
ACM SIGCOMM Computer Communication Review
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Utility-based rate control in the Internet for elastic traffic
IEEE/ACM Transactions on Networking (TON)
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Optimization-Based Congestion Control for Multicast Communications
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Optimal Resource Allocation in Wireless Ad Hoc Networks: A Price-Based Approach
IEEE Transactions on Mobile Computing
Distributed rate allocation for inelastic flows
IEEE/ACM Transactions on Networking (TON)
A scalable low-overhead rate control algorithm for multirate multicast sessions
IEEE Journal on Selected Areas in Communications
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
TCP Vegas: end to end congestion avoidance on a global Internet
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Proportional fairness criterion which has been proposed the first time by F.P. Kelly and his colleagues has a number of properties in allocating users' rates. For example, it resembles the AIMD in the TCP-Reno (Jacobson, 1988) in rate allocation to users and there exists a well-established stability analysis in Kelly's work relating to stability of rate allocation algorithm. Another outstanding feature is that Kelly et al. try to solve the optimization problem of maximizing the aggregate utility of users in a distributed manner by decomposing the overall system problem into two sub-problems that can be solved by network and individual users by introducing a pricing scheme (Gibbens and Kelly, 1998). In the current paper, a new high-speed second-order rate allocation algorithm has been proposed which is based on the Jacobi method. The performance of the algorithm, under users' arrival and departure and background variable bit-rate traffic is evaluated in comparison with the conventional Kelly's algorithm. Simulation results show that proposed method outperforms that of Kelly in convergence rate and is particularly suitable for ephemeral (short-lived) users.