Routing

Applied sciences
Computer engineering
Computer networks
Internet protocol suite

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (31)

Bellman Ford: Shortest Paths

Introduces the Bellman-Ford algorithm for finding shortest paths in directed graphs with edge weights.

Bellman-Ford Algorithm: Analysis and Correctness

Explores the Bellman-Ford algorithm, its correctness, and practical applications in dynamic networks and real-world scenarios.

Content Distribution Networks

Explores the evolution and challenges of Content Distribution Networks, proposing innovative solutions for efficient content distribution.

Network Protocols: Basics and Security

Introduces network protocols, routing, security vulnerabilities, dynamic web content, and the deep/dark web.

Semicustom RTL Design: Backend

Explores the backend design flow in semicustom ASIC design, covering layout, clock tree generation, and tapeout preparation.

Distributed Memory

Covers distributed memory systems, cache organization, multi-socket architectures, memory coherence, and on-chip interconnect design.

CMOS Circuit Design: Layout Optimization

Covers layout optimization techniques for CMOS circuit design, including common-centroid layout, MOSFET sizing, gain simulation, and performance analysis.

Ad-Hoc Networks: Routing and DHTs

Explores peer-to-peer networks, ad-hoc routing, and distributed hash tables.

Physarum can compute shortest paths

Explores how Physarum Polycephalum can compute shortest paths in a directed graph model.

Networking Energy Consumption: Optimization for Energy-Proportional Traffic Routing

Addresses internet energy consumption challenges and proposes energy-proportional traffic routing solutions for optimal network efficiency.

Gossip Techniques: Reliability and Efficiency

Covers gossip techniques for efficient and reliable communication in networks.

Page 2 of 2