Routing and capacity assignment in a network with different classes of messages

Author

Neuman, Irina

Author_Institution

Graduate Sch. of Bus. Adm., New York Univ., NY, USA

Volume

3

fYear

1989

fDate

3-6 Jan 1989

Firstpage

780

Abstract

A mathematical model is presented for the problem of jointly assigning routes to the communicating pairs of nodes and capacities to the links in a packet-switched network. It is assumed that several classes of flow are using the network, different service requirements and message characteristics being associated with each class. An algorithm that generates good feasible solutions to the model, together with tight lower bounds on the value of the objective function, is presented. Results of numerical experiments using several network topologies are reported

Keywords

computer networks; packet switching; capacity assignment; communicating pairs; links; message characteristics; messages; network topologies; nodes; objective function; packet-switched network; routing; service requirements; Business communication; Communication systems; Computer networks; Delay; Information systems; Intelligent networks; Mathematical model; Network topology; Packet switching; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

System Sciences, 1989. Vol.III: Decision Support and Knowledge Based Systems Track, Proceedings of the Twenty-Second Annual Hawaii International Conference on

Conference_Location

Kailua-Kona, HI

Print_ISBN

0-8186-1913-9

Type

conf

DOI

10.1109/HICSS.1989.49197

Filename

49197