Visualizing Algorithms for the Design and Analysis of Survivable Networks

  • Ala Eddine Barouni
  • Ali Jaoua
  • Nejib Zaguia
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1731)


We present algorithms for the drawing of survivable telecommunication networks. The visualization of telecommunication networks is a very important problem. For some specific rings in a network, we may have a high traffic. The network designers may decide to add more equipment to the nodes (sites) of these rings in order to increase the performance of the network. Therefore, one of the most important properties of the survivable telecommunication network, is that rings should be easily recognizable. Given a ring cover of survivable telecommunication networks, we provide three techniques for drawing a ring cover. We should mention that all these drawings should respect many criteria in order to preserve the readability of the drawing. As in most of the graph drawing algorithms, the area used for the drawing is very important, our proposed algorithms produce drawings that require O(n 2) area, where n is the number of nodes in the ring cover. These drawings are clear and easy to understand by the network designers.


  1. 1.
    G. Di Battista, P. Eades, R. Tamassia and I.G. Tollis. “Algorithms for Automatic Graph Drawing: An Annotated Bibliography,” Department of computer Science, Brown University, Technical Report, 1993.Google Scholar
  2. 2.
    G. Di Battista, E. Pietrosanti, R. Tamassia, and I.G. Tollis, “Automatic Layout of PERT Diagrams with XPERT, ” Proc. IEEE Workshop on Visual Languages (VL’89).Google Scholar
  3. 3.
    C. Batini, E. Nardelli, and R. Tamassia, “ A Layout Algorithm for Data Flow Diagrams”. IEEE Trans Software Eng., vol. 12 1986.Google Scholar
  4. 4.
    C. Batini, M. Talamo, and R. Tamassia, “Computer Aided Layout of Entity-Relationships Diagrams” The Journal of Systems and Software, vol. 4, 1984.Google Scholar
  5. 5.
    J. C. Shah, “ Restoration Network Planning Tool ”, Proc. 8th Annual Fiber Optic Engineers Conf. April 21, 1992.Google Scholar
  6. 6.
    W. D. Grover, B.D. Venables, J.H. Sandham, and A.F. Milne, “Performance Studies of a Self-Healing Network Protocol in Telecom Canada Long Haul Networks” Proceedings of IEEE GLOBECOM 1990.Google Scholar
  7. 7.
    H. Sakauchi, Y. Nishimura, and S. Hasegawa, “ A Self-Healing Network with an economical Spare-Channel Assignment ” IEEE GLOBECOM 1990.Google Scholar
  8. 8.
    Tsong-Ho Wu and R. C. Lau, “ A Class of Self-Healing Ring Architectures for SONET Network Application ” IEEE Trans. on Communication, Vol. 40, No. 11 Nov. 1992.Google Scholar
  9. 9.
    T. H. Wu, D.J. Collar, and R.H. Cardwell, “Survivable Network Architectures for Broadband Fiber Optic Networks: Model and Performance Comparison” IEEE journal of Lightwave. Technology, Vol. 6, No. 11, November 1988.Google Scholar
  10. 10.
    L. M. Gardner, M. Heydari, J. Shah, I.H. Sudborough, I.G. Tollis, and C. Xia, “Techniques for Finding Ring Covers in Survivable Networks” Proceedings of IEEE GLOBECOM 1994.Google Scholar
  11. 11.
    Ioannis G. Tollis and Chunliang Xia. “Drawing Telecommunication Networks”. DIMACS International Workshop, Graph Drawing’94. Princeton, New Jersey, USA, October 1994. Proceedings.Google Scholar
  12. 12.
    Ioannis G. Tollis and Chunliang Xia. “Graph drawing algorithms for the design and analysis of telecommunication networks”. Graph Drawing’93, Proceedings of the ALCOM International workshop on graph drawing Sèvres France.Google Scholar
  13. 13.
    Ala Eddine Barouni, Ali Jaoua and Nejib Zaguia. “Drawing Algorithms for telecommunication networks”. In 3rd CGC workshop on Computational Geometry. Brown University, Providence, RI, USA. October 1998.Google Scholar
  14. 14.
    Ala Eddine Barouni, Ali Jaoua and Nejib Zaguia. “Planar Drawing Algorithms of survivable telecommunication networks”. In Proceedings of the Japan Conference on Discrete and Computational Geometry. Tokai University, Japan. December 1998.Google Scholar
  15. 15.
    Ala Eddine. Barouni “Drawing Algorithm for survivable telecommunication networks”, Master Theses at the university of Ottawa Canada. April 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Ala Eddine Barouni
    • 1
  • Ali Jaoua
    • 2
  • Nejib Zaguia
    • 3
  1. 1.department of computer scienceUniversity of TunisTunisia
  2. 2.department of computer scienceKing Fahd University of Petroleum and MineralsDhahranArabie Saoudia
  3. 3.School of Information Technology and EngineeringOttawaCanada

Personalised recommendations