Efficient Multiple Multicast in WDM Networks

スポンサーリンク

概要

• 論文の詳細を見る

• This paper addresses the problem of multiple multicast in WDM networks. It presents three efficient algo-rithms to construct an optimal/sub-optimal multicast tree foreach multicast and minimise the network congestion on wave-lengths. The first two algorithm achieve an optimal network congestion for a specific class of networks whose all wavelengths areglobally accessible and convertible at a unit cost. The third algorithm produces an approximation solution for the general case of WDM networks.

• 社団法人電子情報通信学会の論文
• 1999-06-25

著者

• Shen Hong

  School Of Computer Science University Of Adelaide

• Shen Hong

  School Of Computing And Information Technology Griffith University

• Evans David

  The Department Of Computing The Nottingham Trent University

• LIANG Weifa

  the Department of Computer Science, The Australian National University

• WANG Yuke

  the Department of Electrical and Computer Engineering, Concordia University

• Wang Yuke

  The Department Of Electrical And Computer Engineering Concordia University

• Liang Weifa

  The Department Of Computer Science The Australian National University

関連論文

• Overview of Task Scheduling in Grid Computing
• Resource Management and Scheduling in Grid Computing
• A New Approximation Algorithm for Computing 2-Restricted Disjoint Paths(Algorithm Theory)
• Efficient Multiple Multicast in WDM Networks

スポンサーリンク