Abstract
The quickest path problem deals with the transmission of a message of size σ from a source to a destination with the minimum end-to-end delay over a network with bandwidth and delay constraints on the links. We adapt properties of the quickest path to solve the delay-bounded minimum-cost (DBMC) path problem that is known to be the NP-hard. In this paper, we propose two efficient and simple algorithms, DBMCQP and DBMCQRT. DBMCQP computes a DBMC quickest path for a given message size σ with O(rm + rnlogn), and DBMCQRT construct DBMC routing tables taking into account multiple delay-bounds for any size of message with O(kr 2), where r, n, m, and k are the number of distinct link-bandwidths, nodes, links of the network, and the number of delay-bounds, respectively.
Research of Dr. Bang is sponsored by Electronics and Telecommunications Research Institutes under Contract No. 1010-2003-0038.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicasting for multimedia applications. In: Proc. IEEE INFOCOM 1992, pp. 2078–2085 (1992)
Sun, Q., Langendoerfer, H.: Efficient multicast routing for delay-sensitive applications. In: Proc. Second Workshop Protocols Multimedia Systems (PROMS 1995), October 1995, pp. 452–458 (1995)
Widyono, R.: The design and evaluation of routing algorithms for real-time channels. In: International Computer Science Institute, University of California at Berkeley, Tech. Rep. ICSI TR-94-024 (June 1994)
Alrabiah, T., Znati, T.: Low-Cost, Bounded-Delay Multicast Routing for QoS-Based Networks. In: Seventh International Conference on Computer Communications and Networks, Lafayette, Louisiana, October 1998, pp. 304–311 (1998)
Zhu, Q., Parsa, M., Garcia-Luna-Aceves, J.J.: A source-based algorithm for delayconstrained minimum-cost multicasting. In: Proc. IEEE INFOCOM 1995, pp. 377–385 (1995)
Reeves, D.S., Salama, H.F.: A distributed algorithm for delay-constrained unicast routing. IEEE/ACM Transactions on Networking 8(2), 239–250
Mollenauer, J.F.: On the fastest routes for convoy-type traffic in flow-rate-constrained networks. Transportation Science 10, 113–124 (1976)
Chen, Y.L., Chin, Y.H.: The quickest path problem. Computers and Operations Research 17(2), 153–161
Rosen, J.B., Sun, S.Z., Xue, G.L.: Algorithms for the quickest path problem and the enumeration of quickest paths. Computers and Operations Research 18(6), 579–584
Hung, Y.C., Chen, G.H.: Distributed algorithms for the quickest path problem. Parallel Computing 18, 823–834
Martins, E.Q.V., Santos, J.L.E.: An algorithms for the quickest path problem. Operation Research Letters 20, 195–198
Rao, N.S.V., Batsell, S.G.: Algorithm for minimum end-to-end delay paths. IEEE Communications Letters 1(5), 152–154
Bang, Y.C., Radhakrishnan, S., Rao, N.S.V., Batsell, S.G.: On update algorithms for quickest paths. Computer Communications 23, 1064–1068
Xue, G.: End-to-End data paths: Quickest or most reliable? IEEE Communications Letters 2(6), 156–158
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. McGraw-Hill, New York (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bang, YC., Hong, I., Lee, S., Ahn, B. (2004). On Algorithms for Minimum-Cost Quickest Paths with Multiple Delay-Bounds. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3043. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24707-4_126
Download citation
DOI: https://doi.org/10.1007/978-3-540-24707-4_126
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22054-1
Online ISBN: 978-3-540-24707-4
eBook Packages: Springer Book Archive