IMPLEMENTING THE DISTRIBUTED BREADTH FIRST SEARCH ALGORITHM IN OMNET++ FOR TEACHING AND LEARNING PURPOSES

Esranur GALİP; Hasan BULUT

Article Details

IMPLEMENTING THE DISTRIBUTED BREADTH FIRST SEARCH ALGORITHM IN OMNET++ FOR TEACHING AND LEARNING PURPOSES

Authors:

Esranur GALİP | Hasan BULUT

Main Topics:

Sociology and anthropology

Journal:

The Eurasia Proceedings of Educational and Social Sciences 2016 Vol.5, pp.42-46

Document Type:

Article

Publication Date:

8/2016

Document Language:

Turkish

Document ID (Org No.):

2000658995

Abstract:

 


A distributed system is considered as a set of
computers communicating through the network and running collaboratively to
coordinate their activities and to share the resources of the system to achieve
a common goal. The coordination is achieved by exchanging messages, which carry
information. Distributed algorithms play a crucial role in this coordination.
However, teaching and learning distributed algorithms is difficult due to the
inherent complexities of the distributed system. Since it is costly to construct
a network of computers to run distributed algorithms to conduct research, teach
and learn, many commercial and freely available open source simulation tools
have been developed for simulating network systems and hence, distributed
systems. These tools facilitate the development of distributed algorithms for
different environments. One of these tools is OMNET++, which is a
component-based C++ simulation library and framework for building network
simulators and offers a graphical runtime environment.To facilitate the
understanding of the working mechanism, a distributed system can be modeled as
a graph. Each computer in the distributed system is represented by a vertex,
called node and a link between two computers is represented by an edge. Hereby,
many graph algorithms can be utilized within a distributed system. For
instance, traversal of computers (nodes) in a distributed system is important
and used for solving many problems. Many algorithms provide traversal of nodes.
In this study, we would like to demonstrate the use of a simulation tool for
teaching and learning one of the fundamental distributed graph algorithms
called Breadth First Search (BFS) algorithm. We use OMNET++ to visualize the
steps of constructing a BFS tree, where colors of edges are dynamically changed
to indicate the inner workings of the algorithm. In addition, a learner can
visually trace the flow of the messages between nodes in the simulation.

.

Article Details

IMPLEMENTING THE DISTRIBUTED BREADTH FIRST SEARCH ALGORITHM IN OMNET++ FOR TEACHING AND LEARNING PURPOSES

Authors: Esranur GALİP | Hasan BULUT

Main Topics: Sociology and anthropology

Journal: The Eurasia Proceedings of Educational and Social Sciences 2016 Vol.5, pp.42-46

Document Type: Article

Publication Date: 8/2016

Document Language: Turkish

Document ID (Org No.): 2000658995

Issues

Authors:

Esranur GALİP | Hasan BULUT

Main Topics:

Sociology and anthropology

Journal:

The Eurasia Proceedings of Educational and Social Sciences 2016 Vol.5, pp.42-46

Document Type:

Article

Publication Date:

8/2016

Document Language:

Turkish

Document ID (Org No.):

2000658995