Skip to main content
SpringerLink
Log in

Multicriteria Analysis in Telecommunication Network Planning and Design — Problems and Issues

  • Chapter
Multiple Criteria Decision Analysis: State of the Art Surveys

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 78))

Abstract

The interaction between a complex socio-economic environment and the extremely fast pace of development of new telecommunication technologies and services justifies the interest in using multicriteria evaluation in decision making processes associated with several phases of network planning and design. Based on an overview of current and foreseen evolutions in telecommunication network technologies and services we begin by identifying and discussing challenges and issues concerning the use of multicriteria analysis (M.A.) in telecommunication network planning and design problems. Next we present a review of contributions in these areas, with particular emphasis on network modernisation planning and routing problems. We will also outline an agenda of current and future research trends and issues in this application area of multicriteria modelling.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 269.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Aboellela and C. Douligeris. Fuzzy generalyzed network approach for solving an optimization model for routing in B-ISDN. Telecommunication Systems, 12:237–263, 1999.

    Article  Google Scholar 

  2. J. Akkanen and J.K. Nurminen. Case study of the evolution of routing algorithms in a network plannig tool. The Journal of Systems and Software, 58(3):181–198, 2001.

    Article  Google Scholar 

  3. G. Anandalingam and K. Nam. Conflict and cooperation in designing internatioal telecommunication networks. Journal of the Operational Research Society, 48:600–611, 1997.

    Article  Google Scholar 

  4. Y. Aneja and K. Nair. The constrained shortest path problem. Naval Research Logistics Quarterly, 25:549–555, 1978.

    Article  MathSciNet  Google Scholar 

  5. C.H. Antunes, M.J. Alves, A.L. Silva, and J. Clímaco. An integrated MOLP method base package — A guided tour of TOMMIX. Computers and Operations Research, 19(7):609–625, 1992.

    Article  Google Scholar 

  6. C.H. Antunes, J. Clímaco, and J. Craveirinha. A multiple objective linear programming approach to the modernization of telecommunication networks, in teletraffic and datatraffic — socioeconomic aspects. In A. Jensen and B. Iversen, editors, Proceedings of the 13th International Teletraffic Congress — ITC 13, Copenhagen, volume 17 of North-Holland Studies in Telecommunications, pages 369–374. North-Holland, Amsterdam, 1991.

    Google Scholar 

  7. C.H. Antunes, J. Clímaco, and J. Craveirinha. On multicriteria decision making approaches concerning strategic new telecommunication planning. In T. Matsuda, J. Lesourne, and Y. Takahar, editors, Proceedings of the International Conference on Economics Management and Information Technology, volume 92, pages 95–98, Tokyo, 1992. The Japanese Society of Management Information.

    Google Scholar 

  8. C.H. Antunes, J. Clímaco, J. Craveirinha, and C. Barrico. Multiple objective routing in integrated communication networks. In D. Smith and P. Key, editors, Teletraffic Engineering in a Competitive World. Proceedings of the 16th International Teletraffic Congress-ITC 16, Edinburgh, pages 1291–1300. Elsevier, Amsterdam, 1999.

    Google Scholar 

  9. C.H. Antunes, J. Craveirinha, and J. Clímaco. A multiple criteria model for new telecommunication service planning. European Journal of Operational Research, 71(3):341–352, 1993.

    Article  Google Scholar 

  10. C.H. Antunes, J. Craveirinha, and J. Clímaco. A flexible MOLP approach to the modernization of telecommunication networks incorporating sensitivity analysis. In J. Labetoulle and J.W. Roberts, editors, Proceedings of the 14th International Teletraffic Congress on Advances in Teletraffic Science and Engineering — ITC 14, pages 1425–1434, Elsevier, Amsterdam, 1994.

    Google Scholar 

  11. C.H. Antunes, J. Craveirinha, and J. Clímaco. Planning the evolution to broadband access networks — A multicriteria approach, European Journal of Operational Research, 109(2):530–540, 1998.

    Article  Google Scholar 

  12. G.R. Ash. Dynamic Routing in Telecommunication Networks. McGraw-Hill, New York, 1998.

    Google Scholar 

  13. C. Assi, A. Shami, M.A. Ali, R. Kurtz, and D. Guo. Optical networking and real-time provisioning: An integrated vision for the next-generation internet. IEEE Networks, 15(4):36–45, 2001.

    Article  Google Scholar 

  14. C. Bana e Costa, L. Ehsslim, and I.J. Zanella. A real world MCDA application in cellular telephony systems. In T. Stewart and R.C. van der Honert, editors, Trends in Multicriteria Decision Making, volume 465 of Lecture Notes in Economics and Mathematical Systems, pages 412–426. Springer Verlag, Berlin, 1998.

    Google Scholar 

  15. C. Bana e Costa and J.C. Vansnick. MACBETH — An interactive path towards the construction of cardinal value functions. International Transactions in Operations Research, 1(4):489–500, 1994.

    Article  Google Scholar 

  16. A. Banerjee, J. Drake, J.P. Lang, B. Turner, K. Kompella, and Y. Rekhter. Generalized multiprotocol label switching: An overview of routing and management enhancements. IEEE Communications Magazine, 39(1):144–149, 2001.

    Article  Google Scholar 

  17. J.F. Bard and J.J. Moore. A branch-and-bound algorithm for the bilevel linear programming problem. SIAM Journal on Science and Statistical Computing, 11:281–292, 1990.

    Article  MathSciNet  Google Scholar 

  18. Baskerville Strategic Research. Global mobile forecasts to 2010.3rd edition, April 2002.

    Google Scholar 

  19. V. Belton, F. Ackermann, and I. Shepherd. Integrated support from problem structuring through to alternative evaluation using cope and visa. Journal of Multi-Criteria Decision Analysis, 6:115–130, 1997.

    Article  Google Scholar 

  20. D. Bertsekas and R. Gallager. Data Networks. Prentice-Hall, Englewood Cliffs, 2001.

    Google Scholar 

  21. D. Blokh and G. Gutin. An approximate algorithm for combinatorial optimization problems with two parameters. Australasian Journal of Combinatorics, 14:157–164, 1996.

    MathSciNet  Google Scholar 

  22. H. Bölcskei, A.J. Paulraj, K.V.S. Hari, and R.U. Nabar. Fixed broadband wireless access: State of the art, challenges, and future directions. IEEE Communications Magazine, 39(1):100–107, 2001.

    Article  Google Scholar 

  23. J. Bourjolly, L. Déjoie, K.O. Dioume, and M. Lominy. Frequency allocation in cellular phone networks: An OR success story. OR/MS Today, 28(2):41–44, 2001.

    Google Scholar 

  24. D. Bouyssou. Building criteria: A prerequisite for MCDA. In C.A. Bana e Costa, editor, Readings in Multiple Criteria Decision Aid, pages 58–80. Springer Verlag, Berlin, 1990.

    Google Scholar 

  25. T.X. Brown. Low power wireless communication via reinforcement learning. In S.A. Solla, T.K. Leen, and K.-R. Müller, editors, Advances in Neural Information Processing Systems, volume 12, pages 893–899. MIT Press, Cambridge, MA, 2000.

    Google Scholar 

  26. T.X. Brown, H. Tong, and S. Singh. Optimizing admission control while ensuring quality of service in multimedia networks via reinforcement learning. Neural Information Processing Systems, 1999.

    Google Scholar 

  27. S. Chen and K. Nahrstedt. On finding multi-constrained paths. In Proceedings of International Communications Conference’ 98 IEEE, pages 874–879, New York, 1998.

    Google Scholar 

  28. S. Chen and K. Nahrstedt. An overview of quality of service routing for next-generation high-speed networks: Problems and solutions. IEEE Networks, 12(6), 1998.

    Google Scholar 

  29. J. Clímaco and C.H. Antunes. Implementation of a user friendly software package — A guide tour of TRIMAP. Mathematical and Computer Modelling, 10 /11 (12):1299–1309, 1989.

    Article  Google Scholar 

  30. J. Clímaco, C.H. Antunes, and M.J. Alves. From Trimap to Sommix — Building effective interactive MOLP computational tools in multicriteria decision making. In Fandel and Gal, editors, Lecture Notes in Economics and Mathematical Systems, volume 448, pages 285–296. Springer Verlag, Berlin, 1997.

    Google Scholar 

  31. J. Clímaco, J. Craveirinha, and M. Pascoal. A bicriterion approach for routing problems in multimedia networks. Networks, 41(4):206–220, 2003.

    Article  MathSciNet  Google Scholar 

  32. J. Clímaco and E.Q.V. Martins. A bicriterion shortest path algorithm. European Journal of Operational Research, 11:399–104, 1982.

    Article  MathSciNet  Google Scholar 

  33. D.R. Cox and V. Ishem. Point Processes. Chapman and Hall, Englewood Cliffs, 1980.

    Google Scholar 

  34. J. Craveirinha, L. Martins, T. Gomes, C.H. Antunes, and J. Clímaco. A new multiple objective dynamic routing method using implied cost. Journal of Telecommunications and Information Technologies, 3/2003:51–59, 2003. Special issue edited by the Institute of Telecommunications, Warsaw.

    Google Scholar 

  35. C. Douligeris and I. Pereira. A telecommunications quality study using the analytic hierarchy process. IEEE Journal on Select Areas in Communications, 12(2):241–250, 1994.

    Article  Google Scholar 

  36. M. El-Sayed and J. Jaffe. A view of telecommunications network evolution. IEEE Communications Magazine, 40(12):74–81, 2002.

    Article  Google Scholar 

  37. S.C. Erbas. Utilizing evolutionary algorithms for multiobjective problems in traffic engineering. In W. Ben-Amur and A. Petrowski, editors, Proceedings of the International Networks Optimisation Conference INOC 2003, Evry, October 2003, pages 207–212. Institut National des Telecommunications, Evry, France, 2003.

    Google Scholar 

  38. S.C. Erbas and C. Erbas. A multiobjective off-line routing model for MPLS networks. In J. Charzinski, R. Lehnert, and P. Tran-Gia, editors, Proceedings of the 18th International Teletraffic Congress — ITC 18, Berlin, pages 471–480. Elsevier, Amsterdam, 2003.

    Google Scholar 

  39. S.C. Erbas and R. Mathar. An off-line traffic engineering model for MPLS networks. In B. Bakshi and B. Stiller, editors, Proceedings of IEEE 27th Annual Conference on Local Computer Networks, pages 166–174, Tampa, Florida, 2002. IEEE Computer Society.

    Google Scholar 

  40. F. Ergun, R. Sinha, and L. Zhang. QoS routing with performance-dependent cost. In M. Sidi, I. Katzela, and Y. Shavitt, editors, Proceedings of IEEE INFOCOM 2000, The Conference on Computer Communications, 19th Annual Meeting of the Computer and Communications Societies, Tel Aviv, March 2000, volume 1, pages 137–146. IEEE Computer and Communications Societies, 2000.

    Google Scholar 

  41. B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In M. Sidi, I. Katzela, and Y. Shavitt, editors, Proceedings of IEEE INFOCOM 2000, The Conference on Computer Communications, 19th Annual Meeting of the Computer and Communications Societies, Tel Aviv, March 2000, volume 2, pages 519–528. IEEE Computer and Communications Societies, 2000.

    Google Scholar 

  42. F. Glover and J.M. Mulvey. Equivalence of the 0-1 integer programming problem to discrete generalized and pure networks. Operations Research, 28:829–836, 2004.

    Article  Google Scholar 

  43. [43]A. Goel, K.G. Ramakrishnan, D. Kataria, and D. Logothetis. Efficient computation of delay-sensitive routes from one source to all destinations. In B. Sengupta, F. Bauer, and D. Cavendish, editors, Proceedings of IEEE INFOCOM 2001, The Conference on Computer Communications, 20th Annual Meeting of the Computer and Communications Societies, Anchorage, April 2001, volume 2, pages 854–858. IEEE Computer and Communications Societies, April 2001.

    Google Scholar 

  44. R. Guerin and A. Orda. Networks with advanced reservations: The routing perspective. In M. Sidi, I. Katzela, and Y. Shavitt, editors, Proceedings of IEEE INFOCOM 2000, The Conference on Computer Communications, 19th Annual Meeting of the Computer and Communications Societies, Tel Aviv, March 2000, volume 1, pages 26–30. IEEE Computer and Communications Societies, 2000.

    Google Scholar 

  45. L. Guo and I. Matta. Search space reduction in qos routing. In Proceedings of the 19th IEEE International Conference on Distributed Computing Systems, volume 3, pages 142–149. IEEE Computer Society, 1999.

    Google Scholar 

  46. G.Y. Handler and I. Zang. A dual algorithm for the constrained shortest path problem. Networks, 10:293–310, 1980.

    Article  MathSciNet  Google Scholar 

  47. S. Harnedy. The MPLS Primer — An Introduction to Multiprotocol Label Switching. Prentice Hall, Englewood Cliffs, 2002.

    Google Scholar 

  48. R. Hassin. Approximation schemes for the restriced shortest path problem. Mathematics of Operations Research, 17(1):36–42, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  49. A. Iwata, R. Izmailov, D.S. Lee, B. Sengupta, G. Ramamurthy, and H. Suzuki. ATM routing algorithms with multiple QoS requirements for multimedia internetworking. IEICE Transactions and Communications E79-B, 8:999–1006, 1996.

    Google Scholar 

  50. J.M. Jaffe. Algorithms for finding paths multiple constraints. Networks, 14:95–116, 2004.

    Article  MathSciNet  Google Scholar 

  51. R. Keeney. Modelling values for telecommunications management. IEEE Transactions on Engineering Management, 48(3):370–379, 2001.

    Article  Google Scholar 

  52. R.L. Keeney and H. Raiffa. Decisions with Multiple Objectives Preferences and Value Tradeoffs. Cambridge University Press, Cambridge, 1993.

    Google Scholar 

  53. F. Kelly. Routing in circuit-switched networks: Optimization, shadow prices and decentralisation. Applied Probability, 20:112–144, 1988.

    Article  MATH  Google Scholar 

  54. L. Kerbache and J.M. Smith. Multi-objective routing within large scale facilities using open finite queueing network. European Journal of Operational Research, 121:105–123, 2000.

    Article  MathSciNet  Google Scholar 

  55. J. Kim. A survey study on the relative importance of intranet functions: Using the analytic hierarchy, 1997. Paper presented at the International Decision Sciences Institute Meeting, Sydney, July 1997.

    Google Scholar 

  56. J. Knowles, M. Oates, and D. Corne. Advanced muli-objecive evolutionary algorithms applied to two problems in telecommunications. British Telecom Technology Journal, 18(4):51–65, 2000.

    Google Scholar 

  57. T. Korkmaz and M. Krunz. Multi-constrained optimal path selection. In B. Sengupta, F. Bauer, and D. Cavendish, editors, Proceedings of IEEE INFOCOM 2001, The Conference on Computer Communications, 20th Annual Meeting of the Computer and Communications Societies, Anchorage, April 2001. IEEE Computer and Communications Societies, 2001. www.ieee-infocom.org/2001/program.html.

    Google Scholar 

  58. T. Korkmaz and M. Krunz. A randomized algorithm for finding a path subject to multiple QoS requirements. Computer Networks, 36:251–268, 2001.

    Article  Google Scholar 

  59. F. Kuipers, T. Korkmaz, M. Krunz, and P. Van Mieghem. A review of constraint-based routing algorithms. Technical report, Delft University of Technology, 2002.

    Google Scholar 

  60. F. Kuipers, P. Van Mieghem, T. Korkmaz, and M. Krunz. An overview of constraint-based path selection algorithms for routing. IEEE Communications Magazine, 40(12):50–55, 2002.

    Article  Google Scholar 

  61. H. Lee, Y. Shi, S.M. Nazem, S. Kang, and M. Sohn. Multicriteria hub decision making for rural area telecommunication networks. European Journal of Operational Research, 133(3):483–495, 2001.

    Article  Google Scholar 

  62. W.C. Lee, M.G. Hluchyj, and P.A. Humblet. Routing subject to quality of service constraints in integrated communication networks. IEEE Networks, 9(4):46–55, 1995.

    Article  Google Scholar 

  63. G. Liu and K.G. Ramakrishnan. A* prune: An algorithm for finding k shortest paths subject to multiple constraints. In B. Sengupta, F. Bauer, and D. Cavendish, editors, Proceedings of IEEE INFOCOM 2001, The Conference on Computer Communications, 20th Annual Meeting of the Computer and Communications Societies, Anchorage, April 2001, pages 743–749. IEEE Computer and Communications Societies, 2001.

    Google Scholar 

  64. Q. Ma and P. Steenkiste. On path selection for traffic with bandwidth guarantees. In M. Ammar and U. Shankar, editors, Proceedings of IEEE International Conference on Network Protocols ICNP’ 97, Atlanta, October 1997, pages 191–202. IEEE Computer and Communications Societies, 1997.

    Google Scholar 

  65. Q. Ma and P. Steenkiste. Routing traffic with quality-of-service guarantees in integrated services networks. In I. Lesley and D. McAuley, editors, Proceedings of 8th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV’98), July 1998, July 1998.

    Google Scholar 

  66. P. Mahey and C.C. Ribeiro. Modeling modern multimedia traffic — Optimal routing for multi-service communication networks. OR/MS TODAY, 29(3):40–43, 2002.

    Google Scholar 

  67. S. Maniatis, E.G. Nikolouzou, and I.S. Venieris. QoS issues in the converged 3G wireless and wired networks. IEEE Communications Magazine, 40(8):44–53, 2002.

    Article  Google Scholar 

  68. E.V. Martins, M. Pascoal, and J. Santos. Deviation algorithms for ranking shortest paths. International Journal of Foundations of Computer Science, 10(3):247–263, 1999.

    Article  MathSciNet  Google Scholar 

  69. L. Martins, J. Craveirinha, J. Chímaco, and T. Gomes. Modelling and performance analysis of a new multiple objective dynamic routing method for multiexchange networks. Technical Report 11, ISSN 1645–2631, INESC-Coimbra, 2002.

    Google Scholar 

  70. L. Martins, J. Craveirinha, J. Clímaco, and T. Gomes. Implementation and performance of a new multiple objective dynamic routing method for multiexchange networks. Journal of Telecommunications and Information Technologies, 3/2003:60–66, 2003. Special issue edited by the Institute of Telecommunications, Warsaw.

    Google Scholar 

  71. P. Van Mieghem, H. De Neve, and F.A. Kuipers. Hop-by-hop quality of service routing. Computer Networks, 37(3–4):407–423, 2001.

    Article  Google Scholar 

  72. PL. Mokhtarian and I. Salomon. Modeling the choice of telecommuting 3: Identifying the choice set and estimating binary choice models for technology-based alternatives. Environment and Planning, A, 28:1877–1894, 1996.

    Article  Google Scholar 

  73. A. Nagurney, J. Dong, and P.L. Mokhtarian. Teleshopping versus shopping: A multicriteria network equilibrium framework. Mathematical and Computer Modeling, 34:783–798, 2001.

    Article  MathSciNet  Google Scholar 

  74. A. Nagurney, J. Dong, and P.L. Mokhtarian. Multicriteria network equilibrium modeling with variable weights for decision-making in the information age, with applications to telecommuting and teleshopping. Journal of Economic Dynamics and Control, 26(9–10):1629–1650, 2002.

    Article  MathSciNet  Google Scholar 

  75. H. De Neve and P. Van Mieghem. A multiple quality of service routing algorithm for PNNI. Proceedings of the IEEE ATM Workshop, Fairfax, May 26–29, 1998, pages 324-329, 1998.

    Google Scholar 

  76. H. De Neve and P. Van Mieghem. TAMCRA, a tunable accuracy multiple constraints routing algorithm. Computer Communications, 33:667–679, 2000.

    Article  Google Scholar 

  77. J. Nurminen. Models and algorithms for network planning tool — Pratical experiences. Technical Report1 E14, Helsinki University of Technology, 2003.

    Google Scholar 

  78. A. Orda. Routing with end-to-end QoS guarantees in broadband networks. IEEE/ACM Transactions on Networking, 7(3):365–374, 1999.

    Article  Google Scholar 

  79. S. Oueslti-Boulahia and E. Oubagha. An approach to routing elastic flows. In D. Smith and P. Key, editors, Teletraffic Engineering in a Competitive World. Proceedings of the 16th International Teletraffic Congress — ITC 16, Edinburgh, pages 1311–1320. Elsevier Science, Amsterdam, 1999.

    Google Scholar 

  80. C. Pornavalai, G. Chakraborty, and N. Shiratori. QoS based routing algorithm in integrated services packet networks. In R. Miller and K. Calvert, editors, IEEE International Conference on Network Protocols (ICNP’97), pages 167–174, Atlanta, Georgia, 1997. IEEE.

    Google Scholar 

  81. C. Pornavalai, G. Chakraborty, and N. Shiratori. Routing with multiple QoS requirements for supporting multimedia applications. Telecommunication Systems, 9:357–373, 1998.

    Article  Google Scholar 

  82. M.S. Raisinghani. A balanced analytic approach to strategie electronic commerce decision: A framework of the evaluation method. In W.V. Grembergen, editor, Information Technology Evaluation Methods and Management, pages 185–197. Idea Group Publishing, 2001.

    Google Scholar 

  83. M.S. Raisinghani and L. Schakade. Strategic evaluation of electronic commerce technologies. In N. Callaos, M. Bennamony, and J. Aguilar, editors, Proceedings of the World Multiconference on Systemics, Cybernetics and Informations, Caracas, July 1997, volume 2, pages 361–365, 1997.

    Google Scholar 

  84. B. Rajagopalen, D. Pendarakis, D. Saha, R.S. Ramamoorthy, and K. Bala. IP over optical netwoks: Architectural aspects. IEEE Communications Magazine, 38(9):94–102, 2004.

    Article  Google Scholar 

  85. D.S. Reeves and H.F. Salama. A distributed algorithm for delay-constrained unicast routing. IEEE/ACM Transactions on Networking, 8(2):239–250, April 2000.

    Article  Google Scholar 

  86. M. Resende and C. Ribeiro. A GRASP with path-relinking for private virtual circuit routing. Networks, 41(3):104–114, 2003.

    Article  MathSciNet  Google Scholar 

  87. J.C. Rodrigues, J.C.N. Clímaco, and J.R. Current. An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions. Computers & Operations Research, 26:789–798, 1999.

    Article  Google Scholar 

  88. J. Rosenhead. Rational Analysis for a Problematic World — Problem Structuring Methods for Complexity and Conflict. John Wiley & Sons, Chichester, 1999.

    Google Scholar 

  89. B. Roy and D. Bouyssou. Aide Multicritère à la Décision: Méthodes et Cos. Economica, Paris, 1993.

    Google Scholar 

  90. T.L. Saaty. The Analytic Hiearchy Process. McGraw-Hill, New York, 1980.

    Google Scholar 

  91. T.L. Saaty. Highlights and critical point in the theory and application of the analytic hierarchy process. European Journal of Operational Research, 74:426–447, 1994.

    Article  MATH  Google Scholar 

  92. T.L. Saaty. How to make a decision: The analytic hierarchy process. Interfaces, 24(6):19–43, 1994.

    Article  MathSciNet  Google Scholar 

  93. T.L. Saaty. Decision Making with Dependence and Feedback The Analytic Network Process. RWS Publications, Pittsburgh, 1996.

    Google Scholar 

  94. J. Sobrinho. Algebra and algorithms for qos path computation and hop-by-hop routing in the internet. In B. Sengupta, F. Bauer, and D. Cavendish, editors, Proceedings of IEEE INFOCOM 2001, The Conference on Computer Communications, 20th Annual Meeting of the Computer and Communications Societies, Anchorage, April 2001. IEEE Compute and Communications Societies, 2001.

    Google Scholar 

  95. D.J. Songhurst. Charging Communication Networks — From Theory to Practice. Elsevier, Amsterdam, 1999.

    Google Scholar 

  96. R. Steuer. Multiple Criteria Optimization: Theory Computation and Application. John Wiley & Sons, New York, 1986.

    Google Scholar 

  97. M. Tam and V.M.R. Tummala. An application of the AHP in vendor selection of a telecommunication system. Omega — The International Journal of Management Science, 29:171–182, 2001.

    Article  Google Scholar 

  98. S.R. Thirumalasetty and D. Medhi. MPLS traffic engineering for survivable book-ahead guaranteed services. Technical report in computer science and telecommunications, University of Missouri Kansas City, July 2001. www.estp.umkc.edu/public/papers/-dmedhi/tm-bag-te.pdf.

    Google Scholar 

  99. S.R. Tiourine, C.A.J. Hurkens, and J.K. Lenstra. Local search algorithms for the radio link frequency assignment problem. Telecommunication Systems, 13:293–314, 2000.

    Article  Google Scholar 

  100. Z. Wang and J. Crowcroft. Quality-of-service routing for supporting multimedia applications. IEEE Journal on Select Areas in Communications, 14(7):1228–1234, 1996.

    Article  Google Scholar 

  101. R. Widyono. The design and evaluation of routing algorithms for real-time channels. Technical Report 94-024, University of California at Berkeley & International Computer Science Institute, June 1994.

    Google Scholar 

  102. A. Wierzbicki. Multicriteria models for the placement of internet cache. In MCDM Winter Conference (16th MCDM World Conference), Semmering, Austria, February 2002.

    Google Scholar 

  103. P.L. Yu. Multiple-Criteria Optimization: Techniques and Extensions. Plenum Press, New York, 1985.

    Google Scholar 

  104. X. Yuan. Heuristic algorithms for multiconstrained qualiy-of-service routing. IEEE/ACM Transactions on Networking, 10(2), April 2002.

    Google Scholar 

  105. X. Yuan and X. Liu. Heuristic algorithms for multi-constrained quality of service routing. In B. Sengupta, F. Bauer, and D. Cavendish, editors, Proceedings of IEEE INFOCOM 2001, The Conference on Computer Communications, 20th Annual Meeting of the Computer and Communications Societies, Anchorage, April 2001. IEEE Computer and Commxunications Societies, 2001.

    Google Scholar 

  106. H. Zang, J. Jue, and B. Mukherjee. A review of routing and wavelength assignment approaches for wavelength-routed optical wdm networks. Optical Networks Magazine, 14(1):47–60, 2000.

    Google Scholar 

  107. M.V. Zee. Quality of service routing — State of the art report. http://searchpdf.adobe.com/proxies/0/9/25/62.html, 1999. Report of Work Unit 4 of the EU “Internet Next Geenartion Project”; Ericsson 1/0362-FCP NB 102 88, 1999.

    Google Scholar 

  108. M. Zeleny. A concept of compromise solutions and the method of the displaced ideal. Computers and Operations Research, 1:479–496, 1974.

    Article  ADS  Google Scholar 

  109. B. Zhu. Routing and wavelengh assignment in all-optical networks by multi-objective genetic algorithms. Technical report, University of California, Berkeley, November 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Economics, The University of Coimbra and INESC — Coimbra, Portugal

    João Clímaco

  2. Department of Electrical Engineering Sience and Computers Faculty of Science and Technology, The University of Coimbra and INESC — Coimbra, Portugal

    José Craveirinha

Authors
  1. João Clímaco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Craveirinha
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science + Business Media, Inc.

About this chapter

Cite this chapter

Clímaco, J., Craveirinha, J. (2005). Multicriteria Analysis in Telecommunication Network Planning and Design — Problems and Issues. In: Multiple Criteria Decision Analysis: State of the Art Surveys. International Series in Operations Research & Management Science, vol 78. Springer, New York, NY. https://doi.org/10.1007/0-387-23081-5_22

Download citation

Publish with us

Policies and ethics

Search

Navigation