A novel method to evaluate clustering algorithms for hierarchical optical networks |
| |
Authors: | Shanguo Huang Weihua Lian Xian Zhang Bingli Guo Pei Luo Jie Zhang Wanyi Gu |
| |
Affiliation: | 1. State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing, 100876, People??s Republic of China 2. Department of Electronic Engineering, Queen Mary, University of London, Mile End Road, London, E1 4NS, UK 3. Research Institute of Highway Ministry of Transport, Beijing, 100088, People??s Republic of China
|
| |
Abstract: | The routing issues in multi-layer and multi-domain optical networks have drawn much attention in current research. With the
introduction of the path computation element, routes can be calculated more efficiently in multi-domain optical networks.
However, the optimal degree of routing approach in multi-layer and multi-domain optical networks is also determined by the
clustering algorithms deployed for construction of hierarchical networks. Therefore, it is important to investigate the way
to evaluate the impact of the clustering algorithm on the routing approach (e.g., blocking probability) in optical networks
with dynamic traffic, which has not been studied sufficiently. In this paper, a novel method to describe and evaluate the
clustered structures generated by different clustering algorithms for hierarchical optical networks is proposed. This method
deploys a novel evaluation metric that represents blocking probability of clustered optical networks, so it can be used as
guidelines for designing clustered structures. Besides theoretical analysis, simulations are carried out on different network
topologies and clustered types to validate the effectiveness of the method presented. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|