Routing Through Virtual Paths in Layered Telecommunication Networks

Geir Dahl (), Alexander Martin () and Mechthild Stoer ()
Additional contact information
Geir Dahl: Department of Mathematics, University of Oslo, P.O. Box 1080, Blindern, N-0316 Oslo, Norway
Alexander Martin: Konrad-Zuse-Zentrum für Informationstechnik, Heilbronner Str. 10, D-10711 Berlin, Germany
Mechthild Stoer: Telenor, P.O. Box 83, N-2027 Kjeller, Norway

Operations Research, 1999, vol. 47, issue 5, 693-702

Abstract: We study a network configuration problem in telecommunications where one wants to set up paths in a capacitated network to accommodate given point-to-point traffic demand. The problem is formulated as an integer linear programming model where 0–1 variables represent different paths. An associated integral polytope is studied, and different classes of facets are described. These results are used in a cutting plane algorithm. Computational results for some realistic problems are reported.

Keywords: communications; telecommunication; networks/graphs; design and path packing; combinatorics; polyhedral combinatorics (search for similar items in EconPapers)
Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.47.5.693 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:47:y:1999:i:5:p:693-702

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().