Lectures notes for 2010 - KTH
Lectures notes for 2010 - KTH Lectures notes for 2010 - KTH
Intradomain routing protocols also called “Interior Gateway protocols” Examples: • HELLO - an old IGP protocol • RIP - widely used • OSPF - increasingly used Routers that speak any dynamic routing protocol must speak RIP and OSPF. Maguire Intradomain routing protocols 7: 11 of 70 maguire@kth.se 2010.03.21 Internetworking/Internetteknik
Routing Information Protocol (RIP) version 1 RFC 1058 [2] {Note it was written years after the protocol was in wide use!} RIP is a distance-vector protocol - RIP messages contain a vector of hop counts. RIP messages are carried via UDP datagrams which are broadcast. 0 7 8 15 16 23 24 31 Command Version = 1 Reserved Family All 0s Network Address All 0s All 0s Distance Figure 3: RIP message format (see Forouzan figure 14.9 pg. 394) • a command: request or reply • a version number (in this case 1) • up to 25 instances (entries) containing: • address family (2 = IP addresses) • Network Address (allocated 14 bytes, for an IP address we only need 4 bytes - and they are aligned to a 4 byte boundary - hence the leading and trailing zeros) • metric [hop count] Maguire Routing Information Protocol (RIP) version 1 7: 12 of 70 maguire@kth.se 2010.03.21 Internetworking/Internetteknik
- Page 387 and 388: SCTP Applications • Initial goal
- Page 389 and 390: • Type SCTP Chunk 0 7 8 15 16 23
- Page 391 and 392: INIT Chunk 0 7 8 15 16 23 24 31 Typ
- Page 393 and 394: INIT ACK Chunk 0 7 8 15 16 23 24 31
- Page 395 and 396: COOKIE ECHO Chunk 0 7 8 15 16 23 24
- Page 397 and 398: Data Chunk 0 7 8 15 16 23 24 31 Typ
- Page 399 and 400: Selective Acknowledgement (SACK) Ch
- Page 401 and 402: Association Termination Two forms o
- Page 403 and 404: 0 7 8 15 16 23 24 31 Type = 14 Flag
- Page 405 and 406: ethereal capture - daytime - INIT F
- Page 407 and 408: ethereal capture - daytime - COOKIE
- Page 409 and 410: ethereal capture - daytime - DATA F
- Page 411 and 412: ethereal capture - daytime - SHUTDO
- Page 413 and 414: ethereal capture - daytime - SHUTDO
- Page 415 and 416: HEARTBEAT and HEARTBEAT ACK Chunks
- Page 417 and 418: Differences from TCP Congestion Con
- Page 419 and 420: 3 When retransmitting to a remote a
- Page 421 and 422: Forward Cumulative TSN Allows an en
- Page 423 and 424: SCTP Performance See the upcoming e
- Page 425 and 426: Summary This lecture we have discus
- Page 427 and 428: 2002 http://www.ietf.org/rfc/rfc330
- Page 429 and 430: • Dynamic Routing Protocols Outli
- Page 431 and 432: Routing Principles • Routing Mech
- Page 433 and 434: Processing Rouing daemon route comm
- Page 435 and 436: Autonomous systems (ASs) - RFC1930
- Page 437: Routing Algorithms • Static vs. D
- Page 441 and 442: When are routes sent? Solicited res
- Page 443 and 444: Count to Infinity C network 1 netwo
- Page 445 and 446: Triggered updates and Hold-Downs To
- Page 447 and 448: Why would anyone use RIP? After all
- Page 449 and 450: IGRP Metrics • a vector of metric
- Page 451 and 452: IGRP Default Gateway Rather than us
- Page 453 and 454: Open Shortest Path First (OSPF) OSP
- Page 455 and 456: OSPF building blocks 1. Hello proto
- Page 457 and 458: Hello packet 0 7 8 15 16 23 24 31 V
- Page 459 and 460: Link State Announcement (LSA) heade
- Page 461 and 462: Link state update packet 0 7 8 15 1
- Page 463 and 464: Link state acknowledgement packet 0
- Page 465 and 466: Exterior Gateway Protocol (EGP) an
- Page 467 and 468: Local vs. Transit traffic Local tra
- Page 469 and 470: BGP does not transmit metrics. Howe
- Page 471 and 472: Redistribution of Route Information
- Page 473 and 474: • Open • Update • Keepalive
- Page 475 and 476: BGP Update Message 0 7 8 15 16 23 2
- Page 477 and 478: BGP Notification Message 0 7 8 15 1
- Page 479 and 480: Federal Internet eXchange (FIX) A t
- Page 481 and 482: Global Internet eXchange (GIX) Glob
- Page 483 and 484: Network Access Points (NAPs) At the
- Page 485 and 486: Router Arbiter Project Router Arbit
- Page 487 and 488: Euro6IX The European IPv6 Internet
Routing In<strong>for</strong>mation Protocol (RIP) version 1<br />
RFC 1058 [2] {Note it was written years after the protocol was in wide use!}<br />
RIP is a distance-vector protocol - RIP messages contain a vector of hop counts.<br />
RIP messages are carried via UDP datagrams which are broadcast.<br />
0 7 8 15 16 23 24 31<br />
Command Version = 1 Reserved<br />
Family<br />
All 0s<br />
Network Address<br />
All 0s<br />
All 0s<br />
Distance<br />
Figure 3: RIP message <strong>for</strong>mat (see Forouzan figure 14.9 pg. 394)<br />
• a command: request or reply<br />
• a version number (in this case 1)<br />
• up to 25 instances (entries) containing:<br />
• address family (2 = IP addresses)<br />
• Network Address (allocated 14 bytes, <strong>for</strong> an IP address we only need 4 bytes - and they are<br />
aligned to a 4 byte boundary - hence the leading and trailing zeros)<br />
• metric [hop count]<br />
Maguire Routing In<strong>for</strong>mation Protocol (RIP) version 1 7: 12 of 70<br />
maguire@kth.se <strong>2010</strong>.03.21 Internetworking/Internetteknik
Change language