## Abstract

A nearly optimal local control algorithm is demonstrated on the open problem given that for any network, given any collection of packets with a specified route for each packet, there exists an `optimal' schedule for all these packets. That is, there exists a schedule for the motion of the packets such that at each step, every edge is crossed by at most one packet, and all the packets are delivered to their destinations in O(C+D) steps where C is the `congestion', and D is the `dilation'. A randomized local control algorithm is shown which for any network topology delivers all the packets to their destination in time O(C+D+log^{1+ε} N) with high probability, where N is the size of the problem, and ε>0 is arbitrary.

Original language | American English |
---|---|

Pages (from-to) | 644-653 |

Number of pages | 10 |

Journal | Conference Proceedings of the Annual ACM Symposium on Theory of Computing |

DOIs | |

State | Published - 1997 |

Externally published | Yes |

Event | Proceedings of the 1997 29th Annual ACM Symposium on Theory of Computing - El Paso, TX, USA Duration: 4 May 1997 → 6 May 1997 |

## Fingerprint

Dive into the research topics of 'Universal O(congestion+dilation+log^{1+ε}N) local control packet switching algorithms'. Together they form a unique fingerprint.