Computer networks

IP Addressing: -
• Given to…?
• Hierarchy in IP addressing.
• Classful addressing
o Classes and prefix lengths of different classes.
o No. of networks and IP addresses in each network of different classes.
o Subnetting and super netting in classful addressing.
• Classless addressing
o Information needed from an IP address
▪ No of address in the network
▪ First and last address. (generally)
o Address mask
▪ How it is made.
▪ Finding above three using address mask. (using Boolean operators)
o Network address
o Block allocation
▪ Restriction on no of addresses requested.
▪ Restriction on the first address requested.
▪ Why divisibility rule (easy intuition, second by net-id finding using mask).
o Subnetting
▪ What you divide…? (Ip addresses present in the current network).
▪ Picture of net-id and subnet-id along with suffix.
▪ Why it is imp to have first address must be divisible by no of Ip addresses in
subnet.
▪ How to solve subnetting problems having different sizes of requests.
▪ After assigning check whether you are getting right broadcast address or
network id using mask.
▪ Subnet mask can have 1’s anywhere not necessarily at the starting.
o Super netting
▪ What to check after aggregating the networks…?
▪ What we should do if extra IP’S are there…?
o Special addresses
▪ This-host address. (0.0.0.0/32)
▪ Limited broadcast address. (255. 255. 255. 255/32)
▪ Loopback address. (127.0.0.0/8)
▪ Private addresses.
▪ Multi-cast addresses. (224.0.0.0/4)
o Forwarding of IP packets
▪ What are four columns in routing table…?
▪ Longest mask matching.
• Table is sorted according to prefix length in reverse order.
▪ Every interface or router will have its own IP address and it is present in
routing table and if matches, router sends over to that IP address of interface
got matched.
o No of hosts can be present in network having prefix of length n. (net-id, broadcast
address, interface id (considered as host only)).
o One interface is connected to one subnet only…?
Data Link Layer: -
• Switching
o What is switch
o Circuit switching
o Packet switching
o Datagram switching.
o Virtual circuit switching.
• Responsibilities of data link layer.
• Framing
o Fixing frame size vs Variable length frame size.
o Byte count.
o Byte stuffing.
o Bit stuffing.
• Error control
o What is the need.
o Types of errors.
o Repetition of frames.
o Parity.
o Hamming distance.
▪ Relation between hamming distance and error detection.
▪ Relation between hamming distance and error correction.
▪ Min hamming distance correct c bits and d bits of error
o Single error correction codes
▪ Basic idea
▪ Min no of parity bits required to correct single bit error.
▪ Hamming codes
• How error bit is founded. (shortcut & intuition).
o Cyclic redundancy check.
o Cyclic code analysis.
▪ Exor relation btw code word, received word and error.
▪ Error detection in CRC.
▪ Detecting single bit errors, double bit errors.
▪ Detection of odd no of bit errors.
o Checksum
• Flow control
o Few important terms
▪ Bandwidth
▪ Propagation and transmission delay
▪ Using last packet can be done in which situations…?
▪ How to check queuing delay while transferring packets via router.
o Simple ARQ protocol
▪ Why it is called ARQ
o Round trip time
▪ What is ambiguity here
o Max no of packets we can send in 1 RTT…?
o Can processing of packet done while transmitting another packet
o Stop and wait protocol
▪ Working
▪ How we give packets the sequence numbers
 ▪ Different cases in transmissions
▪ Efficiency and throughput
• Different ways to calculate throughput
o Sliding window protocol
▪ What’s the basic idea
▪ Another name
o Go back-N protocol
▪ Size of sender and receiver…?
▪ How many can be sent without acknowledgement
▪ When cumulative acknowledgment is sent by receiver
▪ What are types of acknowledgments and which type is used here…?
• What does ack x means…?
• In case of negative ack, what does ack x means…?
▪ Timer in GBN
• Why only for first packet
▪ How actually window slides in GBN
• Tell about packers in window, left and right to window
▪ What happens when packet is lost
▪ Difference between ack x and ack for x
o SR protocol
▪ Window sizes of sender and receiver
▪ Acknowledge type used
▪ What type of time out timer used here…?
▪ What happens when a packet is lost and when window slides here.
▪ Difference in usage of ack x in GBN vs SR
▪ If base sequence number at receiver is x, then sequence numbers possible at
sender is…?
▪ Is it possible for sender to receive the acknowledgment for the packet which
is present at out of window
▪ Efficiency in sliding window protocol
▪ Relationship between sequence number and window size
• Can we have two packets with same sequence number in window
• All ack lost case is important to understand this
• Media Access control
o Point to point vs broadcast medium
▪ Why channel is called broadcast link
▪ Examples for broadcast link-layer technologies
o Channel partitioning
▪ Time division multiplexing
▪ Frequency division multiplexing
o Turn taking
▪ Polling
▪ Token passing
o Random access protocols
▪ Why these protocols are important to learn…?
▪ ALOHA
• Usage of central node
• What are two channels used…?
• Which channel is free from collision and why…?
• When node send data and what happens if collision occurs…?
 • What is contention system
• How sender gets to know whether its packet is sent successfully or
collided…?
• When the collision can happen…?
• If a node transmits at time t, then range of time in which no other node
should send to avoid collision
o No one shouldn’t have started transmission and no new node
should start
• Vulnerable time in pure aloha
▪ Slotted aloha
• What are assumptions of slotted aloha
• Vulnerable time of slotted aloha
• Efficiency derivation (throughput, units…?)
o What is random variable X
o What is definition G
o Probability of sending k frames in one transmission time
o When we say slot is not wasted in slotted aloha
▪ What is prob (slot is not wasted) also refers to
▪ What is same as efficiency here
o What is probability (collision)
o When we say slot is wasted
o Throughput of slotted aloha formula and what can be max
throughput (what is value of G to achieve max throughput)
o Is prob to get success is p, then avg no of trails to get success
▪ CSMA/CD
• Basic idea
• When sender senses the channel
• How sender can be sure that collision is done for its packet
• Min frame size of packet to send in CSMA/CD
▪ Backoff algorithm
• How does this algorithm decide the time a station should wait for
sending a packet which already collided for k times…?
• With which algorithm this is used…?
• When collision occurs…?
• It is choice of sender to select the random time from allowed time
• What does actually happen when sender choses x from [0, 2k) in
CSMA/CD and aloha…?
• After how many times sender gives up…?
o ARP protocol
▪ Which address change hop by hop and which don’t change until receiver
receives the packet
▪ What is the need of IP addresses and during when IP address of receiver is
not required…?
▪ Why we need IP even we have MAC address and what is need of MAC even
we have IP address
▪ Which addresses are required by host to send packet to host in different
network and how they are obtained…?
▪ While adding data link header we already got destination IP and source IP
now what we have to do to get destination MAC address…?
 ▪ How to send data to all hosts in the same network…?
▪ ARP request and ARP reply
▪ Two cases of ARP request
▪ Which is broadcast and which is unicast in reply and request
o RARP, BOOTP, DHCP
▪ In order to communicate what data does sender need and how he gets it
▪ How RARP lets sender know its Ip address what does it use
▪ How sender sends request when he don’t know his own Ip and server Ip
▪ BOOT protocols belong to which layer…?
▪ Which protocol is used in transport layer by BOOTP…?
▪ When client and server on same network and in different networks
▪ What does BOOTP reply packet contains
▪ What is static mapping and what is its drawback
▪ How DHCP protocol works to get IP address…?
▪ What are problems solved by DHCP protocol…?

Network layer: -
• IP header
o Header length range
o View of header to remember the fields
o Header length and total length fields
▪ Max size of data packet
o TTL field
▪ Working and explain different cases.
o What fields are changed by routers in between
• Fragmentation
o What is MTU
o Fields related in header
▪ Identification field
▪ Fields (3 bits)
▪ Fragmentation offset
• How to find it algorithm…?
• Routing protocols
o Distance vector routing
▪