Advertisement
Advertisement

More Related Content

Advertisement

Recently uploaded(20)

Congestion Control in Computer Networks - ATM and TCP

  1. Congestion Control in Networks ATM and TCP Balazs Attila-Mihaly
  2. Myths about congestion
  3. Congestion control possibilities
  4. ATM – Vocabulary
  5. TCP
  6. TCP – Congestion Control
  7. TCP – CC evaluation
  8. Bibliography
  9. Queuing delay
  10. Jitter
  11. Low troughput
  12. Traffic access control
  13. Packet scheduling (prioritization)
  14. Buffer management
  15. Flow control (speed matching)
  16. QoS routing
  17. Traffic access control
  18. Packet scheduling (prioritization)
  19. Buffer management
  20. Flow control (speed matching)
  21. avoidance
  22. recovery
  23. Min + Equal share
  24. Maximum of the previous too
  25. Allocation proportional with Min
  26. Implementability
  27. Fixed sized cells (53 bytes – 48 byte of data)
  28. PCR – Peak Cell Rate
  29. SCR – Sustained Cell Rate
  30. MBR – Maximum Burst Size
  31. MCR – Minimum Cell Rate
  32. CDV – Cell Delay Variation (peak-to-peak / instant.)
  33. rt-VBR – Real-Time Variable Bit Rate
  34. nrt-VBR – Non-Real-Time Variable Bit Rate
  35. UBR – Unspecified Bit Rate
  36. ABR – Available Bit Rate
  37. I – Increment
  38. L - Limit Cell arrival at t t <= TAT TAT = t t+L < TAT Conforming cell TAT = TAT + I Non-conforming cell
  39. Closed loop, Rate based, Binary & Explicit feedback and Queue growth rate based CC
  40. BN – Backward Notification
  41. CI – Congestion Indication
  42. NI – No Increase
  43. Considered out of band cells
  44. Can be sent by the intermediate switches
  45. Tagged packets (CLP) can be dropped at intermediate switches if a treshold is hit
  46. Each switch can control the flow
  47. Needs ”smart-network”
  48. Three-way handshake
  49. Flow multiplexing with source/destination ports
  50. Positive acknowledgement
  51. Windowing
  52. Not part of the original spec
  53. As a result in 1986 NSFnet capacity dropped more than 800 (!!!) times
  54. Only reactive – needs to respect the ”smart endpoints – dumb network” principle
  55. There are alternatives (SACK, RVSP, etc)
  56. Slow start
  57. Fast retransmit and recovery
  58. It's reactive
  59. It actually relies on congestion happening to detect the link speed (for slow start)
  60. It assumes that all packed loss is due to congestion
  61. Jagannathan Sarangapani – Wireless, Ad Hoc and Senso Networks – Protocol, Performance and Control
  62. Steve Sjoquist, Andrew Tucker – Comparison of ATM and TCP Congestion Control
  63. http://www.cis.ohio-state.edu/~jain/cis788-95/atm_cong/index.html
  64. Thank you
Advertisement