30 Jul To 3 Aug - Notes For Introduction To Web Programming
30 Jul To 3 Aug - Notes For Introduction To Web Programming
w
hb
end sy .
omm
Unk
ewtt
(Emh
Umgid
wtol Corn m
ceAV inoless
Calnn
Tod&
b to 4
inastme u
ht pidos YOu8s swic
o1 duo Com
mo
videe-
Host: sends packets of data
host sending function:
-L -L-
takes application message
breaks into smaller chunks, two packets,
known as packets, of length L bits L bits each
Nashik
Aurangabad chandrapur
17hr40min
Nand
MumbaiO
Navi Mumbai
Pune
mnagar
Nananac
Two key network-core functions
routing algorithm
R 1.5 Mb/s D
queue of packets
waiting for transmission
Over output link tbos hisi
B
R 1.5 Mb/s
queue of packets
waiting for transmission
over output link
Packet queuing and loss: if arrival rate (in bps) tolink exceeds
transmission rate (bps) of Iink for some period of time
packets will queue, waiting to be transmitted on output link
packets can be dropped (lost) if memory (buffer) in router fills up
+phn
stach C
Alternative to packet switching: circuit switching
end-end resources allocated to, So
reserved for "call" between source
and destination
i n diagram, each link has four circuits.
call gets 2nd circuit in top link and 1st
circuit in right link.
dedicated resources: no sharing
circuit-like (guaranteed) performance
circuit segment idle if not used by call (no
sharing)
commonly used in traditional telephone networks dest
Packet-switching: store-and-forward
utpkS. nla
L bits
per packet Cw -hou
source 2 1
destination
R bps Rbps
global
ISP
Internet structure: a "'network of networks"
But if one global ISP is viable business, there will be competitors. who will
want to be connected
Internet exchange point
Adv of IXP
Avoid tromboning
XP effect
ISP A cost
IXPSPB ess
ISP C
peering link