Abstract

Shared restoration is key to realizing the bandwidth savings offered by mesh networking. To be viable, restoration has to be effected very quickly—typically, within 50 ms after failure. However, all the known schemes involve signaling and cross-connect setups and require excessive duration times. We describe a novel restoration scheme called FASTeR that dramatically reduces restoration times by eliminating these operations. It involves a novel select-multicast feature of the cross connects and can be applied to all-optical or electrical networks. We extend the generalized multiprotocol label-switching (GMPLS) standard to support this scheme and present simulation results to evaluate the scheme and show that a small multicasting degree is sufficient in practice to achieve the bandwidth savings gained in traditional restoration schemes.

© 2003 Optical Society of America

PDF Article

References

  • View by:
  • |

  1. T. E. Stern and K. Bala, <emph type="italic">Multiwavelength Optical Networks: A Layered Approach</emph> (Addison-Wesley, Reading, Mass., 1999).
  2. W. J. Goralski, <emph type="italic">SONET</emph>, 2nd ed. (McGraw-Hill Professional, New York, 2000).
  3. R. D. Doverspike, G. Sahin, J. L. Strand, and R. W. Tkach, “Fast restoration in a mesh network of optical cross-connects,” in Optical Fiber Communication Conference (OFC 1999) (Optical Society of America, Washington, D.C., 1999).
  4. G. Li, J. Yates, R. Doverspike, and D. Wang, “Experiments in fast restoration using GMPLS in optical/electronic mesh networks, in <emph type="italic">Optical Fiber Communication Conference (OFC 2001)</emph>, Vol. 54 of OSA Trends in Optics and Photonics Series (Optical Society of America, Washington, D.C., 2001).
  5. L. H. Sahasrabuddhe and B. Mukherjee, “Light-trees: optical multicasting for improved performance in wavelength-routed networks,” IEEE Commun. (February 1999), pp. 67–73.
  6. O. Hauser, M. Kodialam, and T. V. Lakshman, “Capacity design for fast path restorable optical networks,” in <emph type="italic">Proceedings of INFOCOM 2002</emph> (Institute of Electrical and Electronic Engineers, New York, 2002).
  7. J. W. Suurballe, “Disjoint paths in a network,” Networks <emph type="bold">4,</emph> 125–145 (1974).
  8. B. Sanso and P. Soriano, eds. <emph type="italic">Telecommunications Network Planning</emph> (Kluwer Academic, Dordrecht, The Netherlands, 1999).
  9. G. Li, D. Wang, C. Kalmanek, and R. Doverspike, “Efficient distributed path selection for shared restoration connections,” in <emph type="italic">Proceedings of INFOCOM 2002</emph> (Institute of Electrical and Electronic Engineers, New York, 2002).
  10. M. Alicherry, C. Phadke, and V. Poosala, “Routing and design in k-shared networks,” to be presented at IEEE Globecom, San Francisco, Calif., 1–5 December 2003.
  11. J. A. Walker, K. W. Goossen, and S. C. Arney, “Mechanical anti-reflection switch (MARS) device for fiber-in-the-loop applications” IEEE/LEOS 1996 Summer Topical Meetings, 1996.
  12. A. S. Tanenbaum, <emph type="italic">Computer Networks</emph> (Prentice Hall, Englewood Cliffs, N.J., 1989).
  13. I. H. Liu, D. Pendarakis, B. Rajagopalan, and N. Komaee, “OSPF-TE extensions in support of shared mesh restoration,” Internet Draft, draft-liu-gmpls-ospf-restoration-00.txt (Internet Engineering Task Force, 2003), <a href="http://www.ietf.org/internet-drafts/">http://www.ietf.org/internet-drafts/</url>.

IEEE Commun. (1)

L. H. Sahasrabuddhe and B. Mukherjee, “Light-trees: optical multicasting for improved performance in wavelength-routed networks,” IEEE Commun. (February 1999), pp. 67–73.

IEEE/LEOS 1996 (1)

J. A. Walker, K. W. Goossen, and S. C. Arney, “Mechanical anti-reflection switch (MARS) device for fiber-in-the-loop applications” IEEE/LEOS 1996 Summer Topical Meetings, 1996.

INFOCOM 2002 (2)

G. Li, D. Wang, C. Kalmanek, and R. Doverspike, “Efficient distributed path selection for shared restoration connections,” in <emph type="italic">Proceedings of INFOCOM 2002</emph> (Institute of Electrical and Electronic Engineers, New York, 2002).

O. Hauser, M. Kodialam, and T. V. Lakshman, “Capacity design for fast path restorable optical networks,” in <emph type="italic">Proceedings of INFOCOM 2002</emph> (Institute of Electrical and Electronic Engineers, New York, 2002).

Networks (1)

J. W. Suurballe, “Disjoint paths in a network,” Networks <emph type="bold">4,</emph> 125–145 (1974).

OFC 1999 (1)

R. D. Doverspike, G. Sahin, J. L. Strand, and R. W. Tkach, “Fast restoration in a mesh network of optical cross-connects,” in Optical Fiber Communication Conference (OFC 1999) (Optical Society of America, Washington, D.C., 1999).

OSA TOPS Series (1)

G. Li, J. Yates, R. Doverspike, and D. Wang, “Experiments in fast restoration using GMPLS in optical/electronic mesh networks, in <emph type="italic">Optical Fiber Communication Conference (OFC 2001)</emph>, Vol. 54 of OSA Trends in Optics and Photonics Series (Optical Society of America, Washington, D.C., 2001).

Other (6)

T. E. Stern and K. Bala, <emph type="italic">Multiwavelength Optical Networks: A Layered Approach</emph> (Addison-Wesley, Reading, Mass., 1999).

W. J. Goralski, <emph type="italic">SONET</emph>, 2nd ed. (McGraw-Hill Professional, New York, 2000).

B. Sanso and P. Soriano, eds. <emph type="italic">Telecommunications Network Planning</emph> (Kluwer Academic, Dordrecht, The Netherlands, 1999).

M. Alicherry, C. Phadke, and V. Poosala, “Routing and design in k-shared networks,” to be presented at IEEE Globecom, San Francisco, Calif., 1–5 December 2003.

A. S. Tanenbaum, <emph type="italic">Computer Networks</emph> (Prentice Hall, Englewood Cliffs, N.J., 1989).

I. H. Liu, D. Pendarakis, B. Rajagopalan, and N. Komaee, “OSPF-TE extensions in support of shared mesh restoration,” Internet Draft, draft-liu-gmpls-ospf-restoration-00.txt (Internet Engineering Task Force, 2003), <a href="http://www.ietf.org/internet-drafts/">http://www.ietf.org/internet-drafts/</url>.

Cited By

OSA participates in CrossRef's Cited-By Linking service. Citing articles from OSA journals and other participating publishers are listed here.

Alert me when this article is cited.