IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v16y2008i1p79-105.html
   My bibliography  Save this article

A meta-model for multiobjective routing in MPLS networks

Author

Listed:
  • José Craveirinha
  • Rita Girão-Silva
  • João Clímaco

Abstract

MPLS (Multiprotocol Label Switching) enables the utilisation of explicit routes and other advanced routing mechanisms in multiservice packet networks, capable of dealing with multiple and heterogeneous QoS (Quality of Service) parameters. Firstly the paper presents a discussion of conceptual and methodological issues raised by multiobjective routing optimisation models for MPLS networks. The major contribution is the proposal of a multiobjective routing optimisation framework for MPLS networks. The major features of this modelling framework are: the formulation of a three-level hierarchical routing optimisation problem including network and service performance objectives, the inclusion of fairness objectives in the different levels of optimisation and a two-level stochastic representation of the traffic in the network (traffic flow and packet stream levels). A variant of the general model for two classes of traffic flows, QoS traffic and Best Effort traffic, is also presented. Finally a stochastic teletraffic modelling approach, underlying the optimisation model, is fully described. Copyright Springer-Verlag 2008

Suggested Citation

  • José Craveirinha & Rita Girão-Silva & João Clímaco, 2008. "A meta-model for multiobjective routing in MPLS networks," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 16(1), pages 79-105, March.
    • Handle: RePEc:spr:cejnor:v:16:y:2008:i:1:p:79-105
    DOI: 10.1007/s10100-007-0044-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10100-007-0044-9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10100-007-0044-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. F. P. Kelly, 1990. "Routing and Capacity Allocation in Networks with Trunk Reservation," Mathematics of Operations Research, INFORMS, vol. 15(4), pages 771-793, November.
    2. Lúcia Martins & José Craveirinha & João Clímaco, 2006. "A New Multiobjective Dynamic Routing Method for Multiservice Networks: Modelling and Performance," Computational Management Science, Springer, vol. 3(3), pages 225-244, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.
    2. Josefa Mula & Marija Bogataj, 2021. "OR in the industrial engineering of Industry 4.0: experiences from the Iberian Peninsula mirrored in CJOR," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(4), pages 1163-1184, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kushner, Harold J. & Yang, Jichuan, 1995. "An effective numerical method for controlled routing in large trunk line networks," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 38(1), pages 225-239.
    2. Martins, Lucia & Craveirinha, Jose & Climaco, Joao N. & Gomes, Teresa, 2005. "On a bi-dimensional dynamic alternative routing method," European Journal of Operational Research, Elsevier, vol. 166(3), pages 828-842, November.
    3. Mandjes, Michel, 1997. "Fast simulation of blocking probabilities in loss networks," European Journal of Operational Research, Elsevier, vol. 101(2), pages 393-405, September.
    4. Dimitris Bertsimas & Thalia Chryssikou, 1999. "Bounds and Policies for Dynamic Routing in Loss Networks," Operations Research, INFORMS, vol. 47(3), pages 379-394, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:cejnor:v:16:y:2008:i:1:p:79-105. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.