@inproceedings{b894aa48d89b4b6cb3d68e28477c2b2f,
title = "Online packet-routing in grids with bounded buffers",
abstract = "We present the first online algorithm with a polylogarithmic competitive ratio for the problem of online routing of packets in unidirectional grids. The goal is to maximize the throughput, i.e., the number of delivered packets. Our online algorithm is deterministic, centralized, handles packets with deadlines, allows bounded buffers, uses adaptive routing, and may drop packets before they reach their destination. All previous online algorithms for packet routing on a unidirectional line with polylogarithmic competitive ratios are randomized [AZ05, AKK09, EM10]. Our algorithm is the first deterministic online algorithm with a polylogarithmic competitive ratio.",
keywords = "admission control, bounded buffers, online algorithms, packet routing",
author = "Guy Even and Moti Medina",
year = "2011",
doi = "10.1145/1989493.1989525",
language = "אנגלית",
isbn = "9781450307437",
series = "Annual ACM Symposium on Parallelism in Algorithms and Architectures",
pages = "215--224",
booktitle = "SPAA'11 - Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures",
note = "null ; Conference date: 04-06-2011 Through 06-06-2011",
}