### Abstract

This paper considers the following fundamental maximum throughput routing problem: given a set of k (splittable) multicommodity flows with equal demands in an n-node network, select and route a subset of flows such that the total number of commodities routed that satisfy their demands (i.e., the all-or-nothing throughput) is maximized. Our main contribution is the first constant (i.e., independent of k and n) throughput-approximation algorithm for this NP-hard problem, with sublin-ear, namely O(√k), edge capacity violation ratio. Our algorithm is based on a clever application of randomized rounding. We also present an interesting application of our result in the context of delay-tolerant network scheduling. We complement our theoretical contribution with extensive simulation in two different scenarios, and find that our algorithm performs significantly better than predicted in theory, achieving an edge capacity violation ratio of at most 3.

Original language | English (US) |
---|---|

Title of host publication | INFOCOM 2019 - IEEE Conference on Computer Communications |

Publisher | Institute of Electrical and Electronics Engineers Inc. |

Pages | 46-54 |

Number of pages | 9 |

ISBN (Electronic) | 9781728105154 |

DOIs | |

State | Published - Apr 1 2019 |

Event | 2019 IEEE Conference on Computer Communications, INFOCOM 2019 - Paris, France Duration: Apr 29 2019 → May 2 2019 |

### Publication series

Name | Proceedings - IEEE INFOCOM |
---|---|

Volume | 2019-April |

ISSN (Print) | 0743-166X |

### Conference

Conference | 2019 IEEE Conference on Computer Communications, INFOCOM 2019 |
---|---|

Country | France |

City | Paris |

Period | 4/29/19 → 5/2/19 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Electrical and Electronic Engineering

### Cite this

*INFOCOM 2019 - IEEE Conference on Computer Communications*(pp. 46-54). [8737402] (Proceedings - IEEE INFOCOM; Vol. 2019-April). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/INFOCOM.2019.8737402

**A Constant Approximation for Maximum Throughput Multicommodity Routing and Its Application to Delay-Tolerant Network Scheduling.** / Liu, Mengxue; Richa, Andrea; Rost, Matthias; Schmid, Stefan.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*INFOCOM 2019 - IEEE Conference on Computer Communications.*, 8737402, Proceedings - IEEE INFOCOM, vol. 2019-April, Institute of Electrical and Electronics Engineers Inc., pp. 46-54, 2019 IEEE Conference on Computer Communications, INFOCOM 2019, Paris, France, 4/29/19. https://doi.org/10.1109/INFOCOM.2019.8737402

}

TY - GEN

T1 - A Constant Approximation for Maximum Throughput Multicommodity Routing and Its Application to Delay-Tolerant Network Scheduling

AU - Liu, Mengxue

AU - Richa, Andrea

AU - Rost, Matthias

AU - Schmid, Stefan

PY - 2019/4/1

Y1 - 2019/4/1

N2 - This paper considers the following fundamental maximum throughput routing problem: given a set of k (splittable) multicommodity flows with equal demands in an n-node network, select and route a subset of flows such that the total number of commodities routed that satisfy their demands (i.e., the all-or-nothing throughput) is maximized. Our main contribution is the first constant (i.e., independent of k and n) throughput-approximation algorithm for this NP-hard problem, with sublin-ear, namely O(√k), edge capacity violation ratio. Our algorithm is based on a clever application of randomized rounding. We also present an interesting application of our result in the context of delay-tolerant network scheduling. We complement our theoretical contribution with extensive simulation in two different scenarios, and find that our algorithm performs significantly better than predicted in theory, achieving an edge capacity violation ratio of at most 3.

AB - This paper considers the following fundamental maximum throughput routing problem: given a set of k (splittable) multicommodity flows with equal demands in an n-node network, select and route a subset of flows such that the total number of commodities routed that satisfy their demands (i.e., the all-or-nothing throughput) is maximized. Our main contribution is the first constant (i.e., independent of k and n) throughput-approximation algorithm for this NP-hard problem, with sublin-ear, namely O(√k), edge capacity violation ratio. Our algorithm is based on a clever application of randomized rounding. We also present an interesting application of our result in the context of delay-tolerant network scheduling. We complement our theoretical contribution with extensive simulation in two different scenarios, and find that our algorithm performs significantly better than predicted in theory, achieving an edge capacity violation ratio of at most 3.

UR - http://www.scopus.com/inward/record.url?scp=85068228643&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85068228643&partnerID=8YFLogxK

U2 - 10.1109/INFOCOM.2019.8737402

DO - 10.1109/INFOCOM.2019.8737402

M3 - Conference contribution

T3 - Proceedings - IEEE INFOCOM

SP - 46

EP - 54

BT - INFOCOM 2019 - IEEE Conference on Computer Communications

PB - Institute of Electrical and Electronics Engineers Inc.

ER -