Survivable mobile phone network architectures: Models and solution methods

Alevras, D; Grotschel, M; Jonas, P; Paul, U; Wessaly, R

dc.contributor.author	Alevras, D	en
dc.contributor.author	Grotschel, M	en
dc.contributor.author	Jonas, P	en
dc.contributor.author	Paul, U	en
dc.contributor.author	Wessaly, R	en
dc.date.accessioned	2014-03-01T01:47:29Z
dc.date.available	2014-03-01T01:47:29Z
dc.date.issued	1998	en
dc.identifier.issn	01636804	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/25231
dc.subject.other	Algorithms	en
dc.subject.other	Computer aided software engineering	en
dc.subject.other	Mathematical models	en
dc.subject.other	Mathematical programming	en
dc.subject.other	Telecommunication links	en
dc.subject.other	Telecommunication networks	en
dc.subject.other	Software package DISCNET	en
dc.subject.other	Mobile telephone exchanges	en
dc.title	Survivable mobile phone network architectures: Models and solution methods	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/35.663332	en
heal.identifier.secondary	http://dx.doi.org/10.1109/35.663332	en
heal.publicationDate	1998	en
heal.abstract	In this article we present a mixed-integer programming model for the problem of designing a survivable capacitated network, and describe a cutting plane algorithm for its solution. The model and the solution methods are integrated in our network dimensioning tool, DISCNET. Given a communication demand between each pair of switching nodes in a region, the task is to determine the topology of a telecommunication network connecting the given nodes and to select, from a given set of valid values, a capacity for each potential physical link such that the communication demands are satisfied, even if a network component fails. A solution consists of the chosen links and their capacity, as well as the routings for each demand, in the case of failure-free operation and the case of single component (node or link) failure. We suggest two alternative models to deal with failures of single network components. The first employs diversified paths to guarantee the routing of a specified fraction of each demand without rerouting effort; the second allows rerouting in failure situations. At the end we discuss alternative ways to implement survivability using these two models.	en
heal.journalName	IEEE Communications Magazine	en
dc.identifier.doi	10.1109/35.663332	en
dc.identifier.volume	36	en
dc.identifier.issue	3	en
dc.identifier.spage	88	en
dc.identifier.epage	93	en