Second-order methods for distributed approximate single- and multicommodity flow

S. Muthukrishnan, Torsten Suel

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    We study local-control algorithms for maximum flow and multicommodity flow problems in distributed networks. We propose a second-order method for accelerating the convergence of the “first-order” distributed algorithms recently proposed by Awerbuch and Leighton. Our experimental study shows that second-order methods are significantly faster than the first-order methods for approximate single- and multicommodity flow problems. Furthermore, our experimental study gives valuable insights into the diffusive processes that underly these local-control algorithms; this leads us to identify many open technical problems for theoretical study.

    Original languageEnglish (US)
    Title of host publicationRandomization and Approximation Techniques in Computer Science - 2nd International Workshop, RANDOM 1998, Proceedings
    PublisherSpringer Verlag
    Pages369-384
    Number of pages16
    Volume1518
    ISBN (Print)354065142X, 9783540651420
    DOIs
    StatePublished - 1998
    Event2nd International Workshop on Randomization and Approximation Techniques in Computer Science, Random 1998 - Barcelona, Spain
    Duration: Oct 8 1998Oct 10 1998

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume1518
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other2nd International Workshop on Randomization and Approximation Techniques in Computer Science, Random 1998
    CountrySpain
    CityBarcelona
    Period10/8/9810/10/98

    Fingerprint

    Multicommodity Flow
    Local Algorithms
    Control Algorithm
    Experimental Study
    Parallel algorithms
    First-order
    Maximum Flow
    Distributed Networks
    Distributed Algorithms

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Muthukrishnan, S., & Suel, T. (1998). Second-order methods for distributed approximate single- and multicommodity flow. In Randomization and Approximation Techniques in Computer Science - 2nd International Workshop, RANDOM 1998, Proceedings (Vol. 1518, pp. 369-384). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1518). Springer Verlag. https://doi.org/10.1007/3-540-49543-6_29

    Second-order methods for distributed approximate single- and multicommodity flow. / Muthukrishnan, S.; Suel, Torsten.

    Randomization and Approximation Techniques in Computer Science - 2nd International Workshop, RANDOM 1998, Proceedings. Vol. 1518 Springer Verlag, 1998. p. 369-384 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1518).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Muthukrishnan, S & Suel, T 1998, Second-order methods for distributed approximate single- and multicommodity flow. in Randomization and Approximation Techniques in Computer Science - 2nd International Workshop, RANDOM 1998, Proceedings. vol. 1518, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1518, Springer Verlag, pp. 369-384, 2nd International Workshop on Randomization and Approximation Techniques in Computer Science, Random 1998, Barcelona, Spain, 10/8/98. https://doi.org/10.1007/3-540-49543-6_29
    Muthukrishnan S, Suel T. Second-order methods for distributed approximate single- and multicommodity flow. In Randomization and Approximation Techniques in Computer Science - 2nd International Workshop, RANDOM 1998, Proceedings. Vol. 1518. Springer Verlag. 1998. p. 369-384. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-49543-6_29
    Muthukrishnan, S. ; Suel, Torsten. / Second-order methods for distributed approximate single- and multicommodity flow. Randomization and Approximation Techniques in Computer Science - 2nd International Workshop, RANDOM 1998, Proceedings. Vol. 1518 Springer Verlag, 1998. pp. 369-384 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{be3e3907ed7b4bd397f999da9417a9f7,
    title = "Second-order methods for distributed approximate single- and multicommodity flow",
    abstract = "We study local-control algorithms for maximum flow and multicommodity flow problems in distributed networks. We propose a second-order method for accelerating the convergence of the “first-order” distributed algorithms recently proposed by Awerbuch and Leighton. Our experimental study shows that second-order methods are significantly faster than the first-order methods for approximate single- and multicommodity flow problems. Furthermore, our experimental study gives valuable insights into the diffusive processes that underly these local-control algorithms; this leads us to identify many open technical problems for theoretical study.",
    author = "S. Muthukrishnan and Torsten Suel",
    year = "1998",
    doi = "10.1007/3-540-49543-6_29",
    language = "English (US)",
    isbn = "354065142X",
    volume = "1518",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "369--384",
    booktitle = "Randomization and Approximation Techniques in Computer Science - 2nd International Workshop, RANDOM 1998, Proceedings",

    }

    TY - GEN

    T1 - Second-order methods for distributed approximate single- and multicommodity flow

    AU - Muthukrishnan, S.

    AU - Suel, Torsten

    PY - 1998

    Y1 - 1998

    N2 - We study local-control algorithms for maximum flow and multicommodity flow problems in distributed networks. We propose a second-order method for accelerating the convergence of the “first-order” distributed algorithms recently proposed by Awerbuch and Leighton. Our experimental study shows that second-order methods are significantly faster than the first-order methods for approximate single- and multicommodity flow problems. Furthermore, our experimental study gives valuable insights into the diffusive processes that underly these local-control algorithms; this leads us to identify many open technical problems for theoretical study.

    AB - We study local-control algorithms for maximum flow and multicommodity flow problems in distributed networks. We propose a second-order method for accelerating the convergence of the “first-order” distributed algorithms recently proposed by Awerbuch and Leighton. Our experimental study shows that second-order methods are significantly faster than the first-order methods for approximate single- and multicommodity flow problems. Furthermore, our experimental study gives valuable insights into the diffusive processes that underly these local-control algorithms; this leads us to identify many open technical problems for theoretical study.

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

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

    U2 - 10.1007/3-540-49543-6_29

    DO - 10.1007/3-540-49543-6_29

    M3 - Conference contribution

    AN - SCOPUS:84958675847

    SN - 354065142X

    SN - 9783540651420

    VL - 1518

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 369

    EP - 384

    BT - Randomization and Approximation Techniques in Computer Science - 2nd International Workshop, RANDOM 1998, Proceedings

    PB - Springer Verlag

    ER -