Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gavish, Bezalel | - |
dc.contributor.author | Neuman, Irina | - |
dc.date.accessioned | 2006-02-16T15:42:11Z | - |
dc.date.available | 2006-02-16T15:42:11Z | - |
dc.date.issued | 1986-01 | - |
dc.identifier.uri | http://hdl.handle.net/2451/14498 | - |
dc.description.abstract | This paper presents a model and the corresponding solution method for the problem of jointly selecting a set of primary routes and assigning capacities to the links in a computer communication network. The network topology and the traffic characteristics are known; a set of candidate routes for each communicating pair of nodes, and a set of candidate capacities for each link are also given. The goal is to obtain the least costly feasible design, where the costs include both capacity and queuing components. The resulting combinatorial optimization problem is solved using Lagrangean relaxation and subgradient optimization techniques. The method was tested on several topologies, and in all cases good feasible solutions, as well as tight lower bounds were obtained. | en |
dc.format.extent | 2681933 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language | English | EN |
dc.language.iso | en_US | - |
dc.publisher | Stern School of Business, New York University | en |
dc.relation.ispartofseries | IS-86-02 | - |
dc.title | CAPACITY AND FLOW ASSIGNMENTS IN LARGE COMPUTER NETWORKS | en |
dc.type | Working Paper | en |
dc.description.series | Information Systems Working Papers Series | EN |
Appears in Collections: | IOMS: Information Systems Working Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
IS-86-02.pdf | 2.62 MB | Adobe PDF | View/Open |
Items in FDA are protected by copyright, with all rights reserved, unless otherwise indicated.