S. Deb and R. Srikant. Congestion control for fair resource allocation in networks with multicast flows. In Proceedings of the IEEE Conference on Decision and Control, December 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Scalable, Low-Overhead Rate Control Algorithm for.. - Kar, Sarkar, Tassiulas (2002) (1 citation) (Correct)
....of sessions in the network. An attractive feature of the algorithm is that the computational burden on the core routers, as well as the end hosts, is low. Moreover, the overhead of communication between the user and the network is also small. ACKNOWLEDGEMENTS Very recently, Deb and Srikant [8] have developed an algorithm that is quite similar to the one presented in this paper. Their work, done independently and completed in parallel with our work, is also based on primal subgradient techniques. However, while congestion on a link is measured in terms of the packet loss rate in their ....
....the optimal rates, computed based on the relaxed problem. The broken straight lines ( 15 a single bit (congested uncongested) in our case. Whereas the approach taken in our paper can be considered to be a generalization of the approach presented in [10] for the unicast case, the approach in [8] can be viewed as a generalization of the approach proposed in [14] 28] for unicast sessions. ....
S. Deb, R. Srikant,"Congestion Control for Fair Resource Allocation in Networks with Multicast Flows", Proceedings of Conference on Decision and Control (CDC) 2001.
Can Shortest-path Routing and TCP Maximize Utility - Wang, Li, Low, Doyle (2003) (5 citations) (Correct)
.... control algorithm can be interpreted as carrying out a distributed primal dual algorithm over the Internet to maximize aggregate utility, and a user s utility function is (often implicitly) defined by its TCP algorithm, see e.g. 8] 12] 15] 16] 13] 11] 9] for unicast and [7] [3] for multicast. All of these papers assume that routing is given and fixed at the time scale of interest, and TCP, together with active queue management (AQM) attempt to maximize aggregate utility over source rates. In this paper, we study utility maximization at the time scale of route changes. ....
S. Deb and R. Srikant. Congestion control for fair resource allocation in networks with multicast flows. In Proceedings of the IEEE Conference on Decision and Control, December 2001.
A Low-Overhead Rate Control Algorithm for Maximizing.. - Kar, Sarkar, Tassiulas (2000) (4 citations) (Correct)
....in the network. An attractive feature of the algorithm is that the computational burden on the core routers, as well as the end host, are very low. Moreover, the overhead of communication between the user and the network is also small. XI. ACKNOWLEDGEMENTS Very recently, Deb and Srikant [7] [8] have developed an algorithm that is quite similar to the one presented in this paper. Their work, done independently and completed in parallel with our work, is also based on primal subgradient techniques. However, while congestion on a link is measured in terms of the packet loss rate in their ....
....is measured in terms of the packet loss rate in their case, link congestion is indicated by a single bit (congested uncongested) in our case. Whereas the approach taken in our paper can be considered to be a generalization of the approach presented in [9] for the unicast case, the approach in [7] [8] can be viewed as a generalization of the approach proposed in [12] 26] for unicast sessions. ....
S. Deb, R. Srikant,"Congestion Control for Fair Resource Allocation in Networks with Multicast Flows", To appear in Proceedings of Conference on Decision and Control (CDC)
Can Shortest-path Routing and TCP Maximize Utility - Jiantao Wang Lun (2003) (5 citations) (Correct)
No context found.
S. Deb and R. Srikant. Congestion control for fair resource allocation in networks with multicast flows. In Proceedings of the IEEE Conference on Decision and Control, December 2001.
An Approach to Rate Allocation in Multicast - Stoenescu, Liu, Teneketzis (Correct)
No context found.
S. Deb and R. Srikant. Congestion control for fair resource allocation in networks with multicast ows. In Proceedings of Congerence on Decision and Control CDC, Orlando, FL, December 2001.
Optimization-Based Congestion Control for Multicast.. - Shapiro, Towsley, Kurose (2002) (3 citations) (Correct)
No context found.
Deb, S., Srikant, R.: Congestion control for fair resource allocation in networks with multicast ows. In: Proc. of the IEEE Conference on Decision and Control. (2001)
FAST Protocols: Theory, Implementation, Experiment.. - Low, Almes.. (2003) (Correct)
No context found.
S. Deb and R. Srikant. Congestion control for fair resource allocation in networks with multicast flows. In Proceedings of the IEEE Conference on Decision and Control, December 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC