skip to content
A network dimensioning tool Preview this item
ClosePreview this item
Checking...

A network dimensioning tool

Author: Dimitris Alevras; Martin Grötschel; Roland Wessäly
Publisher: Berlin : Konrad-Zuse-Zentrum für Informationstechnik Berlin, [1996]
Series: Preprint (Konrad-Zuse-Zentrum für Informationstechnik Berlin), SC 96-49.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "Designing low cost networks that survive certain failure situations belongs to one of the prime tasks in the telecommunications industry. In this paper we describe a mathematical model integrating several aspects of survivability that are elsewhere treated in a hierarchical fashion. We present mathematical investigations of this model, a cutting plane algorithm, as well as several heuristics for its  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Dimitris Alevras; Martin Grötschel; Roland Wessäly
OCLC Number: 37709992
Notes: "December 1996."
Description: 24 p. : ill. ; 30 cm.
Series Title: Preprint (Konrad-Zuse-Zentrum für Informationstechnik Berlin), SC 96-49.
Responsibility: Dimitris Alevras, Martin Grötschel, Roland Wessäly.

Abstract:

Abstract: "Designing low cost networks that survive certain failure situations belongs to one of the prime tasks in the telecommunications industry. In this paper we describe a mathematical model integrating several aspects of survivability that are elsewhere treated in a hierarchical fashion. We present mathematical investigations of this model, a cutting plane algorithm, as well as several heuristics for its solution. Moreover, we report computational results with real-world data. The problem we address is the following. Suppose, between each pair of nodes in a region, a communication demand is given. We want to determine the topology of a telecommunication network connecting the given nodes and to dimension all potential physical links. For each link, the possible capacities are restricted to a given finite set. The capacities must be chosen such that the communication demands are satisfied, even if certain network components fail, and such that the network building costs are as small as possible. Moreover, for each pair of nodes and each failure situation, we want to determine the paths on which the demand between the nodes is routed."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/37709992>
library:oclcnum"37709992"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/37709992>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/921988>
rdf:typeschema:Intangible
schema:name"Fault-tolerant computing"@en
schema:name"Fault-tolerant computing."@en
schema:about
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1996"
schema:description"Abstract: "Designing low cost networks that survive certain failure situations belongs to one of the prime tasks in the telecommunications industry. In this paper we describe a mathematical model integrating several aspects of survivability that are elsewhere treated in a hierarchical fashion. We present mathematical investigations of this model, a cutting plane algorithm, as well as several heuristics for its solution. Moreover, we report computational results with real-world data. The problem we address is the following. Suppose, between each pair of nodes in a region, a communication demand is given. We want to determine the topology of a telecommunication network connecting the given nodes and to dimension all potential physical links. For each link, the possible capacities are restricted to a given finite set. The capacities must be chosen such that the communication demands are satisfied, even if certain network components fail, and such that the network building costs are as small as possible. Moreover, for each pair of nodes and each failure situation, we want to determine the paths on which the demand between the nodes is routed.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/44962590>
schema:inLanguage"en"
schema:name"A network dimensioning tool"@en
schema:numberOfPages"24"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.