Applying Saturated Cut Method in Dynamic Multicast Traffic Grooming in IP/MPLS over WDM Mesh Networks

@article{Chen2005ApplyingSC,
  title={Applying Saturated Cut Method in Dynamic Multicast Traffic Grooming in IP/MPLS over WDM Mesh Networks},
  author={Bin Chen and S. Bose and Wen-De Zhong},
  journal={2005 5th International Conference on Information Communications & Signal Processing},
  year={2005},
  pages={1207-1211}
}
Handling low and medium speed traffic flows using cost-effective traffic grooming strategies is becoming increasingly important for the efficient operation of WDM networks. In this paper, we apply the saturated cut method to routing sub-wavelength multicast traffic in reconfigurable, unicast, mesh WDM networks. Simulations show that setting up lightpaths for the saturated cut significantly improves network-blocking performance 

References

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

An approximate solution for the Steiner problem in graphs

H. Takahashi, A. Matsuyama
Math. Jap., vol. 24,pp 573-577, 1980. • 1980
View 3 Excerpts
Highly Influenced

A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,"Optical

H. Zang, J. P. Jue, B. Mukherjee
Network Mag., • 2000
View 2 Excerpts

Data Networks" Englewood Cliffs, NJ, Prentic-Hall

Dimitri Bertsekas, Robert Gallager
1987
View 2 Excerpts

Similar Papers

Loading similar papers…