Meta
-
Recent Comments
-
Recent Posts
Tags
administrative aspects announcement ARQ Assignment Assignments autonomous systems BGP botnet circuit switching congestion control connect delay DHT DNS email Ethernet Final exam gethostbyname gethostname getsockname Go-back-N Hubs Internet checksum Internet topology Kaminski bug lecture Lectures Midterm multiplexing net neutrality Network Programming NQH's implementation P2P packet switching Peering programming Projects Recitation Routing protocols security selective repeat smtp TCP udp welcomeArchives
Blogroll
History and philosophy
IPv6
Major networking organizations
Network Programming
Similar courses & introductory materials
System Programming
- GNU Make Manual
- IA32 Intel Architecture Software Developer's Manual, Volume 1: Basic Architecture
- IA32 Intel Architecture Software Developer's Manual, Volume 2: Instruction Set Reference Manual
- IA32 Intel Architecture Software Developer's Manual, Volume 3: System Programming Guide
- Tool Interface Standard (TIS) Executable and Linking Format (ELF) Specification
- Using as, the GNU Assembler
Tag Archives: Routing protocols
Internet Routing Protocols
Hierarchical routing is employed on the Internet. Roughly, autonomous systems (AS) can run their separate routing protocols (interior gateway protocols – IGP, or intra-domain routing protocols), and talk to each other using an exterior gateway protocol (EGP, also called inter-domain … Continue reading
Routing algorithms and protocols
Routing refers to the task of finding and maintaining (shortest) paths in networks. Routing protocols are typically built based on two basic shortest-path algorithms: Dijkstra and Bellman-Ford. Networks are viewed as directed graphs. Nodes correspond to routers. Edges represent (direct) … Continue reading