All Notes
All Notes
R4. Why are the terms client and server still used in peer-to-peer applications?
R6. What is the role of HTTP in a network application? What other components
are needed to complete a Web application?
R7. Referring to Figure 2.4, we see that none of the applications listed in Figure
2.4 requires both no data loss and timing. Can you conceive of an application
that requires no data loss and that is also highly time-sensitive?
R8. List the four broad classes of services that a transport protocol can
provide. For each of the service classes, indicate if either UDP or TCP (or
both) provides such a service.
R9. Recall that TCP can be enhanced with SSL to provide process-to-process
security services, including encryption. Does SSL operate at the transport layer
or the application layer? If the application developer wants TCP to be enhanced
with SSL, what does the developer have to do?
Transport Layer
TCP & UDP
• What happens when RTT increases?
• WHY UDP doesn’t have sender buffer?
• Why random starting seq number?
• Why congestion control at transport layer?
• RTT Estimation Ceveats: Too small vs too large? AND SOLUTION?
• How to compute timeout in TCP?
• How TCP handle RTT estimation for cumulative ACKs?
• TCP retransmission scenarios
• Why timed wait after server to client FIN and why timed wait at client
• 2-way handshake failure scenarios
Multiplexing and De- Multiplexing
TCP: Receiver Buffer
TCP CONGESTION CONTROL
• Congestion collapse and its causes
• Where to prevent collapse?
• Congestion control: TCP vs UDP competing flows scenario
• TCP: Congestion Control problems and solution in context of packet
conservation
• TCP self clocking mechanism
• TCP TAHOE, RENO, NEW RENO, BIC, CUBIC, VEGAS, BBR,
COMPOUND
• NDP protocol
• TCP Fairness
• TCP: Detecting and reacting to loss
TCP CONGESTION
CONTROL
TCP CONGESTION
CONTROL
UDP
120
Gbps
100
TCP Gbps
COLLISION DOMAIN?
BROADCAST DOMAIN?
Compute Routing, Forwarding Table and
SHORTEST PATH TREE
Routing Algorithms
+ Good news and Bad news in bellman ford
+ Possible issues with Dijkstra’s algorithm and solution
+ Route updates in Bellman-ford algorithm
+ Comparison of LS and DV Algorithms (Robustness, Message Complexity and Speed of convergence)
+ RIP: Table processing
+ RIP: Failure and recovery
+ RIP: Avoid “count-to-infinity” problem
+ OSPF Operation Stages and Packet types
+ OSPF LSA Database exchange and synchronization and syncing method
+ OSPF Minimize magnitude of update LSA (reduce dup LSA)
+ Hierarchical Routing in OSPF
+ AREA PARTITIONs in Hierarchical Routing in OSPF
+ OSPF: Advanced features
Bellman ford example
BGP
BGP- Video I
• Why BGP is defacto standard in internet?
• Why BGP is distance vector?
• Why not BGP is link state?
• Policies with BGP (2x2)
• Customers vs Peers routing table exchange
• Which route to prefer Peering vs Provider?
• Benefits/Uses of path vector?
• BGP messages (4)
BGP route advertisements
BGP: Transit Vs Non-Transit
BGP- Video II
• Important attributes (2)
• BGP route processing
• Where policies are applied in BGP when processing routes?
• BGP elimination rules
NEXT BEST HOP ATTRIBUTE: HOT
POTATO ROUTING
Multihoming and Load-balancing with BGP
iBGP – VIDEO IV
• Why iBGP peer will not advertise a route learned by one iBGP peer to
another iBGP peer?
• N border routers means N(N-1)/2 peering sessions – this does not
scale -> Currently three solutions
• BGP Link failures Types?
• failures are completely different in BGP. Why?
• How to ensure no policy conflicts: Strawman proposal
• Gao and Rexford Scheme
• Why different Intra-, Inter-AS routing ? Policy, Scale, Performance
BGP Link failures
BGP Link failures
BGP Convergence
BGP Convergence
BGP Policies
BGP Policies
DATA-LINK
LAYER
ANYCAST / ROUTER
ARCHITECTURE
• Unicast/Multicast/Anycast
• CDN load balancing using DNS CNAME vs Anycast
• IP Anycast: BGP
• Challenges with IP Anycast
• EDNS Client Subnet
• RIB (Routing Information Base)
• Input port functions
• Switching fabrics
• Output ports
• Input port queuing
• Data link layer services
• Error detection and correction techniques
• Multiple Access Protocols
• An ideal multiple access protocol?
• Multiple Access Protocols Categories and techniques
ANYCAST / ROUTER
ARCHITECTURE
DATA LINK LAYER
• IP vs MAC Address
• ARP Table Soft state or Hard state?
• How to determine the MAC address of B knowing B’s IPv4 address?
• How to determine MAC address of B knowing B’s IPv6 address?
• Ethernet: Physical topology
• Ethernet: Unreliable, connectionless
• Hub Vs Switch Vs Router
• Switch: Self-learning
• How router restrict broadcast storms?
COLLISION DOMAINS
PUTTING IT ALL TOGETHER
Multimedia/ VoIP/
DataCenter/ SDN
Multimedia(REMINDER: ASK
MAHNOOR TO DRAW TOPOLOGIES)
• Audio/Video/ Video coding/ Video bit rates
• Delay jitter
• P4: Goals
• SIP Services
• What and where IGMP is? And what about multicast addressing?
State
• Separation of control and data
• HTTP: in-band signaling
• FTP: out-of-band signaling, RSVP (signaling) separate from routing, forwarding.
• State definition?
• State: Sender, receiver
• Hard state and its assumption
• Soft state and its assumption
• Soft state vs hard state comparison
• Q: How to set Soft-State’s refresh/timeout timers ?
• Effect state lifetime on consistency of state on multiple nodes?
RSVP
• RSVP
• Reservation msgs
• Path msgs
• RSVP: Soft-state
• Overlay Networks
• VPN architectures x 3
• Tunnelling