IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v38y1995i1p225-239.html
   My bibliography  Save this article

An effective numerical method for controlled routing in large trunk line networks

Author

Listed:
  • Kushner, Harold J.
  • Yang, Jichuan

Abstract

The paper discusses a powerful approach to the routing problem in large networks of the trunk line type. The approximations are based on heavy traffic limit theorems. The sequence of suitably normalized available circuits converges to a reflected diffusion process as the size of the network grows, under reasonable conditions. This limit model contains the basic features of the original network. The optimal ergodic cost problem for a three (link) dimensional system is solved numerically via the Markov chain approximation method to get the optimal controls. These can be approximated in such a way that they can be applied to a network of arbitrary size, using only “local” information. The resulting policies are compared in simulations (on systems with hundreds of links) to other current approaches, and found to be quite competitive with other schemes of current interest and have many advantages.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:matcom:v:38:y:1995:i:1:p:225-239
    DOI: 10.1016/0378-4754(93)E0086-K
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0378475493E0086K
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/0378-4754(93)E0086-K?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. Robert Doverspike & Vikas Jha, 1993. "Comparison of Routing Methods for DCS-Switched Networks," Interfaces, INFORMS, vol. 23(2), pages 21-34, April.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Mandjes, Michel, 1997. "Fast simulation of blocking probabilities in loss networks," European Journal of Operational Research, Elsevier, vol. 101(2), pages 393-405, September.
    3. 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.
    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.

    More about this item

    Statistics

    Access and download statistics

    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:eee:matcom:v:38:y:1995:i:1:p:225-239. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.