A network dimensioning tool:
Gespeichert in:
Beteiligte Personen: | , , |
---|---|
Format: | Buch |
Sprache: | Englisch |
Veröffentlicht: |
Berlin
Konrad-Zuse-Zentrum für Informationstechnik
1996
|
Schriftenreihe: | Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin
1996,49 |
Schlagwörter: | |
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." |
Umfang: | 24 S. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV017188020 | ||
003 | DE-604 | ||
005 | 20031006 | ||
007 | t| | ||
008 | 030603s1996 xx d||| |||| 00||| eng d | ||
035 | |a (OCoLC)37709992 | ||
035 | |a (DE-599)BVBBV017188020 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
049 | |a DE-703 | ||
100 | 1 | |a Alevras, Dimitris |e Verfasser |4 aut | |
245 | 1 | 0 | |a A network dimensioning tool |c Dimitris Alevras ; Martin Grötschel ; Roland Wessäly |
264 | 1 | |a Berlin |b Konrad-Zuse-Zentrum für Informationstechnik |c 1996 | |
300 | |a 24 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin |v 1996,49 | |
520 | 3 | |a 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." | |
650 | 4 | |a Computer networks | |
650 | 4 | |a Fault-tolerant computing | |
650 | 4 | |a Telecommunication | |
700 | 1 | |a Grötschel, Martin |d 1948- |e Verfasser |0 (DE-588)108975282 |4 aut | |
700 | 1 | |a Wessäly, Roland |d 1967- |e Verfasser |0 (DE-588)122164350 |4 aut | |
810 | 2 | |a Konrad-Zuse-Zentrum für Informationstechnik Berlin |t Preprint SC |v 1996,49 |w (DE-604)BV004801715 |9 1996,49 | |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-010359073 |
Datensatz im Suchindex
_version_ | 1820981149342629888 |
---|---|
adam_text | |
any_adam_object | |
author | Alevras, Dimitris Grötschel, Martin 1948- Wessäly, Roland 1967- |
author_GND | (DE-588)108975282 (DE-588)122164350 |
author_facet | Alevras, Dimitris Grötschel, Martin 1948- Wessäly, Roland 1967- |
author_role | aut aut aut |
author_sort | Alevras, Dimitris |
author_variant | d a da m g mg r w rw |
building | Verbundindex |
bvnumber | BV017188020 |
classification_rvk | SS 4777 |
ctrlnum | (OCoLC)37709992 (DE-599)BVBBV017188020 |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV017188020</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20031006</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">030603s1996 xx d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)37709992</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV017188020</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Alevras, Dimitris</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A network dimensioning tool</subfield><subfield code="c">Dimitris Alevras ; Martin Grötschel ; Roland Wessäly</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Konrad-Zuse-Zentrum für Informationstechnik</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin</subfield><subfield code="v">1996,49</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fault-tolerant computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Telecommunication</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Grötschel, Martin</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)108975282</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wessäly, Roland</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)122164350</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Konrad-Zuse-Zentrum für Informationstechnik Berlin</subfield><subfield code="t">Preprint SC</subfield><subfield code="v">1996,49</subfield><subfield code="w">(DE-604)BV004801715</subfield><subfield code="9">1996,49</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-010359073</subfield></datafield></record></collection> |
id | DE-604.BV017188020 |
illustrated | Illustrated |
indexdate | 2025-01-11T19:15:52Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-010359073 |
oclc_num | 37709992 |
open_access_boolean | |
owner | DE-703 |
owner_facet | DE-703 |
physical | 24 S. graph. Darst. |
publishDate | 1996 |
publishDateSearch | 1996 |
publishDateSort | 1996 |
publisher | Konrad-Zuse-Zentrum für Informationstechnik |
record_format | marc |
series2 | Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin |
spelling | Alevras, Dimitris Verfasser aut A network dimensioning tool Dimitris Alevras ; Martin Grötschel ; Roland Wessäly Berlin Konrad-Zuse-Zentrum für Informationstechnik 1996 24 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Preprint SC / Konrad-Zuse-Zentrum für Informationstechnik Berlin 1996,49 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." Computer networks Fault-tolerant computing Telecommunication Grötschel, Martin 1948- Verfasser (DE-588)108975282 aut Wessäly, Roland 1967- Verfasser (DE-588)122164350 aut Konrad-Zuse-Zentrum für Informationstechnik Berlin Preprint SC 1996,49 (DE-604)BV004801715 1996,49 |
spellingShingle | Alevras, Dimitris Grötschel, Martin 1948- Wessäly, Roland 1967- A network dimensioning tool Computer networks Fault-tolerant computing Telecommunication |
title | A network dimensioning tool |
title_auth | A network dimensioning tool |
title_exact_search | A network dimensioning tool |
title_full | A network dimensioning tool Dimitris Alevras ; Martin Grötschel ; Roland Wessäly |
title_fullStr | A network dimensioning tool Dimitris Alevras ; Martin Grötschel ; Roland Wessäly |
title_full_unstemmed | A network dimensioning tool Dimitris Alevras ; Martin Grötschel ; Roland Wessäly |
title_short | A network dimensioning tool |
title_sort | a network dimensioning tool |
topic | Computer networks Fault-tolerant computing Telecommunication |
topic_facet | Computer networks Fault-tolerant computing Telecommunication |
volume_link | (DE-604)BV004801715 |
work_keys_str_mv | AT alevrasdimitris anetworkdimensioningtool AT grotschelmartin anetworkdimensioningtool AT wessalyroland anetworkdimensioningtool |