03 Lan 4P PDF

Lehrstuhl für Informatik 4 Lehrstuhl für Informatik 4
Kommunikation und verteilte Systeme Kommunikation und verteilte Systeme
Network Categories Network Types for the Local Range

Local Area Networks (LAN): 10m - few km, simple connection structure
• LLC layer: uniform interface and same frame format to upper layers
• Ethernet/Fast Ethernet/Gigabit Ethernet
• MAC layer: defines medium access
• Token Bus, Token Ring LAN
• Wireless LAN (WLAN, up to a few 100 m)
• FDDI (up to 100 km, belongs to LANs nevertheless) LLC IEEE 802.2 Logical Link Control ...
Sicherungs-
Data Link
ebene
Layer
Metropolitan Area Network (MAN): 10 - 100 km, city range ANSI ATM
802.3 802.4 802.5 802.6 X3T9.5 Forum
• DQDB MAN ...
MAC
• FDDI II CSMA/CD Token Token ATM LAN
(Ethernet) Bus Ring DQDB FDDI Emulation
• Gigabit Ethernet
ISO/OSI Reale
Existing NetzeConcepts
Network
Wide Area Networks (WAN): 100 - 10000 km, interconnection of subnetworks
• Frame Relay While LLC defines more “generic” functions, local area
• ATM WAN networks differ in the MAC method which is used
• SDH
Chapter 2.2: Examples for LANs Page 1 Chapter 2.2: Examples for LANs Page 2

Ethernet Carrier Sense Multiple Access

• Bases on the standard IEEE 802.3 “CSMA/CD”
(Carrier Sense Multiple Access/Collision Detection) Principle:
• Several (passive) stations - one shared medium (random access) → listen to the medium before sending
• Originally, bus topology: → send only if the medium is free
S1
1. Is the medium available?
(Carrier Sense) ?
1. Station S1 sends
Message from S1
Signal expansion 2. Station S2 also wants Expansion of the signal

2. Data transmission ? also in other to send but notices that on the medium
direction a transmission already S2
takes place.
3. Check for collisions (Collision Detec-
tion) • Advantages: simple, since no mechanisms are needed for the coordination;
If so: send jamming signal and stop with some extensions nevertheless a good utilization of the network capacity
transmission. Go on with binary
exponential backoff algorithm • Disadvantage: no guaranteed access, a large delay before sending is possible
Problem with CSMA Detection of Collisions

Carrier Sense Multiple Access with Collision Detection (CSMA/CD)
Problem: the message which is sent by S1 spreads with finite speed on the
• Principle:
medium. Therefore it can be that S2 only thinks that the medium would be free,
although S1 already has begun with the transmission. It comes to a collision: → like CSMA
both messages overlay themselves on the medium and become useless. → additionally: stop the transmission if a collision arises, i.e. when other
data are received while we are still sending
Maximum distance in the network
Note: the signals from S1 and S2 S2
also expand to the left direction, S1
S1 not shown here for simplification
S1 sends
of the figure.
1. Station S1 sends S2 sends
Message from S1 Message from S2
S2 detects the
2. Station S2 also Expansion of the signal conflict and stops.
wants to send and S1 detects the conflict and
on the medium knows that the transmission Transmission of a
thinks, the medium S2 jamming signal.
would be free. has to repeat.
Time Only small overlapping, but nevertheless
both messages are destroyed
Note: with increasing expansion of the network the risk of a conflict also increases.
Chapter 2.2: Examples for LANs Page 5 Chapter 2.2:
Therefore Examples for
this technology LANs only for “small” networks (concretely: Ethernet)
is suitable Page 6

Data transmission with CSMA/CD Performance of CSMA/CD

The performance of Ethernet systems depends on the vulnerability part a:
• When does the collision detection in CSMA/CD work correctly? Data still to send
• The maximum time for the detection of a collision is about twice as long as the
signal propagation delay on the medium. Data already sent
• First compromise: one wants to realize large networks, but although to have a
small probability of collision… • a is the fraction of a frame which the sender has to transmit till the first bit had
… Result: the maximum expansion of the network is specified on 2800 meters. crossed the whole network
• At a signal speed of approximately 200000 km/s (5 µs/km) the maximum signal • If someone begins to send during the time a needs to cross the whole network, a
propagation delay (with consideration of the time in repeaters) is less than 25 µs. conflict arises
The maximum conflict duration thereby is less than 50 µs. To be sure to recognize • The smaller a is, the better is the network‘s performance
a collision, a sending station has to listen to the medium at least for this time. • a is small…
• Arrangement: a station only listens to the medium as long as it sends data. … when the network is small
• Based on a transmission rate of 10 MBit/s a minimum frame length (64 byte) was … when frames are long
defined in order to make a collision detection possible also in the worst case – 64 … when capacity is low
bytes, because those would need the maximum conflict duration of 50 µs to be • Conclusion: the best network has nearly zero extension, nearly zero capacity, and
sent. a station should never stop sending.
Message Format for CSMA/CD The Ethernet Frame
Preamble SFD DA SA L/T Data Padding FCS

• Preamble: marks a following transmission and synchronizes the receiver with the
sender.
1 2 3 4 5 6 7 8
• The Start-of-Frame-Delimiter (resp. the two successive ones) indicates that
1: 7 byte synchronization In 802.3: Indication of the length of the finally data are coming.
Each byte contains 10101010 data field (permitted range: 0 - 1500
byte) • Destination address: the first bit determines the receiver: either, an individual
2: 1 byte start frame delimiter (SFD) station (first bit = 0) or a group address (first bit = 1; Broadcast is also given here
In Ethernet: identification of the upper
Marking of the begin of the frame by layer protocol, e.g. “IP” through 11…1).
the byte 10101011 • Length(/Type): In IEEE 802.3 a value until 1500 indicates the length of the
6: >=0 (0 – 1500) byte data
3: 6 (2) byte destination address following data part. In Ethernet, the meaning is changed, identifying the layer-3
MAC address of receiver 7: >=0 (0 – 46) byte padding protocol to which the data have to be passed. For distinction from IEEE 802.3,
Filling up of the frame to at least 64 only values from 1536 are permitted.
4: 6 (2) byte source address byte (smaller fragments in the network
MAC address of sender are discarded, with the exception of the • FCS: Checksum, 32-bit (CRC). It covers the fields DA, SA, length/type,
jamming signal) data/padding.
5: 2 byte length (IEEE 802.3)/ type
(Ethernet) 8: 4 byte frame check sequence
Use of a cyclic code (CRC)

Resolving Collisions in Ethernet Binary Exponential Backoff

Binary Exponential Backoff (BEB)
In order to avoid the simultaneous repetition of transmissions after a collision
(subsequent collision), a random waiting period is drawn from a given interval. The
interval is kept small, in order to avoid long waiting periods up to the repetition. Advantage:
Thus, the risk of a subsequent conflict is high. If it comes to a further collision, the
interval before the next attempt is increased, in order to create more clearance for • Short waiting periods (by small interval) if not much traffic is present
all sending parties. • Distribution of repetitions (by large interval) if much traffic is present
The waiting period is determined as follows: Disadvantage:
• A station having had already i collisions, selects a random number of x from the • Stations having a subsequent conflict during a repetition have to draw a random
interval [0, 2i-1]
waiting period from an interval twice as large. If they are having a further conflict,
• With collision 10 – 15, the interval remains fixed with [0, 210-1], after the 16th the interval again is doubled, …
collision a station aborts the transmission completely
• Thus, single stations can be disadvantaged.
• As soon as the medium is free, the sender waits for x time slots, whereby a time
slot corresponds to the minimum Ethernet frame length of 512 bits (for a 10 Mbit/s
Ethernet this corresponds to the maximum conflict period of 51,2 µs).
• After that x-th time slot the station becomes active with carrier sense.
Ethernet Ethernet Parameters

Bases on IEEE 802,3 „CSMA/CD “
4 classes of Ethernet variants: Still partly in use Parameter Ethernet Fast Ethernet Gigabit Ethernet
• Standard Ethernet 10 MBit/s Maximum
up to 2800 meters 205 meters 200 meters
Today the most common used variant expansion
• Fast Ethernet 100 MBit/s
Capacity 10 MBit/s 100 MBit/s 1000 MBit/s
• Gigabit Ethernet 1000 MBit/s Also used in MANs
Minimum frame
64 byte 64 byte 520 byte
• 10Gigabit Ethernet 10000 MBit/s Standardized for optical fiber length
Maximum frame
1526 byte 1526 byte 1526 byte
Ethernet became generally accepted within the LAN range. length
It is used in most LANs as infrastructure: Signal 4B/5B code, 8B/6T
Manchester code 8B/10B code,…
representation code, …
• It is simple to understand, to build, and to maintain Maximum
• The network is cheap in the acquisition number of 5 2 1
repeaters
• The topology allows high flexibility
• No compatibility problems, each manufacturer knows and complies Additionally, for the jamming a certain 4 byte pattern is send.
with the standard

Naming of Ethernet Variants Ethernet - Configurations

Indication of the used Ethernet variant by 3 name components: ≤ to
up 100100 Stations
Stationen
1 – Capacity in MBit/s (10, 100, 1000 or 10G)

Segment1
2 – Transmission technology (e.g. Base for baseband, Broad for broadband)
Repeater
≤ 50 m
3 – maximum segment length in units of the medium used by 100 meters, resp. Segment2
type of medium ≥ 2.5 m Terminator
≤ 500 m
Examples:
Grundeinheit:
Basis Segment
configuration: segment Kopplung
Connection of zweier Segmente
segments through a repeater
• 10Base-5: 10 MBit/s, baseband, 500 meters of segment length
• 100Base-T2: 100 MBit/s, baseband, two Twisted Pair cables (i.e. two cores)
50 m 500 m 500 m
• 1000Base-X: 1000 MBit/s, baseband, optical fiber
50 m 50 m
Some parameters depend on the variant, e.g. the minimum frame length 50 m
500 m
(because of different signal propagation delay): Optical fiber
Glasfaserkabel
50 m 50 m
• 1000Base-X: minimum frame length of 416 bytes 1000 m
Ethernet
Ethernet maximaler
with maximumLänge
range
• 1000Base-T: minimum frame length of 520 bytes
Infrastructure Components: Hub & Repeater 10Base-T (Twisted Pair)

• Transmission of data of the physical layer • Alternative to bus topology: star topology using twisted pair: several devices
Layer 1 are connected by a hub
• Reception and revitalization of the signal
• Devices are attached by a RJ-45 plug (Western plug),
• Stations cannot send and receive at the same time
however only 2 of the 4 pairs of cables are used
• One shared channel (Broadcast)
• Cable length to the hub max. 100 m
• Low security, because all stations can monitor the whole
• Total extension thereby max. 200 m
traffic
• Long time the most commonly used variant
• Low costs
Hub
Hub
Segment 1
Repeater
Segment 2
Repeater:
Linkage of 2
Hub: “one to all” networks

Fast Ethernet Infrastructure Components: Switch

Like a hub, but:
Principle: still use the Ethernet principles, but make it faster: • Stations can send and receive at the same time Layer 2/3/4
• Compatibility with existing Ethernet networks • No carrier control necessary
• 100 MBit/s as data transmission rate, achieved by better technology, more
• Point-to-point communication
efficient codes, utilization of several pairs of cables, switches,…
• Buffer for each individual station/each port
• Result: IEEE 802.3u, 1995
• Higher costs Switch
Problem:
• The minimum frame length for collision detection within Ethernet is 64 byte. With
100 MBit/s the frame is sent about 10 times faster, so that a collision detection is • “Layer 3-Switch”: also has
not longer ensured. functionalities of layer 3, i.e. it
can e.g. take over the routing.
• Result: for Fast Ethernet the expansion had to be reduced approx. by the factor
10 to somewhat more than 200 meters… • “Layer 4-Switch”: looks up
additionally in the TCP-
• Therefore its concept bases on 10Base-T with a central hub/switch. header, can therefore be
used e.g. for load balancing.
On the Way to the Gigabit Ethernet On the Way to the Gigabit Ethernet
• With Gigabit Ethernet the sending of several successive frames is possible (Frame
• 1998 the IEEE standardized the norm 802.3z, “Gigabit Ethernet” Bursting) without using CSMA/CD repeatedly.
• Again: compatibility to Fast Ethernet has to be maintained! • Therefore stations can send up to 5,4 frames at one time.
• Problem: for collision detection a reduction of the cable length to 20 meters would • The sending MAC controller fills the gaps between the frames with “Interframe-bits”
be necessary … “Very Local Area Network” (IFG), thus for other stations the medium is occupied.
• Therefore the geographical coverage remained the same as for Fast Ethernet –
instead a new minimal frame length of 520 byte was specified by extending the
standard frame by a ‘nodata’ field (after the FCS, because of compatibility to MAC frame (including
IFG MAC frame IFG …. MAC frame
Ethernet). This procedure is called Carrier Extension. nodata field)
Length Under normal conditions, within Gigabit Ethernet no more hubs are used. In the
PRE SFD DA SA DATA Padding FCS nodata
/Type case of using a switch no more collisions occur, therefore the maximum cable
length here is only determined by the signal absorption.
When a frame is passed on from a Gigabit Ethernet to a Fast Ethernet, the ‘nodata’
usage for backbone connections in MAN area,
part is simply removed and the frame can be used like a normal Ethernet frame.
range up to 70 km when using expensive optical fiber!

Future of the Ethernet Token Bus

Alternative to CDMA: “Token”-procedure: Only someone who possesses a certain
… latest specification: 10GBase-X (10-Gigabit Ethernet, IEEE 802.3ae) token (= bit sequence), may send.
• Only specified for optical fiber; technical principle: Wavelength Division • One example for a token network: IEEE 802.4 “Token Bus”
Multiplexing: transmit data using four different wavelengths in parallel: • All stations should be treated equally, i.e. they have to pass on the token cyclically
• For this: logical ordering of all stations to a ring
λ1 λ1
DEMUX
• In a bus topology, ordering is made regarding station addresses:

λ2 λ2
MUX
λ3 λ1 + λ2 + λ3 +λ4 λ3
22 62 21
λ4 λ4
• Variants for twisted pair are currently in development (how to apply

wavelength multiplexing to copper cable?) 149 5 42 17
• Star topology using a switch
• CSMA/CD is no longer used since no collisions can occur (but nevertheless
• Usage e.g. as a field bus (Feldbus in German) in industrial environments with a high
implemented for compatibility with older Ethernet variants) degree of noise. Purpose: e.g. roboter control; a few masters, many slaves (they
• Is also to be used also in the MAN/WAN range: 10 - 40 km only listen). Data rate is not that important, but guarantees in response times are
Chapter 2.2: Examples for LANs Page 23 necessary.
Chapter 2.2: Examples for LANs Page 24
Message Exchange in Token Bus Problems with Token Bus

Two types of messages are used: First problem: a station leaves the logical ring
• Easy solution: the leaving station sends a message to its predecessor indicating
• Token messages TID, nextID ID nextID the new successor
• Data messages MID ID Data Second problem: a station comes into the logical ring
Token messages are used for passing on the sending permission from station • To allow new stations to join, in periodically intervals, a „window“ is opened
ID to station nextID between neighbors, e.g. between 5 and 17.
Data messages contain the data to be sent • New stations with IDs from 6 to 16 now can apply.
Having the token, a station is allowed to send a message. After this (or if • Problem: conflict risk! Several stations could apply to join in this window
nothing is to be sent) the token is passed on. • Conflict resolution: survival of the fittest. Consider last 2 bits of the IDs:
Traffic on the bus e.g.: send a request to join with a duration specified by the last 2 bits of your ID:
T5,17 → M17 → T17,21 → M21 → T21,22 → T22,42 → T42,63 → M63 → T63,149 → T149,5 00 send short
→ M5 → T5,17 → … 01 send longer
High overhead for token exchange: 512 Bit times for each token message (a full 10 send even longer
small size Ethernet frame)! In contrast to that, in Token Ring networks only one 11 send longest
bit is to be switched from 0 to 1, i.e. only one bit time for a token message. If you hear anybody else sending longer than you, give up. If you survive without
Thus, the number of participating stations should be low, or the number of conflict, join. If there is no resolution (two or more stations are sending for the
masters should be low, you can tolerate very many slaves same time, no one is sending longer), repeat with the second-last bit pair, etc.

Example Token Ring
Token bus forms a logical ring of stations on a bus. Why not apply that principle to a
Assume a global window. ring topology?
Competitors:
→ Token Ring (4/16/100 Mbit/s)
15 63 22 4 35
• bases on standard IEEE 802.5
00001111 00111111 00010110 00000100 00100011
• the stations share a ring of point-to-point connections
11 11 10 00 11 • the token is cyclically passed on
11 11 00 Characteristics:
• guaranteed access, no collisions
00 11 • very good utilization of the network capacity,
high efficiency
Winner! • fair, guaranteed response times
• possible: multiple tokens
In case of some configuration error, two identical IDs are present: after checking all • however: complex and expensive Passing on the token
pairs of the IDs, continue by adding random bit pairs.
Token Ring Sending and Receiving

Data
• Medium: twisted pair, coaxial cable or optical fiber Initial state
Receiver Transmitter
• Data are received from the
• Capacity of 4 resp. 16 MBit/s (100Mb/s with optical fiber)
ring serially from the ring to the ring
• Differential Manchester Code on layer 1
• Data addressed to a to from
• The stations are actively attached, i.e. received signals are regenerated (same connector’s station are Station Station
principle as for repeaters, therefore no restriction of the ring’s expansion) copied
1 • Data are serially passed on
Point-to-Point
Station Connection along the ring
Active connector
Transmission state Receiver Transmitter

4 2
• The ring is divided from the ring to the ring
Receiver Transmitter • Own data are sent serially
from the ring to the ring
to from
• Data coming in from the ring Station Station
to from
Station Station are evaluated by the station
3

Access within a Token Ring Access within a Multiple Token Ring

Example: Station 2 sends to station 1 1 1
1 1 Same example: Station 2 sends to
1. Station 2 waits for free token station 1
(transmission authorization, 3-Byte- F
F
1. Station 2 waits for free token

Token).
2. Station 2 changes free token into an
2
1 4 2
B
2 4 (transmission authorization).
2
1 4 2
B
2 4
occupied one (occupied token = 2. Station 2 changes free token into an

frame header). occupied one (occupied token =
frame header). 3 3
Afterwards, station 2 sends the 3 3
frame. (Station 2 may send further Afterwards, 2 sends the frame.
frames, if the token holding timer 1 1 (Station 2 may send further frames, 1 1
if the token holding timer (default 10 copy
kopieren
(default 10 ms) is not exceeded) copy
kopieren
ms) is not exceeded) remove
B
B
3. Station 2 terminates the frame and B remove entfernen
3 4
entfernen
3. Station 2 terminates the frame and
waits until the frame passed the
whole ring and arrives again.
2
3 4 2
4 4
produces a new, free token imme-
2 4 2 4
diately.
F
F
4. Station 1 copies the frame. Station 2

removes it from the ring and 4. Station 1 copies the frame. Station 2
3 3 3 3
produces a new, free token. removes it from the ring.
Frame Format for Token Ring Frame Format for Token Ring
If the ring is inactive, only the 3-Byte-Token (SD, AC, ED) circulates. If a station • Frame status contains confirmation bits A and C. If a frame arrives at the
wants to send, it sets a certain bit in this token from 0 to 1. station with the destination address, bit A is set. If the station processes the
frame, also bit C is set. When the sending station gets the frame back, it can
111 2/6 2/6 any 4 1 1 Byte
Free token, if a see whether the receiving station is not working (A = 0, C = 0), if the frame
certain bit DA SA Data FCS was not accepted (A = 1, C = 0), or whether the frame was received correctly
within AC is set.
(A = 1, C = 1). To protect against bit errors, both bits are doubly present.
• The addresses and the checksum are identical to Ethernet.
Frame Control(ED)
End Delimiter (FC) End Delimiter (ED)
Access Control (AC) Frame Status
Bits of access control:
Start Delimiter (SD) • The monitor bit serves for recognition of a second frame circulation
• The priority bits make possible several priorities. They indicate the priority of
the token. If a station wants to send with priority n, it must wait for a token of
• SD and ED serve for marking the frame. They contain invalid sequences of the priority n or higher.
differential Manchester code.
• The reservation bits permit a station to reserve the next frame for itself. If a
• Access control contains the token bit, further a monitor bit, priority bits and station wants to do this, it registers its priority into the reservation bits. This is
reservation bits. only possible, if not already a higher priority is registered. During the next
token generation, the priority is copied into the priority bits.
• Frame control marks the kind of the frame: Data, control,…

Ring Maintenance Fiber Distributed Data Interface (FDDI)

• FDDI is a high performance token ring LAN based on optical fibers
To check the correct function of the ring, a monitor station is introduced. If this
• ANSI standard X3T9.5
station crashes, another station is raised as monitor station: if a station recognizes
that the monitor is inactive, this station sends a certain token (CLAIM_TOKEN). • Data rates of 100 MBit/s
This can be done by several stations simultaneously. • Range of up to 200 km (MAN?)
If such a message arrives with a smaller ID then suppress it. • Support of up to 1000 stations, with distances of maximally 2 km
• Often used as Backbone for small LANs
If a message arrives with larger ID then pass it on.
If a CLAIM_TOKEN message arrives with own ID: this station is the new monitor. 802.3 LAN
Host Bridge
Tasks of the monitor station: FDDI ring

802.5
Bridge
• New generation of the token after a token loss LAN
• Reaction to ring collapse
• Removal of frame fragments
• Deletion of old, circulating frames • Successor: FDDI-II, supports besides normal data also synchronous circuit
switched PCM data (speech) and ISDN traffic
For each problem an own token is defined. Additionally – if necessary – also timers • Variant: CDDI (Copper Distributed Data Interface), with 100 MBit/s over Twisted
are used. Pair
Structure of FDDI Transmission within FDDI

Wiring within FDDI: 2 optical fiber rings with opposite transmission direction
Coding
• During normal operation, only the primary ring is 4B/5B code, thus coding of 4 bits of data in 5 bits which are transferred
used, the secondary ring remains in readiness
• If the ring breaks, the other one (also called Synchronization
protection ring) can be used. Transmission of a long preamble in order to synchronize the receiver to the sender
clock pulse. The clocks of all stations must run stable on at least 0.005%. With such
• If both rings break or if a station precipitates, the
a stability, frames with up to 4500 byte of data can be transferred without the
rings can be combined into only one, which has
receiver losing the clock pulse.
double length:
Protocols
The fundamental protocols of FDDI are similar to IEEE 802.5 (token ring): in order
to transmit data, a station must acquire the token. Then it transfers its frame and
takes it from the ring when it returns to it. Due to the expansion of FDDI, a single
token is unpractical. Therefore, FDDI transfers in the multiple token mode.
Two classes of stations exist: DAS (Dual Attachment Station) can be attached to
both rings, the cheaper SAS (Single Attachment Station) are only attached to one Ring and station management also are similar to IEEE 802.5, additionally a function
ring. for deviating traffic to the protection ring is included.

Synchronous Transmission of Data Data frames with FDDI

The data frames are similar to those used in the token ring format:
Original transmission principle within FDDI: Use of asynchronous frames, i.e.
sending can be started any time. ≥8 11 2/6 2/6 Up to 4480 4 1 1 Byte
Additionally, with FDDI-II also the use of synchronous frames for circuit switched Preamble DA SA Data FCS
PCM or ISDN data (telephony) is possible:
• every 125 µs a master station produces synchronous frames for reaching the Token
8000 samples / second necessary for PCM. Frame Control (FC) End Delimiter (ED)
S F E
Start Delimiter (SD) Frame Status Preamble D C D
• every frame consists of 16 byte for non-circuit-switched data and up to 96 byte for
circuit switched data (up to 96 PCM channels per frame).
• if a station once uses fixed slots in a frame, these are considered for it as • The preamble is used for the synchronization as well as for the preparation of the
reserved until the station releases them expressly (implicit reservation). stations to a following transmission
• Start and end delimiter are being used for marking the frame
• unused synchronous slots of the frame are assigned on request to any station.
• Frame control specifies the type of the frame: data, control,
synchronously/asynchronously,…
Here, also several tokens are differentiated for the possible traffic types.
• Frame status contains confirmation bits as in IEEE 802.5
• Addresses and the FCS are as in IEEE 802.5

03 Lan 4P PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

03 Lan 4P PDF

Uploaded by

Copyright:

Available Formats

Lehrstuhl für Informatik 4 Lehrstuhl für Informatik 4

Kommunikation und verteilte Systeme Kommunikation und verteilte Systeme

Network Categories Network Types for the Local Range

Lehrstuhl für Informatik 4 Lehrstuhl für Informatik 4

Ethernet Carrier Sense Multiple Access

Signal expansion 2. Station S2 also wants Expansion of the signal

Problem with CSMA Detection of Collisions

Lehrstuhl für Informatik 4 Lehrstuhl für Informatik 4

Data transmission with CSMA/CD Performance of CSMA/CD

Message Format for CSMA/CD The Ethernet Frame

Preamble SFD DA SA L/T Data Padding FCS

Lehrstuhl für Informatik 4 Lehrstuhl für Informatik 4

Resolving Collisions in Ethernet Binary Exponential Backoff

Ethernet Ethernet Parameters

Lehrstuhl für Informatik 4 Lehrstuhl für Informatik 4

Naming of Ethernet Variants Ethernet - Configurations

1 – Capacity in MBit/s (10, 100, 1000 or 10G)

Infrastructure Components: Hub & Repeater 10Base-T (Twisted Pair)

Lehrstuhl für Informatik 4 Lehrstuhl für Informatik 4

Fast Ethernet Infrastructure Components: Switch

Lehrstuhl für Informatik 4 Lehrstuhl für Informatik 4

Future of the Ethernet Token Bus

• In a bus topology, ordering is made regarding station addresses:

• Variants for twisted pair are currently in development (how to apply

Message Exchange in Token Bus Problems with Token Bus

Lehrstuhl für Informatik 4 Lehrstuhl für Informatik 4

Example Token Ring

11 11 10 00 11 • the token is cyclically passed on

Token Ring Sending and Receiving

Transmission state Receiver Transmitter

Lehrstuhl für Informatik 4 Lehrstuhl für Informatik 4

Access within a Token Ring Access within a Multiple Token Ring

1. Station 2 waits for free token

occupied one (occupied token = 2. Station 2 changes free token into an

ms) is not exceeded) remove

4. Station 1 copies the frame. Station 2

Lehrstuhl für Informatik 4 Lehrstuhl für Informatik 4

Ring Maintenance Fiber Distributed Data Interface (FDDI)

Tasks of the monitor station: FDDI ring

Structure of FDDI Transmission within FDDI

Lehrstuhl für Informatik 4 Lehrstuhl für Informatik 4

Synchronous Transmission of Data Data frames with FDDI

You might also like