Abstract
The problem is concerned with designing of wide area networks (WAN). The problem consists in selection of flow routes, channel capacities and wide area network topology in order to minimize the total average delay per packet and the leasing cost of channels subject to delay constraint. The problem is NP complete. Then, the branch and bound method is used to construct the exact algorithm. Lower bound of the criterion function is proposed. Computational results are reported. Based on computational experiments, several properties of the considered problem are formulated.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alevras D., Groetschel M., Weesaly R.: Cost Efficient Network Synthesis from Leased Lines. Annals of Operation Research 76 (1998) 1–20
Amiri A.: A System for the Design of Packet-Switched Communication Networks with Economic Tradeoffs. Computer Communications 21 (1998) 1670–1680.
Gavish B., Neuman I.: A System for Routing Capacity Assignment in Computer Communication Networks. IEEE Transactions on Communication. 37 (1989) 360–366
Gerla M., Kleinrock L.: On the Topological Design of Distributed Computer Network. IEEE Transactions on Communication 25 (1977). 48–60.
Gola M., Kasprzak A.: An Exact Algorithm for CFA problem in WAN with Combined Cost Criterion and with Budget and Delay Constraints. Proc. of Sixteenth European Meeting on Cybernetics and System Research, Vienna (2002) 867–872
Kasprzak A.: Topological Design of the Wide Area Networks. Wroclaw University of Technology Press, Wroclaw (2001)
Minoux M.: Network Synthesis and Optimum Network Design Problems: Models, solution methods and applications. Networks 19 (1989) 313–360
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gola, M., Kasprzak, A. (2003). The Two-Criteria Topological Design Problem in WAN with Delay Constraint: An Algorithm and Computational Results. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44839-X_20
Download citation
DOI: https://doi.org/10.1007/3-540-44839-X_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40155-1
Online ISBN: 978-3-540-44839-6
eBook Packages: Springer Book Archive