Using an Instant Visual and Text Based Feedback_Tool to Teach Path Finding Algorithms A Concept

SEENG 2021 was held remotely as an integral component of the Joint Track on Software Engineering Education and Training (JSEET) at the 43rd IEEE/ACM International Conference on Software Engineering (ICSE).Methods of teaching path finding algorithms, based purely on programming, provide an additional challenge to stu- dents. Indeed many courses use graphs and other visualisations to aid students in grasping concepts quickly. Globally we are rapidly altering our teaching tools to suit the current blended or remote learning style due to the global COVID-19 pandemic. We propose a method that provides instant feedback showing how their programmed path finding algorithm works based upon games. The tool will provide feedback to the student about their code quality. Along with an element of gamification we aim to improve both initial understanding and further exploration into the algorithms taught. This tool aims to provide useful feedback to students in the absence of immediate laboratory support and gives students the flexibility to conduct laboratory worksheets outside of scheduled laboratory slots. Position: Software tools and teaching assistants heavily assist undergraduate students in learning how to program. In develop- ing enhanced software tools, we can provide immediate feedback to learners. Thus, allowing them to gain an initial understanding of the algorithm before facilitated sessions. This further enriches their experience and learning during contact hours with teaching assistants

Guaranteed Protection in Survivable WDM Mesh Networks - New ILP Formulations for Link Protection and Path Protection

In this paper we propose new simple integer linear programs (ILPs) formulations for minimizing capacity (in wavelength link) utilization in survivable WDM network. The study examines the performance of shared based protection schemes, such as path protection scheme and link protection scheme under single fiber failure. The numerical results obtained show a reduction in capacity utilization using random traffic compared to the reported ILP formulation. We also present the results using Poisson's traffic to identify the frequently used links for the widely used NSF network. The proposed work not only reduces the wavelength consumption in different traffic scenarios but also efficient in terms of simulation time

Performance Comparison of Protection Strategies in WDM Mesh Networks

Recent development in optical networking employing wavelength division multiplexing (WDM) fulfills the high bandwidth demand applications. Failure of such networks, leads to enormous data and revenue loss. Protection is one of the key techniques, which is used in designing survivable WDM networks. In this paper we compare dedicated and shared protection strategies employed inWDMmesh networks to protect optical networks failure, particularly fiber failure. Dijkstra's shortest path algorithm is considered for carrying out simulations. The paper compares the performance of protection schemes, such as, dedicated path protection (DPP), shared path protection (SPP) and shared link protection (SLP) schemes. Capacity utilization, switching time and blocking probability are the parameters considered to measure the performance of the protection schemes. Simulation results show that, SPP is more efficient in terms of capacity utilization over DPP and SLP schemes, whereas, SLP offered better switching time than both DPP and SPP schemes. The average call drop rate is minimum for shared path protection scheme and maximum for shared link protection scheme