基于分层图的最少资源碎片AR-RWA算法

A Novel Advance Reservation-Based RWA with Less Resource Fragmentations Based on Layered Graph for Lambda-Grids

  • 摘要: 提前预留模式是保障网格计算QoS的重要手段,但提前预留引起的资源碎片对资源利用率影响很大。该文分析了当前光网格中支持提前预留RWA算法存在的问题,即没有考虑资源碎片量及其对后来到达业务请求的影响。基于分层图模型,提出了最少资源碎片波长分配算法(即LG-LRF)。该算法将资源碎片作为分层图中波长平面的链路权值,尝试在分层图模型中对路由子问题和波长分配子问题一并解决,较大限度地避免波长连续性限制与资源碎片对后续业务的影响。通过仿真证明了其阻塞率、资源碎片率等性能有一定提高,适合工作于提前预留模式。

     

    Abstract: In Lambda-grids, advance reservation is one of important methods to guarantee QoS for grid computing applications. However, it would bring many resource fragmentations, which have greatly effect on resource utilization. This paper discusses the key problems existing in advance reservation-based RWA algorithm, i.e., not considering resource fragmentation and its impacts to new arriving traffic request. Based on layered-graph model, a heuristic routing and wavelength assignment algorithm is proposed to support advance reservation with less resource fragmentations, named Less Resource Fragmentations based on Layered Graph (LG-LRF). The algorithm directly considers resource fragmentations as link weights of layered wavelength-plane graph, and therefore, can resolve routing and wavelength assignment at the same time, and avoid the wavelength continuity constraint and some side-effects on new arriving traffic request. Simulation results show that LG-LRF outperforms the conventional heuristic RWA algorithms in terms of blocking probability of traffic requests and resource fragmentations ratio, and is more suitable for advance reservation for lambda-grids.

     

/

返回文章
返回