Abstract
This investigation addresses an important and difficult combinatorial optimization problem in the design and management of telecommunication systems known as the path assignment problem. The path assignment problem is specified by a set of demands on a network with given link capacities. Each demand must be assigned to exactly one routing path in such a way that the total amount of traffic routed over any link does not exceed that link’s capacity. Given a network and a path assignment, the problem of interest is to maximize the available bandwidth (throughput) for a new demand. Network managers are concerned with the quality of service provided by their networks, and so they are reluctant to make major changes to an operating network that may inadvertently result in service disruptions for numerous clients simultaneously. Therefore, the objective of this investigation is to develop and test optimization models and algorithms that produce a series of throughput-improving modifications to the original path assignment. This allows network managers to implement the improved routing in stages with minimal changes to the overall routing plan between any two consecutive stages. Although the procedure may only reroute a few demands at each stage, the routing after the last stage should be as close as possible to an optimal routing. That is, it must maximize the throughput for the new demand. We present integer programming models and associated solution algorithms to maximize the throughput with a sequence of incremental path modifications. The algorithms were implemented with the AMPL modeling language and the CPLEX ILP solver, and tested on a family of five different data sets based on a European network widely studied in the literature. Empirical results show that the incremental approach finds near-optimal results within reasonable limits on CPU time.
Similar content being viewed by others
References
Allen, D., Kennington, J., Ismail, I., & Olinick, E. (2003). An incremental procedure for improving path assignment in a telecommunication network. Journal of Heuristics, 9(5), 375–399.
Anderson, C., Fraughnaugh, K., Parker, M., & Ryan, J. (1993). Path assignment for call routing: an application of tabu search. Annals of Operations Research, 41(4), 301–312.
Attanasio, R., & Hoffman, K. (1993). The right tool kit is all a network planner needs. Telephony, April, 22–26.
Cosares, S., Deutsch, D. N., Saniee, I., & Wasem, O. J. (1995). SONET Toolkit: a decision support system for designing robust and cost-effective fiber-optic networks. Interfaces, 25(1), 20–40.
Cox, L., Davis, L., & Qiu, Y. (1991). Dynamic anticipatory routing in circuit-switched telecommunications networks. In L. Davis (Ed.), Handbook of genetic algorithms. New York: Van Nostrand Reinhold.
Fourer, R., Gay, D., & Kernighan, B. (2003). AMPL: a modeling language for mathematical programming (2nd edn.). Pacific Grove: Brooks/Cole-Thompson Learning.
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman.
IBM. http://ilog.com/products/cplex/. Accessed on August 27, 2009.
IBM. ILOG CPLEX 11.0 parameters reference manual. http://www.decf.berkeley.edu/help/apps/ampl/cplex-doc/refparameterscplex/refparameterscplex40.html#265060. Accessed on August 27, 2009.
Józsa, B. G. (2002). Reroute sequence planning for protected traffic flows in GMPLS networks. In IEEE international conference on communications (pp. 2702–2706).
Józsa, B. G., & Magyar, G. (2001). Reroute sequence planning for label switched paths in multiprotocol label switching networks. In IEEE symposium on computers and communications (pp. 319–325).
Józsa, B. G., & Makai, M. (2003). On the solution of reroute sequence planning problem in MPLS networks. Computer Networks, 42(2), 199–210.
Klopfenstein, O. (2008). Rerouting tunnels for MPLS network resource optimization. European Journal of Operational Research, 188(1), 293–312.
Laguna, M., & Glover, F. (1993). Bandwidth packing: a tabu search approach. Management Science, 39(4), 492–500.
Olinick, E., & Rahman, T. (2007). Improving telecommunications network throughput by incremental demand routing (Technical Report 07-EMIS-02). Southern Methodist University, Dallas, TX 75275, 2007.
Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial optimization: algorithms and complexity. New York: Prentice-Hall.
Parker, M., & Ryan, J. (1994). A column generation algorithm for bandwidth packing. Telecommunications Systems, 2(1), 185–195.
Van Caenegem, B., Van Parys, W., De Turck, F., & Demesster, P. (1998). Dimensioning of survivable WDM networks. IEEE Journal on Selected Areas in Communications, 16(7), 1146–1157.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Olinick, E.V., Rahman, T.M. Incremental demand rerouting: optimization models and algorithms. Telecommun Syst 46, 61–80 (2011). https://doi.org/10.1007/s11235-009-9274-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11235-009-9274-6