Paper Info

Title | ||
---|---|---|

Distributed network control through sum product algorithm on graphs |

Abstract | ||
---|---|---|

Sum product algorithm on graphs is a general message passing algorithm that unifies many algorithms in channel coding, signal processing, Bayesian inference, and statistical physics. We show that, by extending the underlying algebraic and graphical structures of sum product algorithm, it also provides a unifying perspective for important distributed algorithms in communication networks. Examples treated here include Bellman-Ford (1957, 1962) routing, traffic shaping, wireless network power control, and congestion control. Through local message passing in the form of sum product algorithm on graphs, each of these network control algorithms solves a corresponding global optimization problem. This common framework also leads to new distributed algorithms, such as joint optimization of power control and utility maximization through distributed gradient descent. |

Year | DOI | Venue |
---|---|---|

2002 | 10.1109/GLOCOM.2002.1189060 | GLOBECOM |

Keywords | Field | DocType |

statistical physics,optimisation,congestion control,distributed algorithms,power control,signal processing,wireless network power control,bayesian inference,message passing algorithm,bayes methods,inference mechanisms,statistical analysis,algebraic structure,telecommunication congestion control,channel coding,distributed control,sum product algorithm on graphs,graphical structure,traffic shaping,distributed gradient descent,gradient methods,communication networks,channel capacity,local message passing,graph theory,telecommunication traffic,message passing,telecommunication network routing,global optimization problem,bellman-ford routing,distributed network control,network control algorithms,distributed algorithm,gradient descent,wireless network,global optimization | Graph theory,Wireless network,Gradient descent,Computer science,Power control,Computer network,Theoretical computer science,Distributed algorithm,Network congestion,Traffic shaping,Message passing | Conference |

Volume | ISBN | Citations |

3 | 0-7803-7632-3 | 6 |

PageRank | References | Authors |

1.61 | 0 | 2 |

Authors (2 rows)

Cited by (6 rows)

References (0 rows)

Name | Order | Citations | PageRank |
---|---|---|---|

Mung Chiang | 1 | 7303 | 486.32 |

N. Bambos | 2 | 364 | 135.14 |