Abstract
We consider a classic packet scheduling problem [7] and its variants. This packet scheduling problem has applications in the areas of logistics, road traffic, and more. There is a network and a set of unit-length packets are to be transmitted over the network from their respective sources to their respective destinations. Each packet is associated with a directed path on which it must travel along. Time is discrete. Initially, all the packets stay on the first edges of their respective paths. Packets are pending on the edges at any time. In each time step, a packet can move along its path by one edge, given that edge having no other packets move onto it in the same time step. The objective is to minimize makespan – the earliest time by which all the packets arrive at their respective destination edges. This problem was proved NP-hard [1] and it has been studied extensively in the past three decades. In this paper, we first provide a semi-online algorithm GRD and show that GRD is optimal for scheduling packets on arborescence and/or anti-arborescence forests. We then provide a parameterized algorithm PDP which finds an optimal makespan for the general case. PDP is a dynamic programming algorithm and its running time complexity depends on the congestion and dilation in the input instance. The algorithm PDP’s idea is new and it is derived from an insightful lower bound construction for the general packet scheduling problem.
N. Yao’s research is partially supported by NSF grant ECCS-2218517.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Clementi, A.E.F., Ianni, M.D.: On the hardness of approximating optimum schedule problems in store and forward networks. IEEE/ACM Trans. Network. 4(2), 272–280 (1996)
Graham, D.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics, A Foundation for Computer Science, 2nd edn. Addison-Wesley, Boston (1994)
Harks, T., Peis, B., Schmand, D., Tauer, B., Koch, L.V.: Competitive packet routing with priority lists. ACM Trans. Econ. Comput. (TEAC) (2018)
Kleinberg, J., va Tardos: Algorithm Design. Pearson, New York (2006)
Korte, B., Vygen, J.: Combinatorial Optimization, Theory and Algorithms. Springer, Heidelberg (2018). https://doi.org/10.1007/978-3-662-56039-6
Leighton, F.T., Maggs, B.M., Ranade, A.G., Rao, S.B.: Randomized routing and sorting on fixed-connection networks. J. Algorithms 14(2), 167–180 (1994)
Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet routing and job-shop scheduling in \(O\)(congestion + dilation) steps. Combinatorica 14(2), 167–186 (1994)
Leighton, F.T., Maggs, B.M., Richa, A.W.: Fast algorithms for finding \(O\)(congestion\(+\)dilation) packet routing schedules. Combinatorica 19(2), 375–401 (1999)
Maggs, B.M.: A survey of congestion \(+\) dilation results for packet scheduling. In: Proceedings of the 40th Annual Conference on Information Sciences and Systems (CISS) (2006)
Mansour, Y., Patt-Shamir, B.: Greedy packet scheduling on shortest paths. J. Algorithms 14, 449–465 (1993)
Mitzenmacher, M., Upfal, E.: Probability and Computing, 2nd edn. Cambridge University Press, Cambridge (2017)
Ostrovsky, R., Rabani, Y.: Universal \(O\)(congestion \(+\) dilation \(+\)\(\log ^{1 + \epsilon } n\)) local control packet switching algorithms. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), pp. 644–653 (1997)
Peis, B., Skutella, M., Wiese, A.: Packet routing: complexity and algorithms. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol. 5893, pp. 217–228. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-12450-1_20
Peis, B., Wiese, A.: Universal packet routing with arbitrary bandwidths and transit times. In: Proceedings of the International Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 362–375 (2011)
Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems, 6th edn. Springer, New York (2022). https://doi.org/10.1007/978-1-4614-2361-4
Rothvob, T.: A simpler proof for \(O\)(congestion \(+\) dilation) packet routing. In: Proceedings of the 16th Annual Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 336–348 (2013)
Tauer, B., Fischer, D., Fuchs, J., Koch, L.V., Zieger, S.: Waiting for trains: complexity results. In: Proceedings of the 6th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), pp. 282–303 (2020)
Vcking, F.M.B.: A packet routing protocol for arbitrary networks. In: Proceedings of the 28th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 291–302 (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Li, F., Yao, N. (2024). Two Exact Algorithms for the Packet Scheduling Problem. In: Wu, W., Guo, J. (eds) Combinatorial Optimization and Applications. COCOA 2023. Lecture Notes in Computer Science, vol 14461. Springer, Cham. https://doi.org/10.1007/978-3-031-49611-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-031-49611-0_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-49610-3
Online ISBN: 978-3-031-49611-0
eBook Packages: Computer ScienceComputer Science (R0)