Path computation algorithms for dynamic service provisioning in SDH networks under SRLG constraints

@article{Madanagopal2007PathCA,
  title={Path computation algorithms for dynamic service provisioning in SDH networks under SRLG constraints},
  author={Ramachandran Madanagopal and N. Usha Rani and Timothy A. Gonsalves},
  journal={2007 10th IFIP/IEEE International Symposium on Integrated Network Management},
  year={2007},
  pages={206-215}
}
SDH is the dominant transport technology for delivery of voice and private-line bandwidth services in access and backbone networks. Dynamic service provisioning requires the use of on-line algorithms which automatically compute the path to be taken to satisfy the given service request. Shared Risk Link Group (SRLG) has been widely recognized as an important concept in survivable optical networks. In this paper, a new heuristic SRLG-disjoint path computation algorithm proposed for dedicated… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Path Computation Algorithms for Dynamic Service Provisioning in SDH Networks

  • R. Madanagopal, N. Usha Rani, T A. Gonsalves
  • 10 IFIP/IEEE Symposium on Integrated Management…
  • 2007
6 Excerpts

Path Computation Algorithms for Dynamic Service Provisioning in Transport Networks

  • R. Madanagopal
  • MS Thesis, Dep. of Computer Science and Eng…
  • 2007
1 Excerpt

Issues for Routing in the Optical Layer

  • J. Strand, A. Chiu, R. Tkach
  • IEEE Communications Magazine, vol. 39, pp. 81–87…
  • 2001
1 Excerpt

Dynamic BandwidthAllocation and PathRestoration in SONET Self - Healing Networks

  • S. Kheradpir A. Gersht, A. Shulman
  • 2000

Similar Papers

Loading similar papers…