Speaking in terms of graph properties, computer networks are undirected graphs.
We suggest to represent Computer networks with orthogonal drawings, i.e., drawings in which the connections between symbols consist of horizontal and vertical segments only.
GAPI tutorial on orthogonal drawings and BLAG tutorial on orthogonal drawings provide a comprehensive guide on how to use GDT to construct these widely used drawings.
Examples of systems that use GDT for Computer network visualization are Hermes, Polyphemus, Almagestum, Spider and Reti.
The following figure shows an example of Computer network diagram constructed with Spider (courtesy of Abruscia, Palmieri, and Profidia).