Self-Adjusting Networks to Minimize Expected Path Length

Details Self-Adjusting Networks to Minimize Expected Path Length Self-Adjusting Networks to Minimize Expected Path Length

2011-10-02

arxiv.org/abs/1110.0196v2

Computer Science

Networking and Internet Architecture

16 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Self-Adjusting Networks to Minimize Expected Path Length does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Self-Adjusting Networks to Minimize Expected Path Length, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-Adjusting Networks to Minimize Expected Path Length will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-284473