Fast data transmission and maximal dynamic flow

https://doi.org/10.1016/S0020-0190(98)00047-7Get rights and content

Abstract

Let N = (V, A, c, l) be a network with node set V, arc set A, non-negative arc capacity function c and non-negative arc delay function l. We are interested in the fastest way to transmit ƒ amount of data from a designated source node s ϵ V to a designated destination node d ϵ V. When the transmission is restricted to a single path, the problem is called the quickest path problem which has been well studied in the past few years and many efficient algorithms are known. When the transmission is not restricted to a single path, the problem is called the quickest flow problem or the minimum transmission time problem in the literature. Since data transmission is not restricted to a single path in the minimum transmission time problem, the problem was believed to be harder. In (Kagaris et al., 1995), it was proved that the minimum transmission time problem with integer capacities and real delays is NP-hard. In this paper, we show that the minimum transmission time problem with integer capacities and integer delays is equivalent to the maximal dynamic flow problem studied by Ford and Fulkerson in 1962 and therefore can be solved efficiently by their path decomposition algorithm.

References (12)

There are more references available in the full text version of this article.

Cited by (10)

  • Fast and fine quickest path algorithm

    2014, European Journal of Operational Research
    Citation Excerpt :

    Several authors have also developed some extensions to the QPP problem. See for example (Chen, 1993; Chen and Hung, 1993; Lee and Papadopoulou, 1993; Chen, 1994; Chen and Hung, 1994; Xue, 1998; Xue et al., 1998; Kagaris et al., 1999; Calvete and del-Pozo, 2003; Lin, 2003; Calvete, 2004;Rao, 2004; Pascoal et al., 2005; Pascoal et al., 2007; Ruzika and Thiemann, 2012). Furthermore, we show that our method outperforms the previous methods in the different extensive experiments that we carried out.

  • A label-setting algorithm for finding a quickest path

    2004, Computers and Operations Research
  • Optimal multichannel data transmission in computer networks

    2003, Computer Communications
    Citation Excerpt :

    The same example shows that the algorithm of Ref. [6] is also suboptimal. While the author was writing this paper, N.S.V. Rao also discovered the mistake in Ref. [29] independently [19]. The author would like to thank N.S.V. Rao for many helpful discussions.

  • On source-based route computation for quickest paths under dynamic bandwidth constraints

    2003, International Journal of Foundations of Computer Science
  • Distributed multicast multichannel paths

    2012, Telecommunication Systems
View all citing articles on Scopus

The research of this author was supported in part by the US Army Research Office grant DAAH04-96-1 -0233 and by the National Science Foundation grants ASC-9409285 and OSR-9350540.

View full text