• 沒有找到結果。

Dynamic multicast routing under delay constraints in WDM networks with heterogeneous light splitting capabilities

N/A
N/A
Protected

Academic year: 2022

Share "Dynamic multicast routing under delay constraints in WDM networks with heterogeneous light splitting capabilities"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

題名: Dynamic multicast routing under delay constraints in WDM networks with heterogeneous light splitting capabilities

作者: M. T. Chen;S. S. Tseng;B. M. T. Lin

貢獻者: Department of Information Science and Applications

關鍵詞: RWA;Multicast request;WDM network;Delay bound;Light splitting capacity;Multicast cost

日期: 2005-05

上傳時間: 2009-11-30T08:03:27Z 出版者: Asia University

摘要: Because optical WDM networks will be realized as network backbone in the near future, multicasting in WDM networks needs to be supported for various network applications. In this paper, we propose a new

dynamic multicast routing problem under delay constraints (DMR-DC) for finding an optimal light-forest with the minimum multicast cost from these links with available wavelengths for routing a multicast request that arrives in random with a given delay bound in a WDM network with heterogeneous light splitting capabilities, where a light-forest is a set of light-trees used to set up switches to route the request. Multicast cost is defined by communication cost ratio and wavelength consumption ratio.

The problem is to determine a light-forest with less wavelength consumption and less communication cost. This problem is NP-hard because it can be reduced from the minimum Steiner tree problem. In this paper, we propose an efficient three-phase (generation, refinement, and conversion) solution model to find approximate solutions in a

reasonable time.

參考文獻

相關文件

These images are the results of relighting the synthesized target object under Lambertian model (left column) and Phong model (right column) with different light directions ....

Given a graph and a set of p sources, the problem of finding the minimum routing cost spanning tree (MRCT) is NP-hard for any constant p > 1 [9].. When p = 1, i.e., there is only

Marar (2000), “On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in The Presence of User Noncompliance,” Transportation Science, Vol..

(2004), "Waiting Strategies for the Dynamic Pickup and Delivery Problem with Time Window", Transportation Research Part B, Vol. Odoni (1995),"Stochastic and Dynamic

Therefore, the purpose of this study is to propose a model, named as the Interhub Heterogeneous Fleet Routing Problem (IHFRP), to deal with the route design

Selcuk Candan, ”GMP: Distributed Geographic Multicast Routing in Wireless Sensor Networks,” IEEE International Conference on Distributed Computing Systems,

Furthermore, given a set of nets in a bus on routing grids with obstacles, and the length constraints for all the nets in the bus, based on this proposed longest path generation,

For the minimum border problem of biochip mask, this paper first show the value of the minimum border length under the fixed mask area, and then propose the optimal algorithm