2 resultados para Global circular shortest path

em DigitalCommons@University of Nebraska - Lincoln


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Sparse traffic grooming is a practical problem to be addressed in heterogeneous multi-vendor optical WDM networks where only some of the optical cross-connects (OXCs) have grooming capabilities. Such a network is called as a sparse grooming network. The sparse grooming problem under dynamic traffic in optical WDM mesh networks is a relatively unexplored problem. In this work, we propose the maximize-lightpath-sharing multi-hop (MLS-MH) grooming algorithm to support dynamic traffic grooming in sparse grooming networks. We also present an analytical model to evaluate the blocking performance of the MLS-MH algorithm. Simulation results show that MLSMH outperforms an existing grooming algorithm, the shortest path single-hop (SPSH) algorithm. The numerical results from analysis show that it matches closely with the simulation. The effect of the number of grooming nodes in the network on the blocking performance is also analyzed.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

There is compelling evidence that Planet Earth is on the path to an era of global warming that has serious implications for the well-being of both people and nature. This three-volume synthesis of literature will be a marvelous place for both the public and new scholars interested in global warming to begin their pursuit of the subject. The author captures the best of the scientific literature and press materials appearing in recent years. The utility of these volumes as a resource for gaining a broad background or pursuing a particular aspect of global warming is enhanced by Johansen's talent for explaining with clarity a vast and rapidly growing subject.