1. Adler, M., Khanna, S., Rajaraman, R., Rosén, A.: Time-constrained scheduling of weighted packets on trees and meshes. Algorithmica 36(2), 123–152 (2003)
2. Adler, M., Rosenberg, A.L., Sitaraman, R.K., Unger, W.: Scheduling time-constrained communication in linear networks. Theory Comput. Syst. 35(6), 599–623 (2002)
3. Aiello, W., Kushilevitz, E., Ostrovsky, R., Rosén, A.: Dynamic routing on networks with fixed-size buffers. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 771–780 (2003)
4. Angelov, S., Khanna, S., Kunal, K.: The network as a storage device: dynamic routing with bounded buffers. Algorithmica 55(1), 71–94 (2009)
5. Azar, Y., Zachut, R.: Packet routing and information gathering in lines, rings and trees. In: Proceedings of the 13th European Symposium on Algorithms (ESA), pp. 484–495 (2005)