Professional Documents
Culture Documents
Devices,Network Layer
Prof.Rajesh.C
Figure: Addresses
IEEE 802.11 PROJECT - Addressing Mechanism
Figure: Specifications
Physical layer of IEEE 802.11 FHSS
Figure: Bluetooth:Piconet
Bluetooth:Scatternet
Figure: Bluetooth:Scatternet
Bluetooth:Layers
Figure: Bluetooth:Layers
Bluetooth:Layers - L2CAP
I The Logical Link Control and Adaptation Protocol,or
L2CAP(L2 here means LL),is roughly equivalent to the LLC
sublayer in LANs.
I It is used for data exchange on an ACL link;SCO channels do
not use L2CAP.
I The 16-bit length field defines the size of the data, in
bytes,coming from the upper layers.
I Data can be up to 65,535 bytes.The channel ID (CID) defines
a unique identifier for the virtual channel created at this level.
Figure: Bluetooth:Layers
L2CAP - Duties
fc = 2402 + n MHz
where : n = 0,1,2........78
I For example,the first channel uses carrier frequency 2402
MHz(2.402 GHz),and the second channel uses carrier
frequency 2403 MHz (2.403 GHz).
CONNECTING DEVICES
I Figure in the next slide shows that when a packet from station
A to station B arrives at the hub,the signal representing the
frame is regenerated to remove any possible corrupting
noise,but the hub forwards the packet from all outgoing ports
except the one from which the signal was received.
I In other words,the frame is broadcast.
I All stations in the LAN receive the frame,but only station B
keeps it.
I The rest of the stations discard it.
I Figure also shows the role of a repeater or a hub in a switched
LAN.
I The figure definitely shows that a hub does not have a
filtering capability;it does not have the intelligence to find
from which port the frame should be sent out.
CONNECTING DEVICES : Hubs
I A hub or a repeater is a physical-layer device.They do not
have a link-layer address and they do not check the link-layer
address of the received frame.
I They just regenerate the corrupted bits and send them out
from every port.
Figure: A hub
CONNECTING DEVICES :Link-Layer Switches
I The process for finding the spanning tree involves three steps:
I The process for finding the spanning tree involves three steps:
Figure: Finding the shortest paths and the spanning tree in a system of
switches
CONNECTING DEVICES : Spanning tree Algorithm
Figure: Forwarding and blocking ports after using spanning tree algorithm
CONNECTING DEVICES : Spanning tree Algorithm
I Note that there is only one path from any LAN to any other
LAN in the spanning tree system.
I This means there is only one path from one LAN to any other
LAN.No loops are created.
I We can prove that there is only one path from LAN 1 to LAN
2,LAN 3,or LAN 4.Similarly,there is only one path from LAN 2
to LAN 1,LAN 3,and LAN 4.The same is true for LAN 3 and
LAN 4.
I We have described the spanning tree algorithm as though it
required manual entries. This is not true.Each switch is
equipped with a software package that carries out this process
dynamically.
CONNECTING DEVICES :Advantages of Switches