conection less and connection oriented

8/13/2019 conection less and connection oriented

1/5

Name: Jinesh G. Sanghvi

CIS617 Final Term Question Bank

Q1 Compare the Connection oriented and connectionless oriented internetworking

approaches

!ns

Conne"tion #riente$:

Advantages:

1. Buffers can be reserved in advance

2. Sequencing can be guaranteed.

. Short headers.

!isadvantages:

1. "o alternate routing around congestion.

2. #ulnerabilit$ to router failures along the path.

. %equirement of table spaces at the routers.

&. !ifficult to implement if one of the networks involved is an unreliable datagram

network.

Conne"tionless #riente$ a%%roa"h:

Advantages:

1. Can be used to connect subnets without #C's inside.

2. %obust to router failures.

. (ore potential for adapting congestion

!isadvantages:

1. "o sequencing.

2. )onger headers.


2/5

Q2.*+plain ,ragmentation*+plain different t$pes of ,ragmentation with their

advantages and disadvantages

!ns

Fragmentation:-hen a large packet wants to travel through a network whose ma+imum

packet sie is too small to handle&then the packet is break up into small chunks called

fragmentsand each fragment is sent as a separate /nternet packet .

Trans%arent Fragmentation:

0his strateg$ makes fragmentation caused b$ a small packet network transparent to

an$ subsequent networks through which the packet must pass on its wa$ to ultimate

destination../n this approach when an oversied packet arrives at a gatewa$&the gatewa$

breaks it up into fragments.*ach fragment in addressed to the same e+it gatewa$&where

the pieces are recombined./n this wa$ passage through the small3packet network has

been made transparent and the subsequent networks are not even aware that

fragmentation has occurred.*g :A0(

!isadvantages:

1. 0he e+it gatewa$ must know when it has received all the pieces&so a count field or

an end of packet bit must be provided.

2. All fragments must e+it via the same e+it gatewa$.

. 4verhead required to repeatedl$ reassemble and then re3fragment a large packet

passing through a series of small3packet networks.

Non'Trans%arent Fragmentation:

0his strateg$ refrains from recombining fragments at an$ intermediate gatewa$s.4nce

a packet has been fragmented&each fragment is treated as though it were an original /5

packet.

Advantages:

1. (ultiple e+it gatewa$s can be used because reassembl$ occurs onl$ at the

destination host&and thereb$ higher performance can be achieved.

!isadvantage: 0he total overhead increases&as each fragment must have a header.


3/5

Q.6ive the different techniques of dropping packets to disappear congestion.

!ns

(oa$ She$$ing:A router drowning in packets can 7ust pick packets to drop depending

on the application running.0here are two policies:

a. -ine 8drop new packets and keep old9 :,or file transfer an old packet is worth

more than a new one because dropping packet : and keeping packets ; through1 < to indicate that the pigg$ back acknowledgement field is not in use.0he

connection repl$ doesnot bear an acknowledgement&so it has S@" 1 and AC> 1 ./n

essence the S@" bit is used to denote C4""*C0/4" %*Q=*S0 and C4""*C0/4"

ACC*50*!&with the AC> bit used to distinguish between those two possibilities.

,/" : 0he ,/" bit is used to release the connection./t specifies that the sender has no

more data to transmit.

Q.6iven the Class C network of 2


5/5

0herefore $ou have determined that it is possible to create the above network with a

Class C network.An e+ample of how $ou might assign the sub3networks is as follows:

netA:2

conection less and connection oriented

Documents