![Outline ,[object Object]](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
More Related Content
What's hot
What's hot (20)
Similar to Congestion Control in Computer Networks - ATM and TCP
Similar to Congestion Control in Computer Networks - ATM and TCP (20)
Recently uploaded
Recently uploaded (20)
Congestion Control in Computer Networks - ATM and TCP
- 1. Congestion Control in Networks ATM and TCP Balazs Attila-Mihaly
- 7. TCP
- 8. TCP – Congestion Control
- 9. TCP – CC evaluation
- 10. Bibliography
- 13. Queuing delay
- 14. Jitter
- 15. Low troughput
- 20. Flow control (speed matching)
- 21. QoS routing
- 26. Flow control (speed matching)
- 28. avoidance
- 29. recovery
- 32. Min + Equal share
- 33. Maximum of the previous too
- 34. Allocation proportional with Min
- 36. Implementability
- 38. Fixed sized cells (53 bytes – 48 byte of data)
- 40. PCR – Peak Cell Rate
- 41. SCR – Sustained Cell Rate
- 42. MBR – Maximum Burst Size
- 43. MCR – Minimum Cell Rate
- 45. CDV – Cell Delay Variation (peak-to-peak / instant.)
- 47. rt-VBR – Real-Time Variable Bit Rate
- 48. nrt-VBR – Non-Real-Time Variable Bit Rate
- 49. UBR – Unspecified Bit Rate
- 50. ABR – Available Bit Rate
- 52. I – Increment
- 53. L - Limit Cell arrival at t t <= TAT TAT = t t+L < TAT Conforming cell TAT = TAT + I Non-conforming cell
- 55. Closed loop, Rate based, Binary & Explicit feedback and Queue growth rate based CC
- 57. BN – Backward Notification
- 58. CI – Congestion Indication
- 59. NI – No Increase
- 62. Considered out of band cells
- 63. Can be sent by the intermediate switches
- 64. Tagged packets (CLP) can be dropped at intermediate switches if a treshold is hit
- 66. Each switch can control the flow
- 71. Flow multiplexing with source/destination ports
- 73. Windowing
- 75. Not part of the original spec
- 76. As a result in 1986 NSFnet capacity dropped more than 800 (!!!) times
- 77. Only reactive – needs to respect the ”smart endpoints – dumb network” principle
- 78. There are alternatives (SACK, RVSP, etc)
- 80. Slow start
- 81. Fast retransmit and recovery
- 84. It's reactive
- 85. It actually relies on congestion happening to detect the link speed (for slow start)
- 86. It assumes that all packed loss is due to congestion
- 88. Jagannathan Sarangapani – Wireless, Ad Hoc and Senso Networks – Protocol, Performance and Control
- 89. Steve Sjoquist, Andrew Tucker – Comparison of ATM and TCP Congestion Control
- 91. Thank you