routing-algorithms

CSC503: Computer Network [CN] & CSL502: Computer Network Lab [CN Lab] | TE Semester V | Computer Engineering

Karlsruhe Rapid Ride-Pooling (KaRRi) Dynamic Ride-Pooling Dispatcher.

Distributed dynamic indoor emergency guidance proof of concept with local routing, real-time rerouting and 3D visualization.

TravelPathOptimizer for trucking logistics is a software tool that boosts efficiency by determining optimal routes through algorithms. It accounts for traffic, weather, load, and timing, dynamically adjusting for delays. This reduces costs, ensures prompt deliveries, and enhances service, boosting trucking productivity and sustainability.

Python study: simulate urban traffic and compare routing algorithms (GPS) on a realistic network with lanes, signals, and congestion. Event-driven simulation, test matrix, fairness metrics.

Networking Labs using a large variety of protocols of every network layer.

The self-learning AI router that picks the best model, provider, and reasoning level for every request - beating OpenRouter Auto, LLMRouter, and Semantic Router, and matching RouteLLM accuracy at 65.1% lower measured cost in benchmarks.

Mit dem Fahrrad niemehr durch den Regen

A computational simulation engine predicting call blocking probabilities in 6G telecommunication networks using Roberts-Kaufman and RLA algorithms.

Simulatore di rete (.NET MAUI/Blazor) per ottimizzare il routing via Reinforcement Learning (ML.NET) vs Dijkstra. Tesi in Ingegneria Informatica.

A C++ Wireless Sensor Network (WSN) simulator comparing Multi-Hop (BFS) and LEACH protocols with interactive HTML dashboards and energy-consumption modeling.

Network protocol mechanisms built from scratch and measured: CRC-32 with quantified error-detection coverage, a connectionless UDP client/server, and Dijkstra vs Bellman-Ford routing. CS425, IIT Kanpur.

Real-city routing and visualization platform built on OpenStreetMap data, combining street-network rendering with graph-based pathfinding research.

Production Python patterns for spatial graph databases and network routing with Neo4j and Cypher — spatial indexing, pathfinding, OSM ingestion, and routing algorithms.

Optimizing vehicle routes for the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) reduces costs and improves logistics efficiency by generating synthetic datasets and using heuristic methods to design routes within capacity and time constraints.

Dynamic Network Routing Simulator implementing Distance Vector protocol in Java. Simulates packet routing, node failures, and network topology changes with real-time convergence visualization.

Испытательный стенд для исследования MANET-маршрутизации: физическая модель радиоканала (SINR, помехи, препятствия), подключаемые алгоритмы, детерминированные эксперименты. Rust, 9 крейтов, GPU-визуализация.

“SDN simulations with Mininet & Ryu: hub/learning switch, spanning tree, shortest path, and congestion-aware routing in Python.”

라우팅 혁명 게임