Self-adjusting grid networks to minimize expected path length

Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Given a network infrastructure (e.g., data-center or on-chip-network) and a distribution on the source-destination requests, the expected path (route) length is an important measure for the performance, efficiency and power consumption of the network. In this work we initiate a study on self-adjusting networks : networks that use local-distributed mechanisms to adjust the position of the nodes (e.g., virtual machines) in the network to best fit the route requests distribution. Finding the optimal placement of nodes is defined as the minimum expected path length (MEPL) problem. This is a generalization of the minimum linear arrangement (MLA) problem where the network infrastructure is a line and the computation is done centrally. In contrast to previous work, we study the distributed version and give efficient and simple approximation algorithms for interesting and practically relevant special cases of the problem. In particular, we consider grid networks in which the distribution of requests is a symmetric product distribution. In this setting, we show that a simple greedy policy of position switching between neighboring nodes to locally minimize an objective function, achieves good approximation ratios. We are able to prove this result using the useful notions of expected rank of the distribution and the expected distance to the center of the graph.

Original languageAmerican English
Title of host publicationStructural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Revised Selected Papers
Pages36-54
Number of pages19
DOIs
StatePublished - 1 Dec 2013
Event20th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2013 - Ischia, Italy
Duration: 1 Jul 20133 Jul 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8179 LNCS

Conference

Conference20th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2013
Country/TerritoryItaly
CityIschia
Period1/07/133/07/13

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Self-adjusting grid networks to minimize expected path length'. Together they form a unique fingerprint.

Cite this