Skip to main content
Log in

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

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Mieghem P.V.: Topology information condensation in hierarchical networks. Comput. Netw. 31(20), 2115–2137 (1999)

    Article  Google Scholar 

  2. Ji Y., Li H., Lu Y.: The Principle and Application of ASON. Press of Beijing University of Post and Teleconmunication, Beijing (2005)

    Google Scholar 

  3. King-Shan L., Klara N., Chen S.: Routing with topology aggregation in delay-bandwidth sensitive networks. IEEE/ACM Trans. Netw. (TON) 12(1), 17–29 (2004)

    Article  Google Scholar 

  4. Lee, W.C.: Minimum equivalent subspanner algorithms for topology aggregation. In: ATM networks. 1999 2nd International Conference on ATM. pp. 351–359, Feb 1999

  5. Korkmaz T., Krunz M.: Source-oriented topology aggregation with multiple QoS parameters in hierarchical networks. ACM Trans. Model. Comput. Simul. 10(4), 295–325 (2000)

    Article  Google Scholar 

  6. Awerbuch B., Shavitt Y.: Topology aggregation for directed grap. IEEE/ACM Trans. Netw. (TON) 9(1), 82–90 (2001)

    Article  Google Scholar 

  7. Lei L., Yue-feng J., Lin G.: Asymmetric attribute aggregation in hierarchical networks. Oxford J. Math. Phys. Sci. IEICE-Trans. Commun. E90-B(8), 2034–2045 (2007)

    Article  Google Scholar 

  8. Lee, W.C.: Spanning tree method for link state aggregation in large communication networks. In: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies. pp. 297–302, April 1995

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jianping Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, J., Pan, C., Zhang, H. et al. Topology aggregation and decoding algorithms based on a minimum spanning tree in asymmetric multi-domain optical networks. Photon Netw Commun 21, 28–33 (2011). https://doi.org/10.1007/s11107-010-0276-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-010-0276-9

Keywords

Navigation