1. Aiello, W., Ostrovsky, R., Kushilevitz, E., Rosén, A.: Dynamic routing on networks with fixed-size buffers. In: Proceedings of the 14th Anual ACM-SIAM Symposium on Discrete Algorithms, pp. 771–780. SIAM, Philadelphia (2003)
2. Kesselman, A., Mansour, Y., Lotker, Z., Patt-Shamir, B.: Buffer overflows of merging streams. In: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms, pp. 244–245. ACM Press, New York (2003)
3. Kothapalli, K., Scheideler, C.: Information gathering in adversarial systems: lines and cycles. In: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms, pp. 333–342 (2003)
4. Azar, Y., Zachut, R.: Packet routing and information gathering in lines, rings and trees. In: Proceedings of the 13th Annual European Symposium on Algorithms, pp. 484–495. Springer, New York (2005)
5. Labrador, M., Banerjee, S.: Packet dropping policies for ATM and IP networks. IEEE Commun. Surv. 2, 2–14 (1999)