Lectures notes for 2010 - KTH
Lectures notes for 2010 - KTH Lectures notes for 2010 - KTH
Heartbeat and ACK Frame x … Source port: 9 Destination port: 38763 Verification tag: 0x36fab554 Checksum: 0x0e6c8d88 (incorrect Adler32, should be 0xf5340ec5) HEARTBEAT chunk (Information: 28 bytes) Chunk type: HEARTBEAT (4) Chunk flags: 0x00 Chunk length: 32 Heartbeat info parameter (Information: 24 bytes) Parameter type: Heartbeat info (0x0001) Parameter length: 28 Heartbeat information: 0280351E00000000E1A06CFBC1C6933F... Source port: 38763 Destination port: 9 Verification tag: 0x57c3a50c Checksum: 0xaa2fba80 (incorrect Adler32, should be 0xe7450e58) HEARTBEAT_ACK chunk (Information: 28 bytes) Chunk type: HEARTBEAT_ACK (5) Chunk flags: 0x00 Chunk length: 32 Heartbeat info parameter (Information: 24 bytes) Parameter type: Heartbeat info (0x0001) Parameter length: 28 Heartbeat information: 0280351E00000000E1A06CFBC1C6933F... Maguire Heartbeat and ACK 6: 33 of 44 maguire@kth.se 2010.03.21 Internetworking/Internetteknik
Differences from TCP Congestion Control • Any DATA chunk that has been acknowledged by SACK, including DATA that arrived out of order, are only considered fully delivered when the Cumulative TSN Ack Point passes the TSN of the DATA chunk ⇒ cwnd controls the amount of outstanding data, rather than (as in the case of non-SACK TCP) the upper bound between the highest acknowledged sequence number and the latest DATA chunk that can be sent within the congestion window ⇒ different fast-retransmit & fast-recovery than non-SACK TCP • Retransmission based on both retransmission timer (with an RTO per path) • Three SACKS (i.e., 4 consecutive duplicate SACKs indicating missing chunks) • immediate retransmission of these missing chunks Sender • uses the same destination address until instructed by the upper layer (however, SCTP may change to an alternate destination in the event an address is marked inactive) ⇒ retransmission can be to a different transport address than the original transmission. • keeps separate congestion control parameters (cwnd, ssthresh, and partial_bytes_acked) for each of the destination addresses it can send to (i.e., not each source-destination pair) – these parameters should decay if the address is not used – does slow-start upon the first transmission to each of destination addresses Maguire Differences from TCP Congestion Control 6: 34 of 44 maguire@kth.se 2010.03.21 Internetworking/Internetteknik
- Page 365 and 366: NFSspy Insert a new pointer in plac
- Page 367 and 368: nfsspy Initial implementations were
- Page 369 and 370: Often there are multiple NFS client
- Page 371 and 372: NFS Mount protocol Server can check
- Page 373 and 374: NFS over TCP Provided by some vendo
- Page 375 and 376: X Window System • Client-server a
- Page 377 and 378: X was optimized for use across LANs
- Page 379 and 380: Additional tools for watching TCP P
- Page 381 and 382: Transaction TCP (T/TCP) Piggyback a
- Page 383 and 384: References [1] Information Sciences
- 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: HEARTBEAT and HEARTBEAT ACK Chunks
- 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 and 438: Routing Algorithms • Static vs. D
- 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
Differences from TCP Congestion Control<br />
• Any DATA chunk that has been acknowledged by SACK, including<br />
DATA that arrived out of order, are only considered fully delivered when<br />
the Cumulative TSN Ack Point passes the TSN of the DATA chunk<br />
⇒ cwnd controls the amount of outstanding data, rather than (as in the case of<br />
non-SACK TCP) the upper bound between the highest acknowledged sequence<br />
number and the latest DATA chunk that can be sent within the congestion window<br />
⇒ different fast-retransmit & fast-recovery than non-SACK TCP<br />
• Retransmission based on both retransmission timer (with an RTO per path)<br />
• Three SACKS (i.e., 4 consecutive duplicate SACKs indicating missing chunks) • immediate<br />
retransmission of these missing chunks<br />
Sender<br />
• uses the same destination address until instructed by the upper layer (however, SCTP may<br />
change to an alternate destination in the event an address is marked inactive) ⇒<br />
retransmission can be to a different transport address than the original transmission.<br />
• keeps separate congestion control parameters (cwnd, ssthresh, and partial_bytes_acked)<br />
<strong>for</strong> each of the destination addresses it can send to (i.e., not each source-destination pair)<br />
– these parameters should decay if the address is not used<br />
– does slow-start upon the first transmission to each of destination addresses<br />
Maguire Differences from TCP Congestion Control 6: 34 of 44<br />
maguire@kth.se <strong>2010</strong>.03.21 Internetworking/Internetteknik