Abstract
We study the advice complexity of online buffer management. Advice complexity measures the amount of information about the future that an online algorithm needs to achieve optimality or a good competitive ratio. We study the 2-valued buffer management problem in both preemptive and nonpreemptive models and prove lower and upper bounds on the number of bits required by an optimal online algorithm in either model. We also provide results that shed light on the ineffectiveness of advice to improve the competitiveness of the best online algorithm for nonpreemptive buffer management.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aiello, W., Mansour, Y., Rajagopolan, S., Rosen, A.: Competitive queue policies for differentiated services. In: INFOCOM, pp. 414–420 (2000)
Albers, S.: On the influence of lookahead in competitive paging algorithms. Algorithmica 18(3), 283–305 (1997)
Albers, S.: A competitive analysis of the list update problem with lookahead. Theoretical Computer Science 197(1-2), 95–109 (1998)
Andelman, N., Mansour, Y., Zhu, A.: Competitive queueing policies for QoS switches. In: SODA, pp. 761–770 (2003)
Azar, Y.: Online Packet Switching. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol. 3351, pp. 1–5. Springer, Heidelberg (2005)
Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R.: On the Advice Complexity of the k-Server Problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 207–218. Springer, Heidelberg (2011)
Böckenhauer, H.-J., Komm, D., Královič, R., Královič, R., Mömke, T.: On the Advice Complexity of Online Problems. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 331–340. Springer, Heidelberg (2009)
Böckenhauer, H.-J., Komm, D., Královič, R., Rossmanith, P.: On the Advice Complexity of the Knapsack Problem. In: Fernández-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 61–72. Springer, Heidelberg (2012)
Breslauer, D.: On competitive on-line paging with lookahead. Theoretical Computer Science 209(1-2), 365–375 (1998)
Dobrev, S., Královic, R., Pardubská, D.: Measuring the problem-relevant information in input. ITA 43(3), 585–613 (2009)
Emek, Y., Fraigniaud, P., Korman, A., Rosén, A.: Online Computation with Advice. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 427–438. Springer, Heidelberg (2009)
Epstein, L., van Stee, R.: Buffer management problems. ACM SIGACT News 35(3), 58–66 (2004)
Goldwasser, M.H.: A survey of buffer management policies for packet switches. SIGACT News 41(1), 100–128 (2010)
Grove, E.F.: Online bin packing with lookahead. In: SODA, pp. 430–436 (1995)
Kao, M., Tate, S.R.: Online matching with blocked input. Information Processing Letters 38(3), 113–116 (1991)
Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. In: STOC, pp. 520–529 (2001)
Mansour, Y., Patt-Shamir, B., Lapid, O.: Optimal smoothing schedules for real-time streams (extended abstract). In: PODC, pp. 21–29 (2000)
Renault, M.P., Rosén, A.: On Online Algorithms with Advice for the k-Server Problem. In: Solis-Oba, R., Persiano, G. (eds.) WAOA 2011. LNCS, vol. 7164, pp. 198–210. Springer, Heidelberg (2012)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2), 202–208 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dorrigiv, R., He, M., Zeh, N. (2012). On the Advice Complexity of Buffer Management. In: Chao, KM., Hsu, Ts., Lee, DT. (eds) Algorithms and Computation. ISAAC 2012. Lecture Notes in Computer Science, vol 7676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35261-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-35261-4_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35260-7
Online ISBN: 978-3-642-35261-4
eBook Packages: Computer ScienceComputer Science (R0)