A. Kesselman, Y. Mansour, Loss Bounded Analysis for Differentiated Services, In Proc. of 12th ACM-SIAM Symposimum on Discrete algorithms, January 2001, pp. 591--600. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Competitive Queue Policies for Differentiated Services - Aiello, Mansour.. (2000) (3 citations) Self-citation (Mansour) (Correct)
No context found.
A. Kesselman, Y. Mansour, Loss Bounded Analysis for Differentiated Services, In Proc. of 12th ACM-SIAM Symposimum on Discrete algorithms, January 2001, pp. 591--600.
Harmonic Buffer Management Policy for Shared Memory Switches - Kesselman, Mansour (2002) Self-citation (Kesselman Mansour) (Correct)
No context found.
A. Kesselman and Y. Mansour, "Loss-Bounded Analysis for Differentiated Services," Proceedings of SODA 2001, pp. 591-600.
Buffer Overflow Management in QoS Switches - Kesselman, Lotker, Mansour.. (2001) (2 citations) Self-citation (Kesselman Mansour) (Correct)
....various algorithms for the special case where there are only two different weights. In [17] the question of video smoothing is studied. One of the results in that paper, which we improve here, is an upper bound of 4 on the competitive ratio of the greedy algorithm for the FIFO model. The work of [11] studies the competitive analysis of the lost value rather then the throughput value. Translating the loss bound to to the throughput bound considered here, for the variant where only two packet weights are possible, one can show that the competitive ratio approaches one as the ratio of the two ....
A. Kesselman and Y. Mansour. Loss-bounded analysis for differentiated services. In SODA, 2001.
Buffer Overflow Management in QoS Switches - Kesselman, Lotker, Mansour.. (2000) (2 citations) Self-citation (Kesselman Mansour) (Correct)
....various algorithms for the special case where there are only two different weights. In [17] the question of video smoothing is studied. One of the results in that paper, which we improve here, is an upper bound of 4 on the competitive ratio of the greedy algorithm for the FIFO model. The work of [11] studies the competitive analysis of the lost value rather then the throughput value. Translating the loss bound to to the throughput bound considered here, for the variant where only two packet weights are possible, one can show that the competitive ratio approaches one as the ratio of the two ....
A. Kesselman and Y. Mansour. Loss-bounded analysis for differentiated services. In SODA, 2001.
Nearly Optimal FIFO Buffer Management for DiffServ.. - Lotker, Patt-Shamir (2002) (1 citation) (Correct)
No context found.
A. Kesselman and Y. Mansour. Loss-bounded analysis for differentiated services. In Proc. of the 12th ann. ACM-SIAM Symposium on Discrete Algorithms, pages 591--600, 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