Skip to main content

Planning Self-Healing Ring Capacity under Demand Uncertainty

  • Chapter
Telecommunications Network Design and Management

Part of the book series: Operations Research/Computer Science Interfaces Series ((ORCS,volume 23))

Abstract

We describe an approach to planning the capacity for self-healing rings in a survivable network when there is uncertainty about the demands that will be served. When detailed, reliable forecast data is not available, network plans based on stochastic methods that consider multiple demand scenarios are usually superior to those based on single point-estimates. However, a large number of potential realizations usually have to be considered before a reasonable plan can be developed. In addition, information regarding the distribution of the point-to-point demands may be elusive. In this paper, we show that when survivable components, like self-healing rings, are placed into the network some robustness to demand uncertainty is naturally provided, so the planning process can be simplified. We present an approach to sizing these components that uses the information available, like the total demand in a geographic area or the total demand terminating at each location. These data are often more reliable and easier to obtain than individual point-to-point demand values. We describe the differences between sizing unidirectional and bidirectional rings in the presence of demand uncertainty. Unlike unidirectional rings, where the capacity depends only on the total demand, the capacity requirement for bidirectional rings varies with the values of the individual demands and their locations. However, bidirectional rings are often more economical and more robust to demand uncertainty. In our approach, we employ a fast routing heuristic that find the capacity of bidirectional rings under a variety of demand scenarios. The scheme allows for a more accurate comparison between ring alternatives and the risks inherent to each. We describe how this approach to sizing can be incorporated into existing decision support for survivable network planning.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Armony, Klincewicz, Luss, and Rosenwein, “Design of Stacked Self-Healing Rings Using a Genetic Algorithm”. Fourth INFORMS Telecom Conference, Boca Raton, 1998, to appear in Journal of Heuristics.

    Google Scholar 

  2. Carpenter, T. and Cosares, S., “A Comparison of Heuristics for Routing and Slot Assignment on Ring Networks”, Fifth INFORMS Telecom Conference, Boca Raton, 2000, to appear in Telecom. Systems.

    Google Scholar 

  3. Carpenter, Cosares, Saniee, “Demand Routing and Slotting on Ring Networks”, DIMACS Technical Report 97–02, 1997.

    Google Scholar 

  4. Cheng, C, “A New Approximation Algorithm for the Demand Routing and Slotting Problem with Unit Demands on Rings”, Proc. 2nd Intl Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Berkeley, CA, August 1999.

    Google Scholar 

  5. Cosares, Deutsch, Saniee, Wasem, “SONET Toolkit: A Decision Support System for the Design of Robust and Cost-Effective Fiber-Optic Networks”, Interfaces 25, pp. 20–40, 1995.

    Article  Google Scholar 

  6. Cosares, S. and Saniee, I. “An Optimization Problem Related to Balancing Loads on SONET Rings”, Telecom. Systems 3, pp. 165–181, 1994.

    Article  Google Scholar 

  7. Cox, Bell, Popken, “What is the Cost of a DS3?,” Sixth INFORMS Telecom Conference, Boca Raton, 2002.

    Google Scholar 

  8. Gass, S. and Harris, C, ed., Encyclopedia of Operations Research and Management Science, Kluwer Academic Publishers, 1996.

    Google Scholar 

  9. Infager, G., Planning Under Uncertainty, Boyd & Fraser Publishing, 1994.

    Google Scholar 

  10. Kumar, V., “Approximating Circular-arc Coloring and Bandwidth Allocation in All-optical Ring Networks”, Proc. First Intl Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Aalborg, July, 1998.

    Google Scholar 

  11. Schrijver, Seymour, Winkler, “The Ring Loading Problem”, SIAM J. Disc. Math 11, pp. 1–14, 1998.

    Article  Google Scholar 

  12. Sen, Doverspike, Cosares, “Network Planning with Random Demands”, Telecommunications Systems 3, pp. 11–30, 1994.

    Article  Google Scholar 

  13. Vachani, Shulman, Kubat, Ward, “Multicommodity Flows in Ring Networks”, INFORMS Journal on Computing, 8, pp. 235–242, 1996.

    Article  Google Scholar 

  14. Wasem, Gross, Tlapa, “Forecasting Broadband Demand Between Geographic Areas” IEEE Communications Magazine, pp. 50–57, february 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer Science+Business Media New York

About this chapter

Cite this chapter

Cosares, S. (2003). Planning Self-Healing Ring Capacity under Demand Uncertainty. In: Anandalingam, G., Raghavan, S. (eds) Telecommunications Network Design and Management. Operations Research/Computer Science Interfaces Series, vol 23. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3762-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3762-2_5

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5326-1

  • Online ISBN: 978-1-4757-3762-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics