Andrews, M., Fernandez, A., Goel, A., Zhang, L., Source Routing and Scheduling in Packet Networks, Proc. of the 42nd Symposium on Foundations of Computer Science, 2001, pp. 168-177 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Throughput-Centric Routing Algorithm Design - Towles, Dally, Boyd (2003) (Correct)
....The cost functions used in this work address this problem by optimizing performance over all traffic patterns. Another set of network problems closely related to throughputcentric routing algorithm design are those considered in adversarial queuing theory [25] Notably, Andrews et al. [26] show an on line routing algorithm that finds feasible paths for packets through a network subject to capacity constraints if any feasible solution exists. Although similar to the worst case throughput problem considered in this paper, these results also incorporate delay bounds for the packets ....
M. Andrews, A. Fern andez, A. Goel, and L. Zhang, "Source routing and scheduling in packet networks," in Proc. of IEEE Symposium on Foundations of Computer Science, Las Vegas, NV, Oct. 2001, pp. 168--177.
Routing and Scheduling in Multihop Wireless Networks with.. - Andrews, Zhang Self-citation (Andrews Zhang) (Correct)
No context found.
M. Andrews, A. Fernandez, A. Goel, and L. Zhang. Source routing and scheduling in packet networks. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, pages 168--177, Las Vegas, NV, October 2001.
Instability of FIFO at Arbitrarily Low Rates in the.. - Bhattacharjee, Goel (2002) (9 citations) Self-citation (Goel) (Correct)
No context found.
M. Andrews, A. Fernandez, A. Goel, and L. Zhang. Source routing and scheduling in packet networks. 42nd IEEE Symposium on Foundations of Computer Science, 2001.
Instability of FIFO at Arbitrarily Low Rates in the Adversarial - Rajat Self-citation (Goel) (Correct)
No context found.
M. Andrews, A. Fernandez, A. Goel, and L. Zhang. Source routing and scheduling in packet networks. 42nd IEEE Symposium on Foundations of Computer Science, 2001.
The Necessity of Timekeeping in Adversarial Queueing - Weinard (Correct)
No context found.
Andrews, M., Fernandez, A., Goel, A., Zhang, L., Source Routing and Scheduling in Packet Networks, Proc. of the 42nd Symposium on Foundations of Computer Science, 2001, pp. 168-177
The Necessity of Timekeeping in Adversarial Queueing - Weinard (2005) (Correct)
No context found.
Andrews, M., Fernandez, A., Goel, A., Zhang, L., Source Routing and Scheduling in Packet Networks, Proc. of the 42nd Symposium on Foundations of Computer Science, 2001, pp. 168-177
On Delivery Times in Packet Networks under Adversarial Traffic - Rosen, Tsirkin (2004) (2 citations) (Correct)
No context found.
M. Andrews, A. Fernandez, A. Goel, and L. Zhang. Source Routing and Scheduling in Packet Networks. In Proc. of the 42nd Ann. IEEE Symposium on Foundations of Computer Science (FOCS), pp. 168-177, 2001
Throughput-Centric Routing Algorithm Design - Brian Towles William (Correct)
No context found.
M. Andrews, A. Fern andez, A. Goel, and L. Zhang, "Source routing and scheduling in packet networks," in Proc. of IEEE Symposium on Foundations of Computer Science, Las Vegas, NV, Oct. 2001, pp. 168--177.
Analyzing Interaction Between Network Protocols.. - Barrett, Drozda.. (2003) (2 citations) (Correct)
No context found.
M. Andrews, A. Goel, A. Fernandez, and L. Zhang, Source routing and scheduling in packet networks. IEEE Foundations of Computer Science (FOCS), 2001.
Models and Techniques for Communication in Dynamic Networks.. - Scheideler (2001) (2 citations) (Correct)
No context found.
M. Andrews, A. Fernandez, A. Goel, and L. Zhang. Source routing and scheduling in packet networks. In Proc. of the 42nd IEEE Symp. on Foundations of Computer Science (FOCS), pages 168-177, 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