0 ratings0% found this document useful (0 votes) 25 views11 pagesNPS 1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here.
Available Formats
Download as PDF or read online on Scribd
” Gages Networks refers +o inter cormected
corepusing, devices that can exchange dota and
ghare’ resources with each other. These “et worked
dlevices use a ayeden of yules called “communication
protocols, to transmit ‘information over physical
ov witelecs +echmologies- a ,
Applications =
' ay word wide web’! ,
~ Digitol video avd audio
—Y Storage servers ste
> Pamters & fax machines
— Use of emaik & metant mecsa ging
applications -
Ee Using collaboration editwaye’ euich as $ Goede
daive 4o shave documents,
2 ost Refererce motel : saan I
(open systeme Tnleyconnection)
mode} fc a conceptual framework thakistardad *
-izs the functors ‘af a telecommunication oy
compuding cyelam imto seven abebe hay taijerc.
Physical tayer>
—7 Ranswicsion of raw bile pai ~ physical
ae < A ;
~ Deal With havdwove” componente ‘Like |
Cables, connectors & network interface cande.Wi) DBAS HHL Layer
— Recponsille for reliable point-to-point &
Poh to- multipoint Communication
5 tondles envoy, detection.) corvecHom at.
the unk layer:
> Examples Ethernet & PPP
Ni) Network Layers : , os
7 Manages logical addressing mouting and
fowading ef data packets bo devices across
different networes: : f
~ Internet potdco] operates ae thic layer
iy Transport layer: — . ohed
Ensures, end—4o~ end com munication -
providing evVOY ‘Yecoverty and flovo Lovdool
TCP Lhravemiscim tondsol protocol) y
UPP ( User datagrarn Protocol)’
V) Segsion. layer :: ea 1504 a es ‘
+ Manages - Secsions or droleques ‘bls:
applications : ‘
—> Recpomsible for exialbalireg. mainiama
avd Jeuammating Connections -
vi) Precenladion layer ,
> Translates dala blw tne applicadiay ‘layer
and lower layers .
SHawdle dala Compaession aneigesten anal’ formating for proper presentation -
vi) Application lawyer
_5 Provides network Services Ainecty fo end-users
ov applications
7 Includes polecole for file transfer CETP),
emald (SMTP) ey web browsi na-CH11 P)
4 Network Hardunre. Devices-
This ave phystcol components that faciviiate
commuwication and dada tramsfer within ov
Computer network
Exe Routers, switches , hubs, nelwork.
interface cords (Nice) .
* Nekwork topologies:
They axe refer +0 the airrantentaunt oy :
layout of interconnected alae ino
computer: network 69219!
Common topologies ~
> Bus Topology
~ cov Topology
~ Rima Topology
— Mesh Topology
~ Hybaid Topology4
1) Bus Topology +
—7 Angle commumicaton Une Shaved by of
devices. :
~ Devices ave connected 40 a contvas bus
data ts hamewited’ 40 all devices.
%
NW) Stay Topology +
Central hub oy swilth connects ol devcor ”
> bach device’ hos a dedicaled communica on
toa central’ point piomoltting ‘beller One
ti) Ring Topology .
— Devices form a cloced loop. each connected
40 exauty two others. - ‘
ww) Mech topgleqy ‘
Devices awe, muti phe, connections > exacting a |
Neduundamt and fautt- tolerad network:
WM Hyesid topology ist
ComlinatHom of two or move if ferent
topelogies usithin a nekwovk5) Vesign sues of Data Wk Jaye
> Emoy Petechon & conection!
Ensuring accurate dala lioremcsion in the
pusenct Of errovs-
> Flow Cortrol >
Managma the flow of daba blur sevder ard"
receiver +O prevent lovaeclton oy data Lose.
4 Addressing > :
Assigning, Unique addreceer to devices on the
same nebwork +0 facilitate communication
> Media Accecs Contyo} + st
Controlling Accece Yo the chaved | Canevoans cabtove
~y Prawe cymanonigatient ' rt
Ensuring thas the Sender and veceivey are
synchrowred in terms of frawe boundaries
> Re Reliability
Encuring reliadde’ delivery: of data. frames
lous Sender € weciewr,
2D) To check if the data with the provided checksum
iC Cortech , we Can perform a Checkeum Validation
The idea ic to add the dalabitcand the Checkeuny
bits & then check if the recut Ie ay onesCno
carty): Tf there ic no cary, H means there are
Mo etI0Is In the A OMS mission.
Check Sum VatictaHan:
ovigmal daka(ar Gils): 111 001 0101101011) O001IT10)
Oudll
Checksum (8 Bits)! NJoolo}
Add the dala and checksum
NNO} ClollOlo tooo II ole Lon) (data), .
“Htopioy
a cote rat Chedesus)
WS olele We reyusepr tit gio Tett
The esuul ig came as the original sates :
Which weans there are “70 errors :
hreticrnietion o
%) Degree of qeneralor polynomial ie.
Hemet 6 Ze10es are appended. -before
division.
wWivisor = Nolol
Divid enced : lo looot14 ©0000,
r s stt orot
olrcet
000000
\ry 1190
tloto]
Jor;oo
brorot
M= 101 coo llolfeute8) Noisy channel protocols - '
Type of CommuwicaHon prdocol thal le uced m
Communication cyceme where the Lrantmiccion
chavrel way hnlroduce errors inlo the’ Laancmitled
dato-
© Stop- AND - wait AKG protocol 1
Diccardey | |
the cender ic
Tebrancmi thyg aut the dala,
Packets againy
roll :
(110) 1100 1-010. 0G O'
Adual Bit trarcwalted |
tlOOto1o0000010) Go-Back-N Protocol +
Te le a cliding wivelow poledol used for wliabbe
data tavefer in Cowpetey nelworke TL ic a condor-
taced protocol that altos the deuder to lrancwdt
qullipte packele wsithoud wailing for an acknowLedq
—meat fov each packer:
key ~ features
vD Siding usindov mechanism
W Sequence numbers
) Curmmu ative Acknowledgements
Selective Repeat pactoco} |
TL is avother alidivg window protocol uced for —
reliable data Ahomefos in Compu.ev mehworke Lt is a
Neceivey ‘based protocol thed alloux vecener +40
acknowledge each packet ividviduierty | rather tham
0 Ctmmntative acknowledgment of a cequence of
Packets ;
1) Receiver-Based protoce)
NW) Each packel 1¢ individually.
\ Guided trangnmiesion mocks 5 6
—7 The quided media alco catled wired communication
Or bounded Transmssion media
— The signal enerqy propagates Anough wires jy
Quided wedi
— Guided media is used for polvt~ point
wowmuwmication.§ !
Tb le cod effective
~y Discrete nelwork topologies are Bivied boy sthe,
quided mediaUnguicted medic
14. i¢ alco cated wireless communication oy
unbounded franswussion media:
—7 the Single energy prenaayatee tag the ous hy
Unguided media °
~7 Unquiced medio. tc Qoeneraly euler for rad
bonood casting iw aU inections:
DL is expencive r
~> Continous network topologies are foal lag the
unguided medio: on ‘
>) Given dota . :
1100, steps siswarSl@y ass,
UT Compute Rows parity Column Parity
oulo Tit. luceierset hes
ool) Mit) . Gs ————— O o
ute olo } — >!
000} OUR jecucernes,!
ool!
(lo o—
Ole ooo; kev tt
ool) o ——_— 8
ono o— 8
A444
Introduce _€xvors ait
t1lo © & €nor Inhoduced ty In sth bit
pot! Oe E&I Tntroduuced im the ard bit 7
Govred_ te
Recompating Row & Column pari by >
Aflev Recomputing. sciloaaiy
40 4404.00
Hoo 11p Onto CON WIggMEH otto