SONET Toolkit: A Decision Support System for Designing Robust and Cost-Effective Fiber-Optic Networks. Bellcore has built the SONET Toolkit decision support software to design robust fiber-optic networks that protect services against the consequences of a cable cut (link) or an equipment failure (node). The Synchronous Optical NETwork (SONET) makes these survivable designs cost-effective when planned carefully. The SONET Toolkit reads in data about the network, its embedded capacity, the available equipment, the customer demands, and the protection requirements for the services. It can also incorporate planning constraints. It produces an economic mix of SONET self-healing rings and other architectures that satisfy demand and protection requirements. Use of this software system by the Bellcore client companies has saved 10 to 30 percent in costs and orders of magnitude in time.

References in zbMATH (referenced in 20 articles )

Showing results 1 to 20 of 20.
Sorted by year (citations)

  1. Carroll, Paula; Fortz, Bernard; Labbé, Martine; McGarraghy, Seán: Improved formulations for the ring spur assignment problem (2011)
  2. Nong, Q.Q.; Cheng, T.C.E.; Ng, C.T.: A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting (2010)
  3. Üster, Halit; Kumar, Sarath K.S.: Algorithms for the design of network topologies with balanced disjoint rings (2010)
  4. Atamtürk, Alper; Rajan, Deepak: Partition inequalities for capacitated survivable network design based on directed $p$-cycles (2008)
  5. Bhattacharya, Binay; Hu, Yuzhuang; Kononov, Alexander: Approximation algorithms for the black and white traveling salesman problem (2007)
  6. Cabral, Edgar Alberto; Erkut, Erhan; Laporte, Gilbert; Patterson, Raymond A.: The network design problem with relays (2007)
  7. Myung, Young-Soo; Kim, Hyun-Joon: Network disconnection problems in a centralized network (2007)
  8. Stidsen, Thomas; Glenstrup, Arne John: Quantifying optimal mesh and ring design costs (2005)
  9. Balakrishnan, Anantaram; Magnanti, Thomas L.; Mirchandani, Prakash: Connectivity-splitting models for survivable network design (2004)
  10. Myung, Young-Soo; Kim, Hyun-joon: A cutting plane algorithm for computing $k$-edge survivability of a network (2004)
  11. Bourgeois, Mélanie; Laporte, Gilbert; Semet, Frédéric: Heuristics for the black and white traveling salesman problem (2003)
  12. Fortz, Bernard; Soriano, Patrick; Wynants, Christelle: A tabu search algorithm for self-healing ring network design. (2003)
  13. Goldschmidt, Olivier; Laugier, Alexandre; Olinick, Eli V.: SONET/SDH ring assignment with capacity constraints (2003)
  14. Cortes, P.; Onieva, L.; Larrañeta, J.; Garcia, J.M.: Decision support system for planning telecommunication networks: a case study applied to the Andalusian region (2001)
  15. Myung, Young-Soo: An efficient algorithm for the ring loading problem with integer demand splitting (2001)
  16. Armony, Mor; Klincewicz, John G.; Luss, Hanan; Rosenwein, Moshe B.: Design of stacked self-healing rings using a genetic algorithm (2000)
  17. Gannett, Joel W.: Fast, efficient equipment placement heuristics for broadband switched or internet router networks (2000)
  18. Klincewicz, John G.; Luss, Hanan; Yan, Dicky C. K.: Designing tributary networks with multiple ring families. (1998)
  19. Luss, Hanan; Rosenwein, Moshe B.: Operations research applications: Opportunities and accomplishments (1997)
  20. Bordetsky, Alexander B.: Reasoning on infeasibility in distributed collaborative computing environment (1996)