

















Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Various multiplexing techniques for sharing physical links among users, including time-division multiplexing (tdm) and frequency-division multiplexing (fdm). It also introduces statistical multiplexing and its implications for application communication. The document further explores inter-process communication (ipc) abstractions and their semantics, focusing on request/reply and message stream channels. Performance metrics such as bandwidth, latency, and delay x bandwidth product are also covered.
Typology: Slides
1 / 25
This page cannot be seen from the preview
Don't miss anything!


















3
Physical links/switches must be shared among users– (synchronous) Time-Division Multiplexing (TDM)– Frequency-Division Multiplexing (FDM)
L1 L2 L
R1 R2 R
Switch 1
Switch 2
Multiple flowson a single link
Do you see any problem with TDM / FDM?
5
-^
An application needs to break-up its message in packets,and re-assemble at the receiver
-^
Fair allocation of link capacity: FIFO, round-robin or QoS
-^
If
congestion
occurs at a switch - buffer may overflow,
packets may be lost
…
6
A network is delivering packets among acollection of computers
-^
How application processes communicate ina^
meaningful
way?
Hide network complexity by implementingthe common services once
8
Semantics and interface depend on applications
-^
Request/Reply– distributed file systems
Message stream– video on-demand– video conferencing
x240 pixels
x
240
x
24)/8=247.5KB
reliable?
-^
prioritized?
-^
delay/bandwidth guarantees?
9
What functionality does a channel provide ?– Smallest set of abstract channel types adequate
for largest number of applications
Where the functionality is implemented ?– Network as a simple
bit-pipe
with all high-level
communication semantics at the hosts
“dumb” devices (telephone network)
11
Required performance at stake
Messages are delayed
-^
Messages are delivered out-of-order
-^
Third party’s eavesdrop
-^
The challenge is to fill the gap betweenapplication expectations and hardwarecapabilities
12
end-to-end
bandwidth
10
bytes
3
bits per second
14
Latency / delay–
time to send message from point A to point B– one-way versus round-trip time (
RTT
)
-^
components^ Latency = Propagation + Transmit + QueuePropagation = Distance / cTransmit = Size / Bandwidth
-^
Note:
(dominates over shorter distances)
15
Relative importance, depends on application
-^
1-byte character:– Choice of 1ms vs 100ms dominates 1Mbps vs
100Mbps
25MB file:– Choice of 1Mbps vs 100Mbps dominates 1ms vs
100ms
Large data (file transfer) is bandwidth critical
-^
Small data (HTTP) is latency critical
17
Amount of data “in flight” or “in the pipe”
-^
Example: 100ms RTT
x
45Mbps BW = 560KB
This much data must be buffered before the senderresponds to slowdown the request
Bandwidth
Delay
18
Latency (RTT) dominates instead of throughput^ – Throughput = TransferSize / TransferTime– TransferTime = RTT + 1/Bandwidth x TransferSize
-^
1 MB file over a 1 Mbps network takes around 8 sec– With RTT of 100ms, it corresponds to 80 RTTs– Effective throughput is 1MB/8.1s = 0.987Mbps
-^
1 MB file over a 1 Gbps network takes 100ms + 8ms– Effective throughput is 1MB/108ms = 74.1 Mbps
-^
file
to 1-Gbps link apears like a 1-KB
packet
to 1-Mbps link
20
Established a comprehensive set of requirementsfor network design
-^
Networks evolve to accommodate changes inunderlying technologies and user demands
-^
However, hardware and user expectations are moving targets …
21
The challenge is to
fill the gap
between hardware
capabilities and application expectations, and to doso while delivering “good” performance
-^
Designers cope with this complex task bydeveloping a
network architecture
as a guideline