| S. Sarkar and L. Tassiulas, "Back pressure based multicast scheduling for fair bandwidth allocation," in Proceedings of IEEE Infocom, 2001, pp. 1123--1132. |
.... To evaluate performance of a congestion control design in dynamic environments, the methodologies employ a metric of convergence time to characterize how quickly the actual allocation approaches the static ideal allocation after introduced disturbances such as the start or termination of a session [21]. Evaluation of congestion control algorithms with respect to long term ideal allocations is similar. It attributes a primary importance to examining whether or how closely the actual 2 throughput of the controlled application matches over long intervals the TCP friendly ideal throughput. ....
....multicast capable networks. Although all the metrics have originated in the context of unicast communication, there exist multicast extensions to their definitions. Due to the simplicity of specification for static ideal allocations, multicast versions of these allocations can be easily defined [21, 22]. For instance, one can specify a multicast maxmin fair allocation in terms of receiver rates (not the rates of flows as in the unicast maxmin fair allocation) with the convention that the rate of a multicast session on a link is the maximum of the rates among those receivers of the session that ....
[Article contains additional citation context not shown here]
S. Sarkar and L. Tassiulas. Back Pressure Based Multicast Scheduling for Fair Bandwidth Allocation. In Proceedings IEEE INFOCOM
....Finally, on account of space constraints we did not describe the generalization of the policy that addresses the multicast case. The generalized policy has the same sampling procedure, but the packet transmission procedure is more complex. The packet transmission procedure is the same as that in [10]. It is interesting to note that the generalization from unicast to multicast for maxmin fair allocation of bandwidth di ers in the packet transmission procedure only[4,10] Technical report[11] describes the generalization in detail. Summarizing, we have studied utility based fairness notions in ....
....procedure, but the packet transmission procedure is more complex. The packet transmission procedure is the same as that in [10] It is interesting to note that the generalization from unicast to multicast for maxmin fair allocation of bandwidth di ers in the packet transmission procedure only[4,10]. Technical report[11] describes the generalization in detail. Summarizing, we have studied utility based fairness notions in this paper. We presented provably fair distributed, local information based scheduling policies for attaining maxmin fair allocation of utilities. ....
S. Sarkar and L. Tassiulas. \Back pressure based multicast scheduling for fair bandwidth allocation," Proceedings of INFOCOM'2001; Alaska
No context found.
S. Sarkar and L. Tassiulas, "Back pressure based multicast scheduling for fair bandwidth allocation," in Proceedings of IEEE Infocom, 2001, pp. 1123--1132.
No context found.
S. Sarkar and L. Tassiulas, "Back Pressure Based Multicast Scheduling for Fair Bandwidth Allocation;" Proceedings of IEEE Infocom April, 2001
No context found.
S. Sarkar and L. Tassiulas. Back pressure based multicast scheduling for fair bandwidth allocation. In Proceedings of INFOCOM, Alaska, 2001.
No context found.
S. Sarkar and L. Tassiulas. Back Pressure Based Multicast Scheduling for Fair Bandwidth Allocation. In Proceedings IEEE INFOCOM 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