A Bicriterion Approach for Routing Problems in Multimedia Networks

Networks

Volumn 41, Issue 4, 2003, Pages 206-220

  Clímaco, João C N ^a,b   Craveirinha, José M F ^b,c   Pascoal, Marta M B ^c  

^a UNIVERSITY OF COIMBRA   (Portugal)

^b INESC COIMBRA   (Portugal)

^c UNIVERSITY OF COIMBRA   (Portugal)

Author keywords

Bicriterion shortest path; Multimedia network; Path ranking; Routing problems

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTATIONAL METHODS; HEURISTIC METHODS; MATHEMATICAL MODELS; MULTIMEDIA SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; QUALITY OF SERVICE; ROUTERS;

BICRITERION SHORTEST PATH; MULTIMEDIA NETWORK; PATH RANKING; ROUTING PROBLEMS;

TELECOMMUNICATION NETWORKS;

EID: 11144356021     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10073     Document Type: Article

References (19)

1. J.A. Azevedo, M.E.O.S. Costa, J.J.E.R.S. Madeira, and E.Q.V. Martins, An algorithm for the ranking of shortest paths, Eur J Oper Res 69 (1993), 97-106.
2. J.A. Azevedo, J.J.E.R.S. Madeira, E.Q.V. Martins, and F.M.A. Pires, A shortest paths ranking algorithm, Proc Ann Conf AIRO'90, Models and Methods for Decision Support, Operational Research Society of Italy, 1990, pp. 1001-1011.
3. J.A. Azevedo, J.J.E.R.S. Madeira, E.Q.V. Martins, and F.M.A. Pires, A computational improvement for a shortest paths ranking algorithm, Eur J Oper Res 73 (1994), 188-191.
4. J.C.N. Clímaco and E.Q.V. Martins, On the determination of the nondominated paths in a multiobjective network problem, Proc V Symp über Operations Research, Köln, 1980, Methods in operations research, Anton Hain, Königstein, 1981, Vol. 40, pp. 255-258.
5. J.C.N. Clímaco and E.Q.V. Martins, A bicriterion shortest path algorithm, Eur J Oper Res 11 (1982), 399-404.
6. P. Hansen, "Bicriterion path problems," Multiple criteria decision making: Theory and applications, G. Fandel and T. Gal (Editors), Lectures Notes in Economics and Mathematical Systems, Springer, Heidelberg, 1980, Vol. 177, pp. 109-127.
7. V.P. Kompella, J.C. Pasquale, and G.G. Polyzos, Multicast routing for multimedia communications, IEEE/ACM Trans Netwrk 1 (1993), 286-292.
8. W.C. Lee, M.G. Hluchyj, and P.A. Humblet, Routing subject to quality of service constraints in integrated communication networks, IEEE Netwrk July/Aug. (1995), pp. 46-55.
9. E.Q.V. Martins, An algorithm for ranking paths that may contain cycles, Eur J of Oper Res 18 (1984), 123-130.
10. E.Q.V. Martins, On a multicriteria shortest path problem, Eur J Oper Res 16 (1984), 236-245.
11. E.Q.V. Martins, M.M.B. Pascoal, and J.L.E. Santos, A new algorithm for ranking loopless paths, Research report, CISUC, 1997 (http://www.mat.uc.pt/ ~marta/Publicacoes/mps.ps.gz).
12. E.Q.V. Martins, M.M.B. Pascoal, and J.L.E. Santos, Deviation algorithms for ranking shortest paths, Int J Found Comput Sci 10 (1999), 247-263 (http://www.mat.uc.pt/~marta/Publicacoes/deviation.ps.gz).
13. E.Q.V. Martins, M.M.B. Pascoal, and J.L.E. Santos, A new improvement for a k shortest paths algorithm, Invest Oper 21 (2001), 47-60 (http://www.mat.uc. pt/~marta/Publicacoes/IMP_MS.ps.gz).
14. E.Q.V. Martins and J.L.E. Santos, A new shortest paths ranking algorithm, Invest Oper 20 (2000), 47-62 (http://www.mat.uc.pt/~eqvm/cientificos/ investigacao/Artigos/K.ps.gz).
15. M. Mueller-Hannemann and K. Weihe, Pareto shortest paths is often feasible in practice, Proc 5th Int WAE'01, Lecture Notes in Computer Science, Aarhus, Denmark, 2001, Vol. 2141, pp. 185-198.
16. C. Pornavalai, G. Chakraborty, and N. Shiratori, Routing with multiple QoS requirements for supporting multimedia applications, Telecommun Syst 9 (1998), 357-373.
17. J.L.E. Santos, Uma abordagem ao problema do trajecto óptimo multiobjectivo, Invest Oper 19 (1999), 211-226.
18. A. Skriver, A classification of bicriterion shortest path (bsp) algo-rithms, Asia-Pac J Oper Res 17 (2000), 192-212 (http://www.imf.au.dk/cgi- bin/w3-msql/publications/genericpublication.html?publ=242).
19. J.Y. Fen, Finding the k shortest loopless paths in a network, Mgmt Sci 17 (1971), 712-716.