Abstract
The design and analysis of cost effective survivable telecommunication networks is a very important problem. We study techniques for visualizing survivable telecommunication networks. The visualization of telecommunication networks is very useful in aiding the design process of minimum cost networks and the management of network operations. We present several linear time algorithms for drawing telecommunication networks (with optimal area) so that important properties are displayed. Given a ring cover of a network, our algorithms display it in such a way that rings are easily identifiable and possible problems can be spotted by network designers.
Chapter PDF
Similar content being viewed by others
References
G. Di Battista,P. Eades, R. Tamassia and I. G. Tollis, ”Algorithms for Automatic Graph Drawing: An Annotated Bibliography,” Dept. of Comp. Science, Brown Univ., Technical Report, 1993. To appear in Comput. Geom. Theory Appl. Preliminary version available via anonymous ftp from wilma.cs.brown.edu(128.148.33.66), files /pub/gdbiblio.tex.Z and /pub/gdbiblio.ps.Z.
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), pp. 171–176, 1989.
G.R. Dattatreya, J.P. Fonseka, K. Kiasaleh, I.H. Sudborough, I.G. Tollis, and S. Venkatesan, “Advanced Network Topologies for Network Survivability,” Technical Report, UTD, January 1993.
M.R. Garey and D.S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness”, Freeman, 1979.
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, to appear.
W.D. Grover, B.D. Venables, J.H. Sandham, and A.F. Milne, ”Performance Studies of a Slef-Healing Network Protocol in Telecom Canada Long Haul Networks,” Proceedings of IEEE GLOBECOM 1990, pp. 403.3.1–403.3.7.
G. Kar, B. Madden and R. S. Gilbert, “Heuristic layout Algorithms for Network Management Presentation Services” IEEE Network, November, 1988.
Y. Lin and S. Skiena, ”Complexity aspects of visibility graphs” Technical Report 92/08 SUNY Stony Brook, 1992.
H. Sakauchi, Y. Nishimura, and S. Hasegawa, ”A Self-Healing Network with an economical Spare-Channel Assignment,” IEEE GLOBECOM 1990, pp. 403.1.1–403.1.6.
J. C. Shah, ”Restoration Network Planning Tool”, Proc. 8th Annual Fiber Optic Engineers Conf. April 21, 1992.
T.H. Wu, D.J. Collar, and R.H. Cardwell, “Survivable Network Architectures for Broadband Fiber Optic Networks: Model and Performance Comparisons,” IEEE Journal of Lightwave Technology, Vol. 6, No. 11, November 1988, pp. 1698–1709.
Tsong-Ho Wu and R. C. Lau, ”A Class of Self-Healing Ring Architectures for SONET Network Applications, IEEE Trans. on Communication, Vol. 40, No. 11, Nov. 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tollis, I.G., Xia, C. (1995). Drawing telecommunication networks. In: Tamassia, R., Tollis, I.G. (eds) Graph Drawing. GD 1994. Lecture Notes in Computer Science, vol 894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58950-3_372
Download citation
DOI: https://doi.org/10.1007/3-540-58950-3_372
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58950-1
Online ISBN: 978-3-540-49155-2
eBook Packages: Springer Book Archive