N. Andelman, Y. Mansour and An Zhu, \Competitive Queueing Policies for QoS Switches," Proceedings of SODA '03. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Management of Multi-Queue Switches in QoS Networks - Azar, Richter (2003) (1 citation) (Correct)
....queue (both preemptive and non preemptive) to an algorithm for our general model (preemptive or non preemptive, respectively) The competitive ratio of the constructed algorithm is at most twice the competitive ratio of the given admission control strategy. We therefore generalize known results [1, 2, 9, 10, 12] for preemptive and non preemptive single queue admission control to the general model of m queues. In addition, we also study the special case where all packets have unit value, and the goal is to maximize the number of transmitted packets. This model is interesting by itself, since the majority ....
....QoS has been studied extensively during recent years. Aiello et al. 1] initiated the study of di erent queuing policies for the 2 value non preemptive model in which the switch has a single queue, preemption is not allowed and each packet has a value of either 1 or . Recently, Andelman et al.[2] showed tight bounds for this case. The preemptive 2 value single queue model was initially studied by Kesselman and Mansour [10] followed by Lotker and Patt Shamir [12] who showed almost tight bounds. The general preemptive single queue model, where packets can take arbitrary values, was ....
[Article contains additional citation context not shown here]
N. Andelman, Y. Mansour, and A. Zhu. Competitive queueing policies for QoS switches. In Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, pages 761-770, 2003.
Competitive Algorithms for High-Speed QoS Switches - Kesselman (2003) Self-citation (Mansour) (Correct)
No context found.
N. Andelman, Y. Mansour and An Zhu, \Competitive Queueing Policies for QoS Switches," Proceedings of SODA '03.
Competitive Queue Policies for Differentiated Services - Aiello, Mansour.. (2000) (3 citations) Self-citation (Mansour) (Correct)
No context found.
N. Andelman, Y. Mansour, and A. Zhu, Competitive Queueing Policies for QoS switches. In proc. of the 14th ACM-SIAM Symposimum on Discrete algorithms, January 2003, pp. 761--770.
Packet-Mode Policies for Input-Queued Switches - Guez, Kesselman, Rosen (2004) (Correct)
No context found.
N. Andelman, Y. Mansour and An Zhu, "Competitive Queueing Policies for QoS Switches," The 14th ACM-SIAM SODA, Jan. 2003.
Further Improvements in Competitive Guarantees for.. - Bansal, Fleischer.. (Correct)
No context found.
N. Andelman, Y. Mansour, and A. Zhu. Competitive queueing policies for QoS switches. In Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, pages 761{ 770, 2003.
Improved Online Algorithms for Buffer Management in QoS.. - Chrobak, Jawor, Sgall.. (2004) (Correct)
No context found.
N. Andelman, Y. Mansour, and A. Zhu. Competitive queueing policies in QoS switches. In Proc. 14th Symp. on Discrete Algorithms (SODA), pages 761-770. ACM/SIAM, 2003.
Improved Online Algorithms for Buffer Management in QoS.. - Chrobak, Jawor, Sgall.. (Correct)
No context found.
N. Andelman, Y. Mansour, and A. Zhu. Competitive queueing policies in QoS switches. In Proc. 14th Symp. on Discrete Algorithms (SODA), pages 761--770. ACM/SIAM, 2003.
Online Competitive Algorithms for Maximizing.. - Bartal, Chin.. (2004) (Correct)
No context found.
N. Andelman, Y. Mansour, and A. Zhu. Competitive queueing policies for QoS switches. In Proc. of the 14th ACM-SIAM SODA, pages 761--770, 2003.
The Zero-One Principle for Switching Networks - Azar, Richter (2004) (2 citations) (Correct)
No context found.
N. Andelman, Y. Mansour, and A. Zhu. Competitive queueing policies for QoS switches. In Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, pages 761-770, 2003.
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