Abstract
There are potential advantages in formulating the routing problems in modern multiservice networks as multiple objective problems. This paper presents a novel hierarchical bi-level multiobjective dynamic routing model for multiservice networks. It is based on a bi-objective shortest path algorithm, with dynamically adapted soft-constraints, to compute alternative paths for each node pair and on a heuristic to synchronously select alternative routing plans for the network in a dynamic alternative routing context. It is a routing method which periodically changes alternative paths as a function of periodic updates of certain QoS related parameters obtained from real-time measurements. The performance of the proposed routing method is compared with two reference dynamic routing methods namely RTNR and DAR by means of a discrete-event simulator.
Similar content being viewed by others
References
Antunes CH, Craveirinha J, Climaco J, Barrico C (1999). A multiple objective routing algorithm for integrated communication networks. In: Key P, Smith D, (eds). ITC-16 Teletraffic engineering in a competitive world, vol 3b, Elsevier, North Holland, pp. 1291–1300
Ash GR (1993) An analytical model for adaptative routing networks. IEEE Trans Commun 41(11):1748–1759
Ash GR (1998) Dynamic routing in telecommunications networks. McGraw-Hill, New York
Bertsekas D, Gallager R (1992) Data networks. Prentice-Hall, Inc., Upper Saddle River
Clímaco J, Martins EQ (1982) A bicriterion shortest path algorithm. Eur J Oper Res 11:399–404
Conte M (2003) Dynamic routing in broadband networks. Klumwer, Dordrecht
Craveirinha J, Martins L, Gomes T, Antunes CH, Clímaco J.(2003) A new multiple objective dynamic routing method using implied costs. J Telecommun Inf Technol 3:50–59
Elwalid A, Mitra D, Saniee I, Widjaja I (2003) Routing and protection in GMPLS networks: from shortest paths to optimized designs. J. Lightwave Technol 21(11):2828–2838
Faragó A, Blaabjerg S, Ast L, Gordos G, Henk T, (1995)A new degree of freedom in ATM network dimensioning: Optimizing the logical configuration. IEEE J Select Areas Commun 13(7): 1199–1206
Gelenbe E, Lent R, Montuori A, Xu Z(2002) Cognitive packet networks: QoS and performance. In: MASCOTS symposium, IEEE Computer Society.
Gelenbe E, Lent R, Nunez A(2004) Self-aware networks and QoS. In: Proceedings of, the IEEE, vol 92, pp 1478–1489
Gibbens RJ, Kelly FP (1990) Dynamic routing in fully connected networks. IMA J Math Control Inf 7:77–111
Gibbens RJ, Kelly FP, Key PB (1989). Dynamic alternative routing – modelling and behaviour. In: Bonatti M (eds). Teletraffic science for new cost-effective systems, networks and services. ITC-12’. Elsevier, North-Holland, pp. 1019–1025
Gomes T, Martins L, Craveirinha JF (2001) An efficient algorithm for calculating k shortest paths with a maximum number of arcs. Invest Operacional 21:235–244
Jorge L, Craveirinha J, Gomes T (2004) Network performance of multi-service circuit switched networks:simulational comparison of variants of DAR and RTNR. In: International symposium on modelling, analysis, and simulation of computer and telecommunications systems (MASCOTS04). The IEEE Computer Society, pp 513–521
Kaufman JS (1981) Blocking in a shared resource environment. IEEE Trans Commun 29(10): 1474–1481
Kelly FP (1988) Routing in circuit-switched networks: optimization, shadow prices and decentralization. Adv Appl Probabil 20:112–144
Kelly FP (1990) Routing and capacity allocation in networks with trunk reservation. Math Operat Res 15(4):771–793
Kuipers F, Korkmaz T, Krunz M, Mieghem P (2002a) An overview of constraint-based path selection algorithms for QoS routing. IEEE Commun Mag 40(12):50–55
Kuipers F, Korkmaz T, Krunz M, Mieghem P (2002b) A review of constraint-based routing algorithms, Technical report, Delft University of Technology. http://wwwtvs.et.tudelft.nl/people/fernando/papers/TRreviewqosalg.pdf
Lee WC, Hluchyj MG, Humblet PA (1995) Routing subject to quality of service constraints in integrated communication networks. IEEE Netw 9(4):46–55
Martins EQV, Pascoal MMB, Santos JLE (1999) Deviation algorithms for ranking shortest paths. Int J Found Comput Sci 10:247–263
Martins L, Craveirinha J, Clímaco J (2003a), A new multiobjective dynamic routing method for multiservice networks – modelling and performance evaluation, Technical report, INESC – Coimbra
Martins L, Craveirinha J, Clímaco J, Gomes T (2003b) Implementation and performance of a new multiple objective dynamic routing method for multiexchange networks. J Telecommun Inf Technol 3:60–66
Martins L, Craveirinha J, Clímaco J, Gomes T (2005) On a bi-dimensional dynamic alternative routing method. Eur J Operat Res Spec Issue Adv Complex Syst Model 166(3):828–842
Medhi D (2002) QoS routing computation with path caching: a framework and network performance. IEEE Commun Mag 40(12):106–113
Mitra D, Morrison JA (1994) Erlang capacity and uniform approximations for shared unbuffered resources. IEEE/ACM Transact Netw 2(6):558–570
Mitra D, Ramakrishnan K (2001) Techniques for traffic engineering of multiservice, multipriority networks. Bell Labs Tech J 6(1):139–151
Mitra D, Morrison JA, Ramakrishnan KG (1999) Optimization and design of network routing using refined asymptotic approximations. Perform Eval Int J 36–37:267–288
Mitra D, Seery JB (1991) Comparative evaluation of randomized and dynamic routing strategies for circuit-switched networks. IEEE Trans Commun 39(1):102–116
Roberts JW (1983) Teletraffic models for the telecom 1 integrated services network. In: Proceedings of the 10th International teletraffic congress, Montreal
Rodrigues JM, Clímaco JC, Current JR (1999) An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. Comput Operat Res 26:789–798
Wang Z, Crowcroft J (1996). Quality-of-service routing for supporting multimedia appications. IEEE J Select Areas Commun 14(7):1228–1234
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Martins, L., Craveirinha, J. & Clímaco, J. A New Multiobjective Dynamic Routing Method for Multiservice Networks: Modelling and Performance. CMS 3, 225–244 (2006). https://doi.org/10.1007/s10287-006-0014-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10287-006-0014-z