Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs

DOI10.1145/1011767.1011795zbMath1321.68384OpenAlexW2012940837MaRDI QIDQ5501498

No author found.

Publication date: 3 August 2015

Published in: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1011767.1011795

zbMATH Keywords

load balancingroutingwireless networksgrowth-restricted graphs

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (2)

Balancing Traffic Load Using One-Turn Rectilinear Routing ⋮ Oblivious Routing for Sensor Network Topologies

This page was built for publication: Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs