Combined channel allocation and routing algorithms in packet switched networks

Chung Gu Kang, Harry H. Tan

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Joint optimization of capacity and flow assignment (CFA) is considered for a least-cost routing and bandwidth allocation in packet switched networks, in which multiple links are modeled by parallel M/M/1 queues. A generic cost-objective function is introduced to reflect both switching and channel costs. Queueing, transmission, nodal processing and propagation delays are all incorporated into the optimization problem. The proposed CFA problem is shown to be a convex optimization problem, thus ensuring a global solution. Furthermore, a more general optimization approach has been developed to circumvent the computational limitation associated with the existing optimization formulation and to capture the discrete nature of channel allocation.

Original languageEnglish
Pages (from-to)1175-1190
Number of pages16
JournalComputer Communications
Volume20
Issue number13
Publication statusPublished - 1997 Nov 25

Fingerprint

Packet networks
Routing algorithms
Costs
Frequency allocation
Convex optimization
Processing

Keywords

  • Channel allocation
  • Network design
  • Network optimization
  • Packet switched networks
  • Routing algorithm

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Combined channel allocation and routing algorithms in packet switched networks. / Kang, Chung Gu; Tan, Harry H.

In: Computer Communications, Vol. 20, No. 13, 25.11.1997, p. 1175-1190.

Research output: Contribution to journalArticle

@article{92702d6842ca4a6fbf47e53b04a33e7e,
title = "Combined channel allocation and routing algorithms in packet switched networks",
abstract = "Joint optimization of capacity and flow assignment (CFA) is considered for a least-cost routing and bandwidth allocation in packet switched networks, in which multiple links are modeled by parallel M/M/1 queues. A generic cost-objective function is introduced to reflect both switching and channel costs. Queueing, transmission, nodal processing and propagation delays are all incorporated into the optimization problem. The proposed CFA problem is shown to be a convex optimization problem, thus ensuring a global solution. Furthermore, a more general optimization approach has been developed to circumvent the computational limitation associated with the existing optimization formulation and to capture the discrete nature of channel allocation.",
keywords = "Channel allocation, Network design, Network optimization, Packet switched networks, Routing algorithm",
author = "Kang, {Chung Gu} and Tan, {Harry H.}",
year = "1997",
month = "11",
day = "25",
language = "English",
volume = "20",
pages = "1175--1190",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "13",

}

TY - JOUR

T1 - Combined channel allocation and routing algorithms in packet switched networks

AU - Kang, Chung Gu

AU - Tan, Harry H.

PY - 1997/11/25

Y1 - 1997/11/25

N2 - Joint optimization of capacity and flow assignment (CFA) is considered for a least-cost routing and bandwidth allocation in packet switched networks, in which multiple links are modeled by parallel M/M/1 queues. A generic cost-objective function is introduced to reflect both switching and channel costs. Queueing, transmission, nodal processing and propagation delays are all incorporated into the optimization problem. The proposed CFA problem is shown to be a convex optimization problem, thus ensuring a global solution. Furthermore, a more general optimization approach has been developed to circumvent the computational limitation associated with the existing optimization formulation and to capture the discrete nature of channel allocation.

AB - Joint optimization of capacity and flow assignment (CFA) is considered for a least-cost routing and bandwidth allocation in packet switched networks, in which multiple links are modeled by parallel M/M/1 queues. A generic cost-objective function is introduced to reflect both switching and channel costs. Queueing, transmission, nodal processing and propagation delays are all incorporated into the optimization problem. The proposed CFA problem is shown to be a convex optimization problem, thus ensuring a global solution. Furthermore, a more general optimization approach has been developed to circumvent the computational limitation associated with the existing optimization formulation and to capture the discrete nature of channel allocation.

KW - Channel allocation

KW - Network design

KW - Network optimization

KW - Packet switched networks

KW - Routing algorithm

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

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

M3 - Article

AN - SCOPUS:0031269488

VL - 20

SP - 1175

EP - 1190

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 13

ER -