Static and dynamic approaches to modeling end-to-end routing in circuit-switched networks

Young Lee, James M. Tien

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

We present two routing strategies, identified herein as static least loaded routing (SLLR) and dynamic least loaded routing (DLLR). Dynamic routing in circuit-switched networks has been an active research topic. The literature to date in this area has focused on how to choose the "best" alternate route for overflow traffic from a direct route, within a network setting referred to as the backbone network. The traffic type considered in the literature has typically been one with a single destination. Least loaded routing (LLR) is an example of a state-dependent routing that selects the least loaded two-link alternate route when traffic overflows from the direct route. Motivated by the development of an emerging traffic type, called multidestination traffic, whose destination is not necessarily limited to a single location, we provide two routing strategies that deal with both the routing of the multiple-destination traffic to the extended network dimension, which is referred to as the destination network, and the routing of the backbone network traffic via LLR. In selecting the destination for multidestination traffic, SLLR employs static information, whereas DLLR employs real-time load status information concerning the destination links. We develop fixed-point models for both DLLR and SLLR. We also validate and compare the models through simulation. The results suggest that DLLR outperforms SLLR in all the scenarios, demonstrating the benefit of state-dependent routing in an end-to-end network. Further, the DLLR scheme improves if an "incident preference" rule is adopted; the rule allows a multidestination call to first choose the incident destination link, if any.

Original languageEnglish
Pages (from-to)693-705
Number of pages13
JournalIEEE/ACM Transactions on Networking
Volume10
Issue number5
DOIs
StatePublished - Oct 1 2002
Externally publishedYes

Fingerprint

Switching networks
Networks (circuits)

Keywords

  • Circuit-switched networks
  • Multidestination traffic
  • Routing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Information Systems

Cite this

Static and dynamic approaches to modeling end-to-end routing in circuit-switched networks. / Lee, Young; Tien, James M.

In: IEEE/ACM Transactions on Networking, Vol. 10, No. 5, 01.10.2002, p. 693-705.

Research output: Contribution to journalArticle

@article{5794a320f50e4d5d8bd7612f330d5cd1,
title = "Static and dynamic approaches to modeling end-to-end routing in circuit-switched networks",
abstract = "We present two routing strategies, identified herein as static least loaded routing (SLLR) and dynamic least loaded routing (DLLR). Dynamic routing in circuit-switched networks has been an active research topic. The literature to date in this area has focused on how to choose the {"}best{"} alternate route for overflow traffic from a direct route, within a network setting referred to as the backbone network. The traffic type considered in the literature has typically been one with a single destination. Least loaded routing (LLR) is an example of a state-dependent routing that selects the least loaded two-link alternate route when traffic overflows from the direct route. Motivated by the development of an emerging traffic type, called multidestination traffic, whose destination is not necessarily limited to a single location, we provide two routing strategies that deal with both the routing of the multiple-destination traffic to the extended network dimension, which is referred to as the destination network, and the routing of the backbone network traffic via LLR. In selecting the destination for multidestination traffic, SLLR employs static information, whereas DLLR employs real-time load status information concerning the destination links. We develop fixed-point models for both DLLR and SLLR. We also validate and compare the models through simulation. The results suggest that DLLR outperforms SLLR in all the scenarios, demonstrating the benefit of state-dependent routing in an end-to-end network. Further, the DLLR scheme improves if an {"}incident preference{"} rule is adopted; the rule allows a multidestination call to first choose the incident destination link, if any.",
keywords = "Circuit-switched networks, Multidestination traffic, Routing",
author = "Young Lee and Tien, {James M.}",
year = "2002",
month = "10",
day = "1",
doi = "10.1109/TNET.2002.803909",
language = "English",
volume = "10",
pages = "693--705",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Static and dynamic approaches to modeling end-to-end routing in circuit-switched networks

AU - Lee, Young

AU - Tien, James M.

PY - 2002/10/1

Y1 - 2002/10/1

N2 - We present two routing strategies, identified herein as static least loaded routing (SLLR) and dynamic least loaded routing (DLLR). Dynamic routing in circuit-switched networks has been an active research topic. The literature to date in this area has focused on how to choose the "best" alternate route for overflow traffic from a direct route, within a network setting referred to as the backbone network. The traffic type considered in the literature has typically been one with a single destination. Least loaded routing (LLR) is an example of a state-dependent routing that selects the least loaded two-link alternate route when traffic overflows from the direct route. Motivated by the development of an emerging traffic type, called multidestination traffic, whose destination is not necessarily limited to a single location, we provide two routing strategies that deal with both the routing of the multiple-destination traffic to the extended network dimension, which is referred to as the destination network, and the routing of the backbone network traffic via LLR. In selecting the destination for multidestination traffic, SLLR employs static information, whereas DLLR employs real-time load status information concerning the destination links. We develop fixed-point models for both DLLR and SLLR. We also validate and compare the models through simulation. The results suggest that DLLR outperforms SLLR in all the scenarios, demonstrating the benefit of state-dependent routing in an end-to-end network. Further, the DLLR scheme improves if an "incident preference" rule is adopted; the rule allows a multidestination call to first choose the incident destination link, if any.

AB - We present two routing strategies, identified herein as static least loaded routing (SLLR) and dynamic least loaded routing (DLLR). Dynamic routing in circuit-switched networks has been an active research topic. The literature to date in this area has focused on how to choose the "best" alternate route for overflow traffic from a direct route, within a network setting referred to as the backbone network. The traffic type considered in the literature has typically been one with a single destination. Least loaded routing (LLR) is an example of a state-dependent routing that selects the least loaded two-link alternate route when traffic overflows from the direct route. Motivated by the development of an emerging traffic type, called multidestination traffic, whose destination is not necessarily limited to a single location, we provide two routing strategies that deal with both the routing of the multiple-destination traffic to the extended network dimension, which is referred to as the destination network, and the routing of the backbone network traffic via LLR. In selecting the destination for multidestination traffic, SLLR employs static information, whereas DLLR employs real-time load status information concerning the destination links. We develop fixed-point models for both DLLR and SLLR. We also validate and compare the models through simulation. The results suggest that DLLR outperforms SLLR in all the scenarios, demonstrating the benefit of state-dependent routing in an end-to-end network. Further, the DLLR scheme improves if an "incident preference" rule is adopted; the rule allows a multidestination call to first choose the incident destination link, if any.

KW - Circuit-switched networks

KW - Multidestination traffic

KW - Routing

UR - http://www.scopus.com/inward/record.url?scp=0036806326&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036806326&partnerID=8YFLogxK

U2 - 10.1109/TNET.2002.803909

DO - 10.1109/TNET.2002.803909

M3 - Article

VL - 10

SP - 693

EP - 705

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 5

ER -