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
Affiliations:
State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing, People's Republic of China 100876;State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing, People's Republic of China 100876;Department of Electronic Engineering, Queen Mary, University of London, London, UK E1 4NS;State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing, People's Republic of China 100876;Research Institute of Highway Ministry of Transport, Beijing, People's Republic of China 100088;State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing, People's Republic of China 100876;State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing, People's Republic of China 100876
Venue:
Photonic Network Communications
Year:
2012

Citing 5
Cited 1

An Adaptive Hierarchical Routing Protocol

IEEE Transactions on Computers
A framework for evaluating the performance of cluster algorithms for hierarchical networks

IEEE/ACM Transactions on Networking (TON)
A new approach to optical networks security: attack-aware routing and wavelength assignment

IEEE/ACM Transactions on Networking (TON)
Traffic models in broadband networks

IEEE Communications Magazine
Service Differentiation and Traffic Engineering in IP over WDM Networks

IEEE Communications Magazine

A channel estimation based opportunistic scheduling scheme in wireless bidirectional networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

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.