Advertisement

Photonic Network Communications

, Volume 21, Issue 1, pp 28–33 | Cite as

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

  • Jianping Wang
  • Chaoping Pan
  • Huai Zhang
  • Qiwu Wu
  • Xianwei Zhou
Article
  • 72 Downloads

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.

Keywords

Multi-domain Topology aggregation Asymmetric Direction Decoding 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Mieghem P.V.: Topology information condensation in hierarchical networks. Comput. Netw. 31(20), 2115–2137 (1999)CrossRefGoogle Scholar
  2. 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. 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)CrossRefGoogle Scholar
  4. 4.
    Lee, W.C.: Minimum equivalent subspanner algorithms for topology aggregation. In: ATM networks. 1999 2nd International Conference on ATM. pp. 351–359, Feb 1999Google Scholar
  5. 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)CrossRefGoogle Scholar
  6. 6.
    Awerbuch B., Shavitt Y.: Topology aggregation for directed grap. IEEE/ACM Trans. Netw. (TON) 9(1), 82–90 (2001)CrossRefGoogle Scholar
  7. 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)CrossRefGoogle Scholar
  8. 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 1995Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Jianping Wang
    • 1
  • Chaoping Pan
    • 1
  • Huai Zhang
    • 1
  • Qiwu Wu
    • 1
  • Xianwei Zhou
    • 1
  1. 1.Department of Communication Engineering, School of Information EngineeringUniversity of Science and Technology BeijingBeijingPeople’s Republic of China

Personalised recommendations