TAILIEUCHUNG - Optical Fiber Communications and Devicesan incorrectly Part 12

Tham khảo tài liệu 'optical fiber communications and devicesan incorrectly part 12', kỹ thuật - công nghệ, cơ khí - chế tạo máy phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả | A Comparative Study of Node Architectures with Add Drop Constraints in WDM Networks 265 Jl . Vp 1 2Lị W1 1 2 . k I r k Í 1 1 1 J where the operator denotes the bitwise AND operation. Note that all operations between vectors have to be interpreted component-wise. Checking if the path is further extendable We check if path p has at least one available wavelength. If Wp 0 all zero vector then path p is rejected. Domination relationship We also define a domination relationship between two paths that can be used to reduce the number of paths considered by the RWA algorithm. In particular we will say that p1 dominates p2 notation pi p2 iff Lpi Lp2 and Wpi Wp2 The relationship for vectors W should be interpreted component-wise. A path that is dominated by another path has larger length and worse wavelength availability than the other path and there is no reason to consider it or extend it further. Multi-cost RWA algorithm The proposed multi-cost RWA algorithm consists of two phases Phase 1 Computing the set of non-dominated paths Pn-d The algorithm that computes the non-dominated paths from a given source to all network nodes including the destination can be viewed as a generalization of Dijkstra s algorithm that only considers scalar link costs. The basic difference is that instead of a single path a set of non-dominated paths between the origin and each node is obtained. Thus a node for which one path has already been found is not finalized as in the Dijkstra case since we can find more non-dominated paths to that node later. An algorithm for obtaining the set Pn-d of non-dominated paths from a given source to all nodes is given in Varvarigos et al. 2008 . By definition for the given source and destination the non-dominated paths that the algorithm returns have at least one available wavelength. Phase 2 Choosing the optimal lightpath from Pn-d In the second phase of the proposed algorithm we apply an optimization function or policy g Vp to the cost vector Vp of .

TỪ KHÓA LIÊN QUAN
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.