In this paper, a novel Real coded genetic algorithm(RcGA) is proposed for routing and wavelength assignment in virtual wavelength path routed WDM network. The comparison is done with heuristic search algorithm. Here, ...
详细信息
ISBN:
(纸本)9780863418877
In this paper, a novel Real coded genetic algorithm(RcGA) is proposed for routing and wavelength assignment in virtual wavelength path routed WDM network. The comparison is done with heuristic search algorithm. Here, a wavelength routed WDM optical network is considered and the RcGA searchalgorithm is implemented on it. The main target of the algorithm is to find solution among all possible ones, which is most optimized solution. Therefore they may be considered as approximate and not accurate algorithms. The results are always close to the best solution. The objective of this algorithm is to minimize the requirement of wavelength in any network topology demanded by network traffic. It also minimizes the hop length between source and destination nodes in the traffic. As wavelength and number of hops get reduced, the cost of the network also gets reduced and maximizes the resource utilization. In the first phase of this algorithm, we assigned minimum hop length to each route demanded by traffic and also assigned wavelengths to each route. In second phase of algorithm effective rerouting is performed to reduce the number of wavelengths required in the network and it also minimizes the hop length of each rerouted route. By minimizing wavelength requirement, the need of wavelength converter gets reduced, so that the network cost is also reduced. Along with the implementation of RcGA algorithm and heuristicalgorithm, few more parameters such as Network Congestion and Network wavelength converter requirement are discovered. The Network Congestion on each link of network is used for calculation of Network Wavelength Requirement, and Network wavelength converter Requirement.
One fundamental and challenging problem in coding theory is to optimize the parameters [n, k, d] of a linear code over the finite field Fq and construct codes with best possible parameters. There are tables and databa...
详细信息
One fundamental and challenging problem in coding theory is to optimize the parameters [n, k, d] of a linear code over the finite field Fq and construct codes with best possible parameters. There are tables and databases of best-known linear codes over the finite fields of size up to 9 together with upper bounds on the minimum distances. Motivated by recent works on codes over F-11, we present a table of best-known linear codes over F-11 together with upper bounds on minimum distances. Our table covers the range n <= 150 for the length, and 3 <= k <= 7 for the dimension. To the best of our knowledge, this is the first time such a table is presented in the literature. For the construction of the best-known codes, we employed an iterative heuristic search algorithm to search for new linear codes in the class of quasi-twisted (QT) codes. The search yielded many new codes with better parameters than previously known codes. In many cases, optimal codes are obtained. In addition to presenting a comprehensive table of best-known codes over F-11 of dimensions up to 7 with upper bounds on the minimum distances, we also present separate tables for the optimal codes and new QT codes over F-11. We hope that this work will be a useful source for further study on codes over F-11.
暂无评论