|
Archive@NYU >
Stern School of Business >
IOMS: Information Systems Working Papers >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2451/14430
|
| Title: | ROUTING AND CAPACITY ASSIGNMENT IN A NETWORK WITH DIFFERENT CLASSES OF MESSAGES |
| Authors: | Neuman, Irina |
| Issue Date: | Jan-1989 |
| Publisher: | Stern School of Business, New York University |
| Series/Report no.: | IS-89-010 |
| 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. |
| URI: | http://hdl.handle.net/2451/14430 |
| Appears in Collections: | IOMS: Information Systems Working Papers
|
All items in Faculty Digital Archive are protected by copyright, with all rights reserved.
|
