### Fast, fair, and efficient flows in networks

### Abstract

We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions are linear and there is a single source and sink. Still, an optimal flow and an equilibrium flow share a desirable property in this situation: All flow-carrying paths have the same length, i.e., these solutions are "fair," which is in general not true for optimal flows in networks with nonlinear latency functions. In addition, the maximum latency of the Nash equilibrium, which can be computed efficiently, is within a constant factor of that of an optimal solution. That is, the so-called price of anarchy is bounded. In contrast, we present a family of instances with multiple sources and a single sink for which the price of anarchy is unbounded, even in networks with linear latencies. Furthermore, we show that an s-t-flow that is optimal with respect to the average latency objective is near-optimal for the maximum latency objective, and it is close to being fair. Conversely, the average latency of a flow minimizing the maximum latency is also within a constant factor of that of a flow minimizing the average latency. Â© 2007 INFORMS.

### Más información

Título según WOS: | Fast, fair, and efficient flows in networks |

Título según SCOPUS: | Fast, fair, and efficient flows in networks |

Título de la Revista: | OPERATIONS RESEARCH |

Volumen: | 55 |

Número: | 2 |

Editorial: | INFORMS |

Fecha de publicación: | 2007 |

Página de inicio: | 215 |

Página final: | 225 |

Idioma: | English |

URL: | http://pubsonline.informs.org/doi/abs/10.1287/opre.1070.0383 |

DOI: |
10.1287/opre.1070.0383 |

Notas: | ISI, SCOPUS |