Congestion aware multipath routing: performance improvements in core networks

In this paper the improved Congestion Aware Multipath Routing algorithm is analysed in terms of Core network throughput and longer paths contribution. The algorithm discovers unused network resources and dynamically adapts to the actual traffic load and available resources displacement. Several simulation scenarios have been benchmarked in order to verify algorithm in typical Internet Service Provider cases. Simulation scenarios in this paper are focused on verifying functionality in dense core networks. For this purpose, tests were performed on TeraStream based network – the Deutsche Telekom Group design concept. Simulation results have proven better performance and resource utilization of the proposed algorithm than traditional Bellman-Ford based algorithms and equal cost multipath approaches

Impact of game-based learning on STEM learning and motivation: Two case studies in Europe

The number of science, technology, engineering, and mathematics (STEM)-related jobs is increasing all around the world and especially in Europe. However, teachers face many difficulties in making STEM related classes more attractive and motivating the students to learn. This paper presents two case studies involving 116 students from two European countries (Slovakia and Ireland). The studies investigated the impact of a new educational computer game called Final Frontier on learning process and students’ motivation. We found that there are no significant differences between the two countries in terms of students’ interest in STEM, although the students in Slovakia achieved slightly better grades than those in Ireland. We also found that in both countries, the students using the Final Frontier game outperformed those not using the game in improving their subject knowledge after the study. Furthermore, the impact of game-based learning on students’ motivation for STEM differed in the two countries

Average Bandwidth Allocation Model of WFQ

We present a new iterative method for the calculation of average bandwidth assignment to traffic flows using a WFQ scheduler in IP based NGN networks. The bandwidth assignment calculation is based on the link speed, assigned weights, arrival rate, and average packet length or input rate of the traffic flows. We prove the model outcome with examples and simulation results using NS2 simulator

Class-Based Constraint-Based Routing with Implemented Fuzzy Logic in MPLS-TE Networks

The paper deals with constraint-based routing (CBR) in MPLS-TE networks and proposes a new CBR algorithm based on fuzzy logic called Fuzzy Class-Based Algorithm (FCBA). Multiprotocol label switching with traffic engineering (MPLS-TE) networks represent a popular mechanism to effectively use resources of service providers’ core networks. The paths can be either built by administrators (explicit routing) or built by using existing routing algorithms which mostly decide based on the shortest paths towards the destination which might not be sufficient in nowadays’ multimedia networks. To address this problem various CBR algorithms have emerged which take into consideration various aspects important to existing traffic like QoS parameters or administrative policies. FCBA makes routing decisions based on traffic classes and by using fuzzy logic we can assign normalized values to various constraints based on the traffic class’ preferences (e.g., low delay paths for voice traffic) and network administrator’s preferences (e.g., avoiding congested links). The paper provides comparison of FCBA with existing CBR approaches based on their ability to provide QoS parameters loss. The simulations show that FCBA provides the best results for the highest priority traffic where it uses lower priority traffic to efficiently utilize the network