Browse Prior Art Database

Technique for Optimal Assignment of Traffic to Routes in Telecommunication Networks

IP.com Disclosure Number: IPCOM000045738D
Original Publication Date: 1983-Apr-01
Included in the Prior Art Database: 2005-Feb-07
Document File: 3 page(s) / 42K

Publishing Venue

IBM

Related People

Gavis, B: AUTHOR [+2]

Abstract

One of the fundamental problems in telecommunications network management is to assign traffic between pairs of communicating network nodes so that the delay encountered by a random message is minimal. In many network architectures including system network architecture (SNA) all traffic of each class of service between each pair of nodes is assigned to the first available route in a list of routes. As a result, all traffic of a class of service between a pair of nodes traverses the same route. Inappropriate of assignment of traffic may result in excessive network delay leading to unacceptably long response times. As described below, obtaining optimal solutions to this assignment problem is probably very difficult.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 55% of the total text.

Page 1 of 3

Technique for Optimal Assignment of Traffic to Routes in Telecommunication Networks

One of the fundamental problems in telecommunications network management is to assign traffic between pairs of communicating network nodes so that the delay encountered by a random message is minimal. In many network architectures including system network architecture (SNA) all traffic of each class of service between each pair of nodes is assigned to the first available route in a list of routes. As a result, all traffic of a class of service between a pair of nodes traverses the same route. Inappropriate of assignment of traffic may result in excessive network delay leading to unacceptably long response times. As described below, obtaining optimal solutions to this assignment problem is probably very difficult. Network delay results from the transmission delay of the links and the queueing of messages waiting for link availability. The network delay is estimated using the standard model of networks of M/M/1 queues, in which message lengths are chosen independently from the same distribution at each queue. The new method described herein uses Lagrangian relaxation and subgradient optimization procedures to generate lower bounds for the network delay and to find feasible solutions.

Let L be the set of links (or transmission groups)

R a set of routes Pi the set of (origin/destination/class of service) triples called commodities

S=(Sp) a set of subsets of R (the candidate routes for each commodity)

T the message arrival rate for each element of each link, which is characterized by...