Answer - Regular CS306 Computer Networks May 2019
Answer - Regular CS306 Computer Networks May 2019
PART B
Answer any two full questions, each carries9 marks.
5 a) List the design issues of layered network software. (any three)
1. Application Layer
2. Presentation Layer
3. Session Layer
4. Transport Layer
5. Network Layer
6. Datalink Layer
7. Physical Layer
1. Data link layer synchronizes the information which is to be transmitted over the
physical layer.
2. The main function of this layer is to make sure data transfer is error free from one
node to another, over the physical layer.
1. Network Layer routes the signal through different channels from one node to other.
2. It acts as a network controller. It manages the Subnet traffic.
1. Session Layer manages and synchronizes the conversation between two different
applications.
2. Transfer of data from source to destination session layer streams of data are
marked and are resynchronized properly, so that the ends of the messages are not cut
prematurely and data loss is avoided.
1. Presentation Layer takes care that the data is sent in such a way that the receiver
will understand the information (data) and will be able to use the data.
2. While receiving the data, presentation layer transforms the data to be ready for the
application layer.
OSI Model Layer 7: Application Layer
It is a set of rules determining how network devices respond when two devices attempt to
use a data channel simultaneously (called a collision). Standard Ethernet networks use
CSMA/CD to physically monitor the traffic on the line at participating stations. If no
transmission is taking place at the time, the particular station can transmit. If two stations
attempt to transmit simultaneously, this causes a collision, which is detected by all
participating stations. After a random time interval, the stations that collided attempt to
transmit again. If another collision occurs, the time intervals from which the random
waiting time is selected are increased step by step. This is known as exponential back off.
7 a) Token management is done in IEEE 802.5.priority bits and
reservation bits management
Token ring is the IEEE 802.5 standard for a token-passing ring in Communication
networks. A ring consists of a collection of ring interfaces connected by point-to-
point lines i.e. ring interface of one station is connected to the ring interfaces of its left
station as well as right station. Internally, signals travel around the Communication
network from one station to the next in a ring.
These point-to-point links can be created with twisted pair, coaxial cable or fiber optics.
Each bit arriving at an interface is copied into a 1-bit buffer. In this buffer the bit is checked
and may be modified and is then copied out to the ring again. This copying of bit in the
buffer introduces a 1- bit delay at each interface.
Token Ring is a LAN protocol defined in the IEEE 802.5 where all stations are connected
in a ring and each station can directly hear transmissions only from its immediate neighbor.
Permission to transmit is granted by a message (token) that circulates around the ring. A
token is a special bit pattern (3 bytes long). There is only one token in the network.
1. It translates logical network address into physical address. Concerned with circuit,
message or packet switching.
2. Routers and gateways operate in the network layer. Mechanism is provided by
Network Layer for routing the packets to final destination.
3. Connection services are provided including network layer flow control, network layer
error control and packet sequence control.
4. Breaks larger packets into small packets.
Link State Routing is a dynamic routing. Each router must do the following:
1. Discover its neighbors, learn their network address.
2. Measure the delay or cost to each of its neighbors.
3. Construct a packet telling all it has just learned.
4. Send this packet to all other routers.
5. Compute the shortest path to every other router.
Congestion is a problem when too many packets are present in the subnet, performance
degrades • Congestions can be brought on by several factors: – All of a sudden, streams of
packets arrive on multiple input lines and all of them need the same output line, a queue is
built up. Allocating more memory may help to a point but with infinite memory, congestion
gets worse because packets are timed out. – Slow processors make queue to be built up
even though there are enough bandwidth. – Low-bandwidth also causes congestion.
Leaky bucket algorithm
Token bucket algorithm
Reverse ARP is a networking protocol used by a client machine in a local area network to
request its Internet Protocol address (IPv4) from the gateway-router’s ARP table. The
network administrator creates a table in gateway-router, which is used to map the MAC
address to corresponding IP address.
When a new machine is setup or any machine which don’t have memory to store IP
address, needs an IP address for its own use. So the machine sends a RARP broadcast
packet which contains its own MAC address in both sender and receiver hardware address
field.
A special host configured inside the local area network, called as RARP-server is
responsible to reply for these kind of broadcast packets. Now the RARP server attempt to
find out the entry in IP to MAC address mapping table. If any entry matches in table, RARP
server send the response packet to the requesting device along with IP address