In my thesis, I have implemented a graph partitioning heuristic in IMUNES system. IMUNES is a program for network emulation/simu­lation. Since network emulation and simulation are computationally very intensive, a method for dividing the computational load between distributed processors, in a way that minimizes interprocessor communication, is required. The emulation in IMUNES is represented as graph nodes interconnected with links, so the problem of dividing the computational load between processors is reduced to dividing the nodes and edges of the graph, called graph partitioning. After...