Topology aggregation and decoding algorithms based on a minimum spanning tree in asymmetric multi-domain optical networks

Authors:
Jianping Wang;Chaoping Pan;Huai Zhang;Qiwu Wu;Xianwei Zhou
Affiliations:
Department of Communication Engineering, School of Information Engineering, University of Science and Technology Beijing, Beijing, People's Republic of China 100083;Department of Communication Engineering, School of Information Engineering, University of Science and Technology Beijing, Beijing, People's Republic of China 100083;Department of Communication Engineering, School of Information Engineering, University of Science and Technology Beijing, Beijing, People's Republic of China 100083;Department of Communication Engineering, School of Information Engineering, University of Science and Technology Beijing, Beijing, People's Republic of China 100083;Department of Communication Engineering, School of Information Engineering, University of Science and Technology Beijing, Beijing, People's Republic of China 100083
Venue:
Photonic Network Communications
Year:
2011

Citing 5
Cited 0

Topology information condensation in hierarchical networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Topology aggregation for directed graphs

IEEE/ACM Transactions on Networking (TON)
Source-oriented topology aggregation with multiple QoS parameters in hierarchical networks

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Spanning tree method for link state aggregation in large communication networks

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Routing with topology aggregation in delay-bandwidth sensitive networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In an optical network, the connections are generally bidirectional, but their QoS parameters in each direction may be not the same. In this paper, we propose an enhanced algorithm called Node Label Order First (NLOF), which can maintain asymmetrical information and guarantee availability of the compressed topology. Besides, a decoding algorithm to restore the compressed topology named Average Proportional point (AP) is also proposed, which not only retains the space complexity of the aggregation process but also improves the accuracy of the restored information. Simulation results show that combing NLOF with AP can balance the contradiction between space complexity of the aggregation algorithm and routing accuracy.