Messages routing over a network is one of the most fundamental concept in communication which requires simultaneous transmission of messages from a source to a destination. In terms of Real-Time Routing, it refers to the addition of a timing constraint in which messages should be received within a specified time delay. This study involves Scheduling, Algorithm Design and Graph Theory which are essential parts of the Computer Science (CS) discipline. Our goal is to investigate an innovative and efficient way to present these concepts in the context of CS Education. In this paper, we will explore the fundamental modelling of routing real-time messages on networks. We study whether it is possible to have an optimal on-line algorithm for the Arbitrary Directed Graph network topology. In addition, we will examine the message routing’s algorithmic complexity by breaking down the complex mathematical proofs into concrete, visual examples. Next, we explore the Unidirectional Ring topology in finding the transmission’s “makespan”.Lastly, we propose the same network modelling through the technique of Kinesthetic Learning Activity (KLA). We will analyse the data collected and present the results in a case study to evaluate the effectiveness of the KLA approach compared to the traditional teaching method.