Journal ArticleOPEN ACCESS

Adaptive packet routing for bursty adversarial traffic

Journal of Computer and System Sciences (2000) 60(3) 482-509
DOI: 10.1006/jcss.1999.1681
34Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A simple, deterministic, local-control protocol that applies to any network topology is introduced. The protocol guarantees that, for any injection sequence generated by the adversary, the buffers at the nodes are polynomially bounded and that each packet has a polynomially bounded delivery time.

Cite

CITATION STYLE

APA

Aiello, W., Kushilevitz, E., Ostrovsky, R., & Rosén, A. (2000). Adaptive packet routing for bursty adversarial traffic. Journal of Computer and System Sciences, 60(3), 482–509. https://doi.org/10.1006/jcss.1999.1681

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free