Upload
others
View
34
Download
0
Embed Size (px)
Citation preview
�
•
•
•�
•
�
�
•
�
•
f1
f2f3
f2f3
f1
�
comp 1
comp 2
f1
f2 f3
�
f2 f2
Toy Topology
f1 f1
�
1 1(1)2
� �� ���� �� �� ��
3(2) 1(2)
4(2)
3(1)
2(2)
4(1)
1(2)
3(1)
3 3
4
4
5
5
6
6
w/5
w/5
w/4
w/4
O(W) O(W)
�
�
�
(i) Notation
(ii) Theoretical Upper and Lower Bounds
�
•• ��
• ����
•• ����������������
•
•••
••
Comp 1
Comp 2
Comp 3
Comp 4
Chan 1
Chan 2
Chan 3
Chan 2
Path SelectionChannel Assignment
No of available channels = 35 source-destination pairs
SourceDestinationOther nodes
S1
S2
S3
S4
S5
D1
D2D3
D4
D5
�
�
� ����
������������������ �����������
�
�
�
1.4
1.6
1.8
2
2.2
2.4
2.6
2.8
3
3.2
1 2 3 4 5 6 7 8
Del
ay (s
econ
ds)
Number of channels
Delay vs No of channels 10Mbps
component basedlink based
flow based
0
0.5
1
1.5
2
2.5
3
3.5
4
1 2 3 4 5 6 7 8
Del
ay
Number of channels
Delay vs No of Channels 54Mbps
component basedlink basedflow based
�
Setup• 8 IBM and Dell laptops• Lucent Ornico & Intel Pro wireless 2200 802.11b/g Wifi cards• 3 laptops have FC 4 linux• 5 laptops run on windows XP• Ftp application
�
Topology 1 Topology 2Average Throughput (KB/s) vs. Flows
050
100150200250300350400450500
F1 F2 F3 F1 F2 F3 F1 F2 F3Component Flow Single
Flow Identifier
Thr
ough
put (
KB
/s)
Average Throughput (KB/s) vs. Flows
0
100
200
300
400
500
600
F1 F2 F3 F1 F2 F3 F1 F2 F3Component Flow Single
Flow Identifier
Thr
ough
put (
KB
/s)
�
�