Design of Survivable Networks with Bounded Rings

  • Bernard Fortz

Part of the Network Theory and Applications book series (NETA, volume 2)

Table of contents

  1. Front Matter
    Pages i-xix
  2. Bernard Fortz
    Pages 1-4
  3. Bernard Fortz
    Pages 5-23
  4. Bernard Fortz
    Pages 35-68
  5. Bernard Fortz
    Pages 91-114
  6. Bernard Fortz
    Pages 115-123
  7. Bernard Fortz
    Pages 125-145
  8. Bernard Fortz
    Pages 147-148
  9. Back Matter
    Pages 149-203

About this book


These days, the nature of services and the volume of demand in the telecommu­ nication industry is changing radically, with the replacement of analog transmis­ sion and traditional copper cables by digital technology and fiber optic transmis­ sion equipment. Moreover, we see an increasing competition among providers of telecommunication services, and the development of a broad range of new services for users, combining voice, data, graphics and video. Telecommunication network planning has thus become an important problem area for developing and applying optimization models. Telephone companies have initiated extensive modeling and planning efforts to expand and upgrade their transmission facilities, which are, for most national telecommunication networks, divided in three main levels (see Balakrishnan et al. [5]), namely, l. the long-distance or backbone network that typically connects city pairs through gateway nodes; 2. the inter-office or switching center network within each city, that interconnects switching centers in different subdivisions (clusters of customers) and provides access to the gateway(s) node(s); 1 2 DESIGN OF SURVNABLE NETWORKS WITH BOUNDED RINGS 3. the local access network that connects individual subscribers belonging to a cluster to the corresponding switching center. These three levels differ in several ways including their design criteria. Ideally, the design of a telecommunication network should simultaneously account for these three levels. However, to simplify the planning task, the overall planning problem is decomposed by considering each level separately.


Operations Research algorithm algorithms communication mathematical programming model optimization programming

Authors and affiliations

  • Bernard Fortz
    • 1
  1. 1.Université Libre de BruxellesBelgium

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag US 2000
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4613-7113-7
  • Online ISBN 978-1-4615-4669-6
  • Series Print ISSN 1568-1696
  • Buy this book on publisher's site