Week13 lec1
RIP ( Routing Information Protocol) RFC 1058 and 1723 Included in BSD UNIX in 1982 Distance vector algorithm Distance metric: number of hops (max = 15.
New Timing Distribution Mechanism TICTOC WG, IETF 71th Philadelphia, USA draft-ji-tictoc-new-timing-distribution-mechanism-00.txt Kuiwen Ji ([email protected])
Using Telephone and Cable Networks for Data Transmissions 01204325: Data Communication and Computer Networks Asst. Prof. Chaiporn Jaikaeo, Ph.D. [email protected].
Network Layer (Routing)
ppt
ccn2001-slides5b
Introduction to Networking Project 3. Routing Graph abstraction for routing algorithms: graph nodes are routers graph edges are physical links link.
Introduction 1 Lecture 19 Network Layer (Routing Algorithms) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science.
Chapter 4 Network Layer slides are modified from J. Kurose & K. Ross CPE 400 / 600 Computer Communication Networks Lecture 19.
Routing - I Important concepts: link state based routing, distance vector based routing.
1 Circuit Switching Reading: 3.1.2, 3.3, 4.5, and 6.5 COS 461: Computer Networks Spring 2008 (MW 1:30-2:50 in COS 105) Jennifer Rexford Teaching Assistants:
