Network Synthesis Problems
β Scribed by Christelle Wynants (auth.)
- Publisher
- Springer US
- Year
- 2001
- Tongue
- English
- Leaves
- 217
- Series
- Combinatorial Optimization 8
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
As the telecommunication industry introduces new sophisticated technologies, the nature of services and the volume of demands have changed. Indeed, a broad range of new services for users appear, combining voice, data, graphics, video, etc. This implies new planning issues. Fiber transmission systems that can carry large amounts of data on a few strands of wire were introduced. These systems have such a large bandwidth that the failure of even a single transmission link: in the network can create a severe service loss to customers. Therefore, a very high level of service reliability is becoming imperative for both system users and service providers. Since equipment failures and accidents cannot be avoided entirely, networks have to be designed so as to "survive" failures. This is done by judiciously installing spare capacity over the network so that all traffic interrupted by a failure may be diverted around that failure by way of this spare or reserve capacity. This of course translates into huge investments for network operators. Designing such survivable networks while minimizing spare capacity costs is, not surprisingly, a major concern of operating companies which gives rise to very difficult combinatorial problems. In order to make telecommunication networks survivable, one can essentially use two different strategies: protection or restoration. The protection approach preasΒ signs spare capacity to protect each element of the network independently, while the restoration approach spreads the redundant capacity over the whole network and uses it as required in order to restore the disrupted traffic.
β¦ Table of Contents
Front Matter....Pages i-xix
Telecommunication Context and Terminology....Pages 1-9
Network Synthesis Problem....Pages 11-29
Single Commodity Flow Requirements....Pages 31-82
Multicommodity Flow Requirements....Pages 83-133
The Restoration Problem in a Partially Equipped SDH Network....Pages 135-177
Self-Healing Rings....Pages 179-190
Conclusion....Pages 191-192
Back Matter....Pages 193-207
β¦ Subjects
Optimization; Discrete Mathematics in Computer Science; Operating Systems; Mathematical Modeling and Industrial Mathematics
π SIMILAR VOLUMES
In the second edition, I have tried to keep the organization of the first edition. Most of the new material are additions aimed at strengthening the weaknesses of the original edition. Some specific changes deserve mention. The most important of these is a new chapter on computer applications (C
Please Read Notes: Brand New, International Softcover Edition, Printed in black and white pages, minor self wear on the cover or pages, Sale restriction may be printed on the book, but Book name, contents, and author are exactly same as Hardcover Edition. Fast delivery through DHL/FedEx express.