Combined channel allocation and routing algorithms

Chung Gu Kang, Harry H. Tan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Joint optimization of capacity and flow assignment (CFA) is considered for high-speed packet-switched networks in which multiple trunk links are modeled by parallel M/M/1 queues. A quadratic cost function is considered to reflect both switching and line costs. Queuing, 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. By invoking optimality of the CFA problem and relaxing the integral channel constraint to a continuous variable, a set of nonlinear equations is derived for the optimal solutions. To circumvent the computational burden involved with the continuous solution approach and to capture the discrete nature of channel allocation, an efficient discrete optimization algorithm is developed based on a marginal analysis approach.

Original languageEnglish
Title of host publicationIEEE Global Telecommunications Conference and Exhibition
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages1690-1695
Number of pages6
Volume3
ISBN (Print)0879426977
Publication statusPublished - 1991 Dec 1
EventIEEE Global Telecommunications Conference - GLOBECOM '91 Part 3 (of 3) - Phoenix, AZ, USA
Duration: 1991 Dec 21991 Dec 5

Other

OtherIEEE Global Telecommunications Conference - GLOBECOM '91 Part 3 (of 3)
CityPhoenix, AZ, USA
Period91/12/291/12/5

Fingerprint

Routing algorithms
Packet networks
Convex optimization
Nonlinear equations
Cost functions
Processing
Costs

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Kang, C. G., & Tan, H. H. (1991). Combined channel allocation and routing algorithms. In IEEE Global Telecommunications Conference and Exhibition (Vol. 3, pp. 1690-1695). Piscataway, NJ, United States: Publ by IEEE.

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

IEEE Global Telecommunications Conference and Exhibition. Vol. 3 Piscataway, NJ, United States : Publ by IEEE, 1991. p. 1690-1695.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kang, CG & Tan, HH 1991, Combined channel allocation and routing algorithms. in IEEE Global Telecommunications Conference and Exhibition. vol. 3, Publ by IEEE, Piscataway, NJ, United States, pp. 1690-1695, IEEE Global Telecommunications Conference - GLOBECOM '91 Part 3 (of 3), Phoenix, AZ, USA, 91/12/2.
Kang CG, Tan HH. Combined channel allocation and routing algorithms. In IEEE Global Telecommunications Conference and Exhibition. Vol. 3. Piscataway, NJ, United States: Publ by IEEE. 1991. p. 1690-1695
Kang, Chung Gu ; Tan, Harry H. / Combined channel allocation and routing algorithms. IEEE Global Telecommunications Conference and Exhibition. Vol. 3 Piscataway, NJ, United States : Publ by IEEE, 1991. pp. 1690-1695
@inproceedings{333cf199550c49f3a68efbd273ef49d5,
title = "Combined channel allocation and routing algorithms",
abstract = "Joint optimization of capacity and flow assignment (CFA) is considered for high-speed packet-switched networks in which multiple trunk links are modeled by parallel M/M/1 queues. A quadratic cost function is considered to reflect both switching and line costs. Queuing, 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. By invoking optimality of the CFA problem and relaxing the integral channel constraint to a continuous variable, a set of nonlinear equations is derived for the optimal solutions. To circumvent the computational burden involved with the continuous solution approach and to capture the discrete nature of channel allocation, an efficient discrete optimization algorithm is developed based on a marginal analysis approach.",
author = "Kang, {Chung Gu} and Tan, {Harry H.}",
year = "1991",
month = "12",
day = "1",
language = "English",
isbn = "0879426977",
volume = "3",
pages = "1690--1695",
booktitle = "IEEE Global Telecommunications Conference and Exhibition",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Combined channel allocation and routing algorithms

AU - Kang, Chung Gu

AU - Tan, Harry H.

PY - 1991/12/1

Y1 - 1991/12/1

N2 - Joint optimization of capacity and flow assignment (CFA) is considered for high-speed packet-switched networks in which multiple trunk links are modeled by parallel M/M/1 queues. A quadratic cost function is considered to reflect both switching and line costs. Queuing, 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. By invoking optimality of the CFA problem and relaxing the integral channel constraint to a continuous variable, a set of nonlinear equations is derived for the optimal solutions. To circumvent the computational burden involved with the continuous solution approach and to capture the discrete nature of channel allocation, an efficient discrete optimization algorithm is developed based on a marginal analysis approach.

AB - Joint optimization of capacity and flow assignment (CFA) is considered for high-speed packet-switched networks in which multiple trunk links are modeled by parallel M/M/1 queues. A quadratic cost function is considered to reflect both switching and line costs. Queuing, 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. By invoking optimality of the CFA problem and relaxing the integral channel constraint to a continuous variable, a set of nonlinear equations is derived for the optimal solutions. To circumvent the computational burden involved with the continuous solution approach and to capture the discrete nature of channel allocation, an efficient discrete optimization algorithm is developed based on a marginal analysis approach.

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

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

M3 - Conference contribution

AN - SCOPUS:0026396858

SN - 0879426977

VL - 3

SP - 1690

EP - 1695

BT - IEEE Global Telecommunications Conference and Exhibition

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -