Routing in sparse splitting optical networks with multicast traffic

@article{Yan2003RoutingIS,
  title={Routing in sparse splitting optical networks with multicast traffic},
  author={Shuguang Yan and Jitender S. Deogun and Maher Ali},
  journal={Computer Networks},
  year={2003},
  volume={41},
  pages={89-113}
}
In this paper, we investigate the problem of Multicast Routing in Sparse Splitting Networks (MR-SSN). Given a network topology with the multicast capable nodes distributed uniformly throughout the network, and a multicast session, the MR-SSN problem is to find a route from the source node of the multicast session to all destinations of the multicast session such that the total number of fibers used in establishing the session is minimized. In this paper, we develop a rerouting algorithm for a… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 13 references

An approximate solution for the Steiner problem in graphs

  • H. Takahashi, A. Matsuyama
  • Math Japonica 24 (6)
  • 1980
Highly Influential
4 Excerpts

Larochelle , A tabu search heuristic for the Steiner tree problem

  • J.-F. B. S. Michel Gendreau
  • Networks
  • 2000

Light-trees: optical multicasting for improved performance in wavelengthrouted networks

  • L. H. Sahasrabuddhe, B. Mukherjee
  • IEEE Communications Magazine 37
  • 1999
1 Excerpt

Tabu Search

  • F. Glover, M. Laguna
  • Kluwer Academic Press, Dordrecht
  • 1997
2 Excerpts

Similar Papers

Loading similar papers…