Fast approximate dimensioning and performance analysis of mesh optical networks

ABSTRACT

This paper presents a collection of approximation formulas that allow a network planner to quickly estimate the size of a mesh optical network with limited inputs. In particular, it provides a set of equations that relate number of sites, average fiber connectivity, demand load and capacity for various mesh protection architectures. These results can be used to easily and quickly estimate the amount of traffic that can be carried over a given network, or, conversely, given the traffic to be supported, to assess the characteristics of the topology required (in terms of number of nodes, connectivity). Finally, this analysis can be used to estimate the restoration performance that can be expected without resorting to extensive simulation studies.

REFERENCES

• 1: {1} J.-F. Labourdette et al., "Fast approximate dimensioning and performance analysis of mesh optical networks," presented at the 4th Int. Workshop Design of Reliable Communication Networks (DRCN), Banff, Canada, Oct. 2003.
• 2: {2} S. Korotky, "Network global expectation model: A statistical formalism for quickly quantifying network needs and costs," J. Lightw. Technol., vol. 22, no. 3, pp. 703-722, Mar. 2004.
• 3: {3} J. Doucette and W. D. Grover, "Comparison of mesh protection and restoration schemes and the dependency on graph connectivity," presented at the 3rd Int. Workshop Design of Reliable Communication Networks (DRCN), Budapest, Hungary, Oct. 2001.
• 4: {4} G. Ellinas et al., "Routing and restoration architectures in mesh optical networks," Opt. Netw. Mag., vol. 4, no. 1, Jan.-Feb. 2003.
• 5: {5} J.-F. Labourdette, E. Bouillet, R. Ramamurthy, G. Ellinas, S. Chaudhuri, and K. Bala, "Routing strategies for capacity-efficient and fast-restorable mesh optical networks," Photonic Network Communications, Special Issue on Routing, Protection and Restoration Strategies and Algorithms for WDM Optical Networks, Jul.-Dec. 2002.
• 6: {6} Y. Liu, D. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing," in Proc. IEEE INFOCOM, Anchorage, AL, Apr. 2001, pp. 699-708.
• 7: {7} M. Kodialam and T.V. Lakshman, "Dynamic routing of bandwidth guaranteed tunnels with restoration," in Proc. IEEE INFOCOM, Tel Aviv, Israel, Mar. 2000, pp. 902-911.
• 8: {8} G. Li et al., "Efficient distributed path selection for shared restoration connections," in Proc. IEEE INFOCOM, New York, Jul. 2002, pp. 140-149.
• 9: {9} E. Bouillet et al., "Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures," in Proc. IEEE INFOCOM , New York, Jun. 2002, pp. 801-807.
• 10: {10} C. Qiao et al., "Distributed partial information management (DPIM) schemes for survivable networks--Part I," in Proc. IEEE INFOCOM, New York, Jul. 2002, pp. 302-311.
• 11: {11} N. Biggs, Algebraic Graph Theory. Cambridge, U.K.: Cambridge Univ. Press, 1974.
• 12: {12} J. Doucette, W. Grover, and T. Bach, "Bi-criteria studies of mesh network restoration: Path length versus capacity tradeoffs," in Proc. IEEE/OSA Optical Fiber Commun. Conf., vol. 2, Anaheim, CA, Mar. 2001, pp. TuG2-2-TuG2-3.
• 13: {13} E. Bouillet, J.-F. Labourdette, R. Ramamurthy, and S. Chaudhuri, "Enhanced algorithm cost model to control tradeoffs in provisioning shared mesh restored lightpaths," in Proc. IEEE/OSA Optical Fiber Commun. Conf., Anaheim, CA, Mar. 2002, pp. 544-546.
• 14: {14} C. Qiao et al., "Novel models for efficient shared-path protection," in Proc. IEEE/OSA Optical Fiber Commun. Conf., Anaheim, CA, Mar. 2002, pp. 546-547.
• 15: {15} S. Datta, S. Sengupta, S. Biswas, and S. Datta, "Efficient channel reservation for backup paths in optical mesh networks," in Proc. IEEE GLOBECOM, San Antonio, TX, Nov. 2001, pp. 2104-2108.
• 16: {16} R. Ramamurthy et al., "Limiting sharing on protection channels in mesh optical networks," in Proc. IEEE/OSA Optical Fiber Commun. Conf., Atlanta, GA, Mar. 2003, pp. 204-205.
• 17: {17} A. A. Akyamac et al., "Optical mesh networks modeling: Simulation and analysis of restoration performance," presented at the National Fiber Optic Engineers Conf. (NFOEC), Dallas, TX, Sep. 2002.
• 18: Ramesh Bhandari, Survivable Networks: Algorithms for Diverse Routing, Kluwer Academic Publishers, Norwell, MA, 1998

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.4 PERFORMANCE OF SYSTEMS
      Subjects: Modeling techniques

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.5 Local and Wide-Area Networks
          Subjects: High-speed (e.g., FDDI, fiber channel, ATM)

General Terms:
Design, Experimentation, Measurement, Performance, Theory

Keywords:
mesh networking, optical networks, performance analysis, restoration