Self-adjusting grid networks to minimize expected path length

DOI10.1016/J.TCS.2014.11.036MaRDI QIDQ2345461zbMATH OpenOpenAlexFDO

Authors Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker

Publication date 22 May 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2014.11.036

zbMATH Keywords

approximationdistributed algorithmsroutingenergy-efficientminimum-linear-arrangementself-adjusting networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Recommendations

• Self-adjusting grid networks to minimize expected path length
• Demand-aware network designs of bounded degree
• Demand-aware network designs of bounded degree
• How bad is selfish routing?
• Distributed selfish load balancing on networks

Cites work

• scientific article; zbMATH DE number 4070955 (Why is no real title available?)
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• A framework for solving VLSI graph layout problems
• A self-stabilizing and local Delaunay graph construction
• An adaptive routing strategy for packet delivery in complex networks
• Collective dynamics of `small-world' networks
• Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town?
• Minimum congestion mapping in a cloud
• Optimization by simulated annealing
• Self-adjusting binary search trees
• The complexity of minimizing wire lengths in VLSI layouts
• Topology-aware VM migration in bandwidth oversubscribed datacenter networks

Cited in

(3)

• Demand-aware network designs of bounded degree
• Self-adjusting linear networks
• Self-adjusting grid networks to minimize expected path length

This page was built for publication: Self-adjusting grid networks to minimize expected path length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345461)