Computer networks
Web-based animation of data structures using JAWAA
SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
A system for program visualization in the classroom
SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
SIGCSE '98 Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education
Testers and visualizers for teaching data structures
SIGCSE '99 The proceedings of the thirtieth SIGCSE technical symposium on Computer science education
Local and Metropolitan Area Networks
Local and Metropolitan Area Networks
Simulation of Local Area Networks
Simulation of Local Area Networks
| Hi-index | 0.00 |
To overcome the difficulty of learning network protocols by examining the algorithms or examples, a tool has been designed and partially implemented under which the algorithms can be visualized and investigated. For instance, students can construct a network topology that consists of a set of nodes and links by clicking the mouse on the screen. Attributes may be specified to constrain the behavior of individual nodes, such as the rate at which packets are transmitted. For each link, the cost of delivering data frames along that link may be specified, together with the likelihood and extent of packet loss, corruption and delay. Each possibility may be specified using standard statistical distributions. By altering the positions of network nodes and links, a number of different aspects of routing algorithms may be highlighted. The nodes may be overwhelmed and links may be congested, enabling different routing algorithms to be investigated. In addition to the visualization of protocols, the tool also provides capabilities for statically analyzing the protocols without animating the algorithms. The static analysis facilitates the students to observe the strengths, weaknesses, and limitations of the protocols. The computer networks course is an integration of network design and protocols with practical hands-on experience. This paper describes the tool itself, as well as the experiences gained in using the tool. We illustrate the use of the tool with the visualization of the Dijkstra's shortest path algorithm for finding a shortest path in a network topology and the analysis of the algorithm to pinpoint the problems of this algorithm.