A new multiobjective dynamic routing method for multiservice networks: Modelling and performance

Computational Management Science

Volumn 3, Issue 3, 2006, Pages 225-244

  Martins, Lúcia ^a,c   Craveirinha, José ^a,c   Clímaco, João ^b,c  

^a UNIVERSITY OF COIMBRA   (Portugal)

^b UNIVERSITY OF COIMBRA   (Portugal)

^c INESC COIMBRA   (Portugal)

Author keywords

Communication networks; Dynamic routing; Heuristics; Mutiobjective optimisation

Indexed keywords

EID: 33746504508     PISSN: 1619697X     EISSN: 16196988     Source Type: Journal    
DOI: 10.1007/s10287-006-0014-z     Document Type: Article

References (33)

1. 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
2. Ash GR (1993) An analytical model for adaptative routing networks. IEEE Trans Commun 41(11):1748-1759
3. Ash GR (1998) Dynamic routing in telecommunications networks. McGraw-Hill, New York
4. Bertsekas D, Gallager R (1992) Data networks. Prentice-Hall, Inc., Upper Saddle River
5. Clímaco J, Martins EQ (1982) A bicriterion shortest path algorithm. Eur J Oper Res 11:399-404
6. Conte M (2003) Dynamic routing in broadband networks. Klumwer, Dordrecht
7. Craveirinha J, Martins L, Gomes T, Antunes CH, Cli7acute;maco J.(2003) A new multiple objective dynamic routing method using implied costs. J Telecommun Inf Technol 3:50-59
8. 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
9. 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
10. Gelenbe E, Lent R, Montuori A, Xu Z(2002) Cognitive packet networks: QoS and performance. In: MASCOTS symposium, IEEE Computer Society.
11. Gelenbe E, Lent R, Nunez A(2004) Self-aware networks and QoS. In: Proceedings of the IEEE, vol 92, pp 1478-1489
12. Gibbens RJ, Kelly FP (1990) Dynamic routing in fully connected networks. IMA J Math Control Inf 7:77-111
13. 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
14. 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
15. 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
16. Kaufman JS (1981) Blocking in a shared resource environment. IEEE Trans Commun 29(10): 1474-1481
17. Kelly FP (1988) Routing in circuit-switched networks: Optimization, shadow prices and decentralization. Adv Appl Probabil 20:112-144
18. Kelly FP (1990) Routing and capacity allocation in networks with trunk reservation. Math Operat Res 15(4):771-793
19. 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
20. 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
21. Lee WC, Hluchyj MG, Humblet PA (1995) Routing subject to quality of service constraints in integrated communication networks. IEEE Netw 9(4):46-55
22. Martins EQV, Pascoal MMB, Santos JLE (1999) Deviation algorithms for ranking shortest paths. Int J Found Comput Sci 10:247-263
23. 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
24. 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
25. 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
26. Medhi D (2002) QoS routing computation with path caching: A framework and network performance. IEEE Commun Mag 40(12):106-113
27. Mitra D, Morrison JA (1994) Erlang capacity and uniform approximations for shared unbuffered resources. IEEE/ACM Transact Netw 2(6):558-570
28. Mitra D, Ramakrishnan K (2001) Techniques for traffic engineering of multiservice, multipriority networks. Bell Labs Tech J 6(1):139-151
29. 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
30. Mitra D, Seery JB (1991) Comparative evaluation of randomized and dynamic routing strategies for circuit-switched networks. IEEE Trans Commun 39(1):102-116
31. Roberts JW (1983) Teletraffic models for the telecom 1 integrated services network. In: Proceedings of the 10th International teletraffic congress, Montreal
32. 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
33. Wang Z, Crowcroft J (1996). Quality-of-service routing for supporting multimedia appications. IEEE J Select Areas Commun 14(7):1228-1234