Last Minute Notes – Computer Networks



See Last Minute Notes on all subjects here.

  1. Class Full Addressing Table

  2. Flow Control
    N = Sender’s Window Size. (in SR both sender and receiver window are same)
    a = Tp/Tt

  3. Sequence No. >= (Sender’s Window Size) + (Reciever’s Window Size )
  4. Efficiency in TDM(polling) = Tt/(Tpoll + Tt+ Tp)
  5. In CSMA/CD
    Tt >= 2*Tp



    Hence, min frame length = 2*Tp*B

  6. CSMA/CD

    Efficiency = 1/(1 + 6.44a)

  7. N = No. of stations
    Early Token Reinsertion : Efficiency = 1/(1 + a/N)
    Delayed Token Reinsertion : Efficiency = 1/(1 + (N+1)a/N)
  8. Pure Aloha Efficiency = 18.4 %
    Slotted Aloha Efficiency = 36.8%
  9. Layers and there uses

  10. Difference between DVR and LSR

  11. In TCP congestion control Algorithm
    When Time Out Occurs Algorithm Enters Slow Start Phase
    When 3 Duplicate occurs algorithm enters congestion avoidance phase
  12. Network Security
    For Symmetric Key : n*(n-1)/2 keys are required.
    For Public Key : 2*n key are required ( each node will have private and public key).
    Deffie Hellman Key Exchange
    R1 = gx mod p
    R2 = gy mod q
    Both will have same key = gxy mod p.



    My Personal Notes arrow_drop_up

    Recommended Posts:



    Article Tags :
    Computer Networks
    GATE CS
    Practice Tags :
    Computer Networks


    2


    3.3

    Based on 12 vote(s)
    Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.