The emergence of new services demands multicast function in optical network. Because of the high cost and complex architecture of multicast capable （MC） node, splitter- sharing switch structure is introduced in whic...The emergence of new services demands multicast function in optical network. Because of the high cost and complex architecture of multicast capable （MC） node, splitter- sharing switch structure is introduced in which the light splitters are shared by all input signals. To accommodate to this situation, by extending resource ReSerVation protocol-traffic engineering （RSVP-TE） and open shortest path first-traffic engineering （OSPF-TE）, a new optical multicast mechanism is provided and the signaling flow and its finite state machine model are given. At the same time, a multicast routing algorithm in splitter-sharing optical network and a changing link weight policy to balance network traffic are proposed. Simulations in NSFNET show no matter with or without wavelength converters, when the number of splitters is 25% of that demanded by traditional MC nodes, the multicast performance has been close to the ideal circumstance. Wavelength converters and changing link weight help much in improving the traffic performance when the number of splitters is adequate.展开更多
A heuristic algorithm of establishing a minimum coding nodes multicast tree on which a two-channel all-optical network coding scheme can be performed is presented. To minimize the coding nodes, the heuristic graph-sea...A heuristic algorithm of establishing a minimum coding nodes multicast tree on which a two-channel all-optical network coding scheme can be performed is presented. To minimize the coding nodes, the heuristic graph-search control strategies are investigated. Firstly, a minimum relatedness principle is proposed to balance and minimize the out-degrees of the conventionally directed multicast tree. Secondly, a set of rules about bottom-up path search are presented to recover another path in the conventionally directed multicast tree, and a conflict-backtracking principle is given to minimize the coding nodes in this process. To evaluate the algorithm, some results are given. The results indicate that the algorithm can perform the expected function. Moreover, to further test and verify the algorithm, performances of different multicast modes are compared and analyzed. The results show that the multicast performances will be impaired if a multicast tree contains redundant coding nodes.展开更多
基金This work is supported by the Hi-Tech Research and Development Program of China （2006AA01Z244）；The National Natural Science Foundation of China （60772022）；Program for New Century Excellent Talents in University （NCET-05-0112）.
文摘The emergence of new services demands multicast function in optical network. Because of the high cost and complex architecture of multicast capable （MC） node, splitter- sharing switch structure is introduced in which the light splitters are shared by all input signals. To accommodate to this situation, by extending resource ReSerVation protocol-traffic engineering （RSVP-TE） and open shortest path first-traffic engineering （OSPF-TE）, a new optical multicast mechanism is provided and the signaling flow and its finite state machine model are given. At the same time, a multicast routing algorithm in splitter-sharing optical network and a changing link weight policy to balance network traffic are proposed. Simulations in NSFNET show no matter with or without wavelength converters, when the number of splitters is 25% of that demanded by traditional MC nodes, the multicast performance has been close to the ideal circumstance. Wavelength converters and changing link weight help much in improving the traffic performance when the number of splitters is adequate.
基金supported the National Natural Science Foundation of China (1171103)the Doctoral Research Fund of Shandong University of Technology (4041-411023)
文摘A heuristic algorithm of establishing a minimum coding nodes multicast tree on which a two-channel all-optical network coding scheme can be performed is presented. To minimize the coding nodes, the heuristic graph-search control strategies are investigated. Firstly, a minimum relatedness principle is proposed to balance and minimize the out-degrees of the conventionally directed multicast tree. Secondly, a set of rules about bottom-up path search are presented to recover another path in the conventionally directed multicast tree, and a conflict-backtracking principle is given to minimize the coding nodes in this process. To evaluate the algorithm, some results are given. The results indicate that the algorithm can perform the expected function. Moreover, to further test and verify the algorithm, performances of different multicast modes are compared and analyzed. The results show that the multicast performances will be impaired if a multicast tree contains redundant coding nodes.
