Lectures notes for 2010 - KTH
Lectures notes for 2010 - KTH Lectures notes for 2010 - KTH
Routing Metrics A measure of which route is better than another: • Number of hops • Bandwidth • Delay • Cost • Load • … It is possible that the metric uses some weighted combination of the above. Maguire Routing Metrics 7: 9 of 70 maguire@kth.se 2010.03.21 Internetworking/Internetteknik
Routing Algorithms • Static vs. Dynamic • Single path vs. Multi-path • Flat vs. Hierarchical • Host-intelligent vs. Router-intelligent • Intradomain (interior) vs. Interdomain (exterior) • Link state vs. Distance vector Issues: • Initialization (how to get started) • Sharing • Updating • When to share & Who to share with Maguire Routing Algorithms 7: 10 of 70 maguire@kth.se 2010.03.21 Internetworking/Internetteknik
- Page 385 and 386: Transport layer protocols • User
- 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: Autonomous systems (ASs) - RFC1930
- Page 439 and 440: Routing Information Protocol (RIP)
- 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
Routing Algorithms<br />
• Static vs. Dynamic<br />
• Single path vs. Multi-path<br />
• Flat vs. Hierarchical<br />
• Host-intelligent vs. Router-intelligent<br />
• Intradomain (interior) vs. Interdomain (exterior)<br />
• Link state vs. Distance vector<br />
Issues:<br />
• Initialization (how to get started)<br />
• Sharing<br />
• Updating<br />
• When to share & Who to share with<br />
Maguire Routing Algorithms 7: 10 of 70<br />
maguire@kth.se <strong>2010</strong>.03.21 Internetworking/Internetteknik
Change language