Download
1 / 35
360 likes | 540 Views
Channel Access Methods. When several devices are connected to a single channel, there must be some rules to govern these devices when they access, transmit, and release the channel . There are three basic channel access methods to provide for an orderly and efficient use of that capacity:
E N D
Channel Access Methods • When several devices are connected to a single channel, there must be some rules to govern these devices when they access, transmit, and release the channel . • There are three basic channel access methods to provide for an orderly and efficient use of that capacity: • Contention • Polling • Token passing • Different access methods have different overhead effects on network traffic.
Contention • With contention systems, network devices may transmit • whenever they want. • With this technique, no control is exercised to determine whose • turn it is, all stations contend for time. No referee mandates • when a device may or may not use the channel. • This scheme is simple to design. • The scheme provides equal access rights to all stations. • Stations simply transmit whenever they are ready, without • considering what other stations are doing. • Unfortunately, the "transmit whenever ready" strategy has one • important shortcoming. • Stations can transmit at the same time. • When this happens, the resulting co-mingling of signals usually • damages both to the point that a frame's information is lost. • This unhappy event is called a "collision."
Collision • Newer contention protocols were developed that called for stations • to listen to the channel first before transmitting. • If the listening station detects a signal, it will not start • transmitting and try again later. • These protocols are called CSMA (Carrier Sense, Multiple Access • with collision detection) protocols. • These protocols will reduce collisions. • However, collisions may still occur when two stations sense the • cable, detect nothing, and subsequently transmit. • In order to reduce collisions, CSMA/CD protocols compute a • random backoff time before retransmitting the frame (as shown in • the flow diagram). Examples of CSMA/CD protocols : • IEEE 802.3 (Ethernet )
Frame format of a CSMA/CD bus Networks 7 octets 1 octet 2 or 6 octets 2 or 6 octets 2 octets <= 1500 4 octets
Frame format & operational parameters • A medium access control (MAC) unit is responsible for the encapsulation and de-encapsulation of frames for transmission and reception on the cable, error detection, and implementation of MAC algorithm. • Each frame consists of 8 fields. All the fields are of fixed length except the data and padding fields. • Preamble=> Sent at the head of all frames. ?used to achieve bit synchronization before the actual frame contents are received. It is a sequence of seven octets. (each equal to the binary pattern 10101010). • SFD (start of frame delimiter)=> Single octet 10101011, signals the start of a valid frame t the receiver, immediately follows the preamble.
Frame format & operational parameters • Destination & Source addresses => Specify the intended destination station & originating station. Each address can be either 16 or 48 bits. If the first bit in the address field is 0, it specifies the address is an individual address and the transmitted frame is intended for a single destination. If the bit is 1, it specifies a group address and the frame is intended either for a logically related group or for all others stations. In this case, the address field is set to all binary 1s. • Length indicator => Specifies the number of octets in the data field. • Pad => If the value of length indicator is less than the minimum frame size, a sequence of octets is added, known as padding. • FCS => Contains CRC value that is used fir error detection.
Advantages • CSMA/CD control software is relatively • simple and produces little overhead. • CSMA/CD network works best on a bus • topology with bursty transmission. Bursty • traffic is characterized by short, sporadic • transmissions. Example: interactive • terminal-host traffic. • This technique is efficient for light to • moderate load.
Disadvantages • CSMA/CD protocols are probabilistic and depends on the • network (cable) loading. Performance tends to collapse • under heavy load. • Considered unsuitable for channels controlling automated • equipment that must have certain control over channel • access. • We cannot set priorities to give faster access to some • devices.
Polling access method • Polling is an access method that designates one device • (called a "controller", "primary", or "master") as a channel • access administrator. • This device (Master) queries each of the other devices • (“secondaries”) in some predetermined order to see • whether they have information to transmit. • If so, they transmit (usually through the master).
Polling access method • Secondaries may be linked to the master in many different • configurations. • One of the most common polling topologies is a star, where the • points of the star are secondaries and the master is the hub. • To get data from a secondary, the master addresses a request for • data to the secondary, and then receives the data from the • secondary sends (if secondary sends any). • The primary then polls another secondary and receives the data • from the secondary, and so forth. • System limits how long each secondary can transmit on • each poll.
Advantages • Polling centralizes channel access control. • Maximum and minimum access times and data rates on the • channel are predictable and fixed. • Priorities can be assigned to ensure faster access from some • secondaries. • When many stations have data to transmit over an extended • period of time, round-robin techniques can be very efficient. • If only a few stations have data to transmit over an extended • period of time, then there is a considerable overhead in • passing the turn from station to station, because most of the • stations will not transmit but simply pass their turns. • Polling is deterministic and is considered suitable for • channels controlling some kinds of automated equipment.
Disadvantages • Polling systems often use a lot of bandwidth sending notices • and acknowledgments or listening for messages. • Line turnaround time on a half- duplex line further increases • time overhead. • This overhead reduces both the channel's data rate under low • loads and its throughput.
Token passing System • In token-passing systems, a small frame (the token) is • passed in an orderly fashion from one device to another. • A token is a special authorizing message that temporarily • gives control of the channel to the device holding the token. • Passing the token around distributes access control among • the channel's devices. • Each device knows from which device it receives the token • and to which device it passes the token.(see fig.) • Each device periodically gets control of the token, performs • its duties, and then retransmits the token for the next device • to use. • System rules limit how long each device can control the • token.
Token Ring • Token ring networks are primarily used in technical and office environments. • Whenever a station wishes to send a frame, it first waits for the token. When the station gets the token, it start sending frame. • The intended recipient retains a copy of the frame and indicates by setting the response bits at the tail of the frame. • A station releases the token in one of the two ways depending on the bit rate of the ring. • In slower ring (4 Mbps), the token is released only after the response bits have been received. • In higher speed rings (16 Mbps), the token is released after transmitting the last bit of a frame (early token).
Token format & Frame format in Token Ring Token Format: 1 1 1 octets Frame Format: octets <5000 1 1 1 2/6 2/6 4 1 1 FCS coverage End of frame Start of frame
Field Descriptions of a Token Ring Start delimiter (SD) J K O J K O O O End delimiter (ED) J K 1 J K 1 I E P P P T M R R R Access control (AC) Frame control (FC) FF Z Z Z Z Z Z Source and destination Address (SA/DA) I/G 15/47 bit address AC xx ACxx Frame status (FS)
Field Descriptions of a Token Ring • Start delimiter & end delimiter fields (SD & ED): • Special bit sequence used to detect the start and end of each transmitted token or frame. • The symbol J has the same polarity as the preceding symbol and K has the opposite polarity to the preceding symbol. • Only the 6 symbols are used to indicate a valid end of frame. • The other 2 bits (I & E): • In token I = 0, E = 0 • In normal frame, I = 1 => first/intermediate frame I = 0 => last frame in a sequence E = 0 => no error E = 1 => error has been detected
Field Descriptions of a Token Ring • Access control field (AC): Used to control access to the ring. It consists of: • Priority bits • The token • Monitor bits • Reservation bits • Priority bits (P): When it is part of the token, the priority bits (P) indicate the priority of the token. • Token bit (T): T = 0 => token • T = 1 => frame • Monitor bit (M): Used to prevent a frame from circulating around the ring continuously. • Reservation bits (R): Allow DTEs holding high-priority frames to request
Field Descriptions of a Token Ring • Frame control field (FC): Defines the type of the frame and certain control functions. Consists of : • F => frame type bits (MAC frame) • Z => control bits • Source address (SA)& Destination address (DA)fields: • 16/48 bits long. • First bit = 0 => individual address, For SA, it is always 0. • First bit = 1 => group addresses • If DA is all 1s => broadcast address
Field Descriptions of a Token Ring • INFO: user data Max length is no specified. However, the max time for which a station can send a frame is limited. In practice, max limited to 5000 octets. • Frame check sequence (FCS) field=> it is a 32-bit CRC. The frame status (FS) consists of two fields: • Address-recognized bits (A): A = 1 => frame is recognized by on/more DTEs (i.e. addressed DTE is active), initially A = 0. • Frame-copied bits (C): C = 1=> frame is copied by DTE, initially C = 0.
Token Ring Mac sublayer operation a) Transmit
Token Ring Mac sublayer operation b) Receive
Token Bus • Token bus networks are used in the manufacturing industry (for factory automation) and process control industry since it has the ability to prioritize the transmission frame and it is deterministic. • The operation of token bus is very similar to that of token ring. • However we use different medium access methods (broadcast for bus and sequential for ring). • The procedures used for handling management of the logical ring (initialization and lost token) are different.
Token Bus • All DTEs that can initiate the transmission of a frame are linked in the form of a logical ring. • The token passed physically using the bus around the logical ring. • When a DTE gets the token from its predecessor, it can transmit any frames during a defined max. time. Then it will pass the token to its known successor. • When a DTE transmits a frame on the medium, it received by all DTEs. • There is a max. time a DTE need to wait for a response to a transmitted frame before it assumes the transmitted frame is corrupted or destination DTE is not working. This time is known as slot time. • Slot time = 2 x (transmission path delay) + processing delay
Advantages • Even though there is more overhead using tokens than using CSMA/CD, performance differences are not noticeable with light traffic and are considerably better with heavy loads because CSMA/CD will spend a lot of time resolving collisions. • A deterministic access method such as Token Ring guarantees that every node will get access to the network within a given length of time. In probabilistic access method (such as CSMA/CD) nodes have to check for network activity when they want to access the network.
Disadvantages • Token Ring network is much more expensive than Ethernet. This is due to the complex token passing protocol. Token Ring components are more expensive than Ethernet or ARCnet components. • Token Ring architecture is not very easy to extend to wide-area networks (WANs).
