Frame Relay Notes

Download as doc, pdf, or txt
Download as doc, pdf, or txt
You are on page 1of 3

Frame Relay is a standardized WAN technology that specifies the physical and logical link layers

of digital telecommunications channels using a packet switching methodology. Originally designed


for transport across Integrated Services Digital Network (ISDN) infrastructure, it may be used today
in the context of many other network interfaces. Network providers commonly implement Frame
Relay for voice (VoFR) and data as an encapsulation technique, used between local area networks
(LANs) over a wide area network (WAN). Each end-user gets a private line (or leased line) to a
frame-relay node. The frame-relay network handles the transmission over a frequently-changing
path transparent to all end-users.
With the advent of Ethernet over fiber optics, MPLS, VPN and dedicated broadband services such
as cable modem and DSL, the end may loom for the Frame Relay protocol and encapsulation.
[citation needed] However many rural areas remain lacking DSL and cable modem services. In such
cases the least expensive type of non-dial-up connection remains a 64-kbit/s frame-relay line. Thus
a retail chain, for instance, may use Frame Relay for connecting rural stores into their corporate
WAN.

A basic Frame Relay network


The designers of Frame Relay aimed to a telecommunication service for cost-efficient data
transmission for intermittent traffic between local area networks (LANs) and between end-points in
a wide area network (WAN). Frame Relay puts data in variable-size units called "frames" and
leaves any necessary error-correction (such as re-transmission of data) up to the end-points. This
speeds up overall data transmission. For most services, the network provides a permanent virtual
circuit (PVC), which means that the customer sees a continuous, dedicated connection without
having to pay for a full-time leased line, while the service-provider figures out the route each frame
travels to its destination and can charge based on usage.
An enterprise can select a level of service quality - prioritizing some frames and making others less
important. Frame Relay can run on fractional T-1 or full T-carrier system carriers. Frame Relay
complements and provides a mid-range service between basic rate ISDN, which offers bandwidth at
128 kbit/s, and Asynchronous Transfer Mode (ATM), which operates in somewhat similar fashion
to frame Relay but at speeds from 155.520 Mbit/s to 622.080 Mbit/s.
Frame Relay has its technical base in the older X.25 packet-switching technology, designed for
transmitting data on analog voice lines. Unlike X.25, whose designers expected analog signals,
Frame Relay offers a fast packet technology, which means that the protocol does not attempt to
correct errors. When a Frame Relay network detects an error in a frame, it simply drops that frame.
The end points have the responsibility for detecting and retransmitting dropped frames. (However,
digital networks offer an incidence of error extraordinarily small relative to that of analog
networks.)
Frame Relay often serves to connect local area networks (LANs) with major backbones as well as
on public wide-area networks (WANs) and also in private network environments with leased lines
over T-1 lines. It requires a dedicated connection during the transmission period. Frame Relay does
not provide an ideal path for voice or video transmission, both of which require a steady flow of
transmissions. However, under certain circumstances, voice and video transmission do use Frame
Relay.
Frame Relay originated as an extension of Integrated Services Digital Network (ISDN). Its
designers aimed to enable a packet-switched network to transport the circuit-switched technology.
The technology has become a stand-alone and cost-effective means of creating a WAN.
Frame Relay switches create virtual circuits to connect remote LANs to a WAN. The Frame Relay
network exists between a LAN border device, usually a router, and the carrier switch. The
technology used by the carrier to transport data between the switches is variable and may differ
among carriers (i.e. to function, a practical Frame Relay implementation need not rely solely on its
own transportation mechanism).
The sophistication of the technology requires a thorough understanding of the terms used to
describe how Frame Relay works. Without a firm understanding of Frame Relay, it is difficult to
troubleshoot its performance.
Frame Relay has become one of the most extensively-used WAN protocols. Its cheapness
(compared to leased lines) provided one reason for its popularity. The extreme simplicity of
configuring user equipment in a Frame Relay network offers another reason for Frame Relay's
popularity.
Frame-relay frame structure essentially mirrors almost exactly that defined for LAP-D. Traffic
analysis can distinguish Frame Relay format from LAP-D by its lack of a control field.
Each Frame Relay Protocol data unit (PDU) consists of the following fields:
1. Flag Field. The flag is used to perform high-level data link synchronization which indicates
the beginning and end of the frame with the unique pattern 01111110. To ensure that the
01111110 pattern does not appear somewhere inside the frame, bit stuffing and destuffing
procedures are used.
2. Address Field. Each address field may occupy either octet 2 to 3, octet 2 to 4, or octet 2 to
5, depending on the range of the address in use. A two-octet address field comprises the
EA=ADDRESS FIELD EXTENSION BITS and the C/R=COMMAND/RESPONSE BIT.
1. DLCI-Data Link Connection Identifier Bits. The DLCI serves to identify the virtual
connection so that the receiving end knows which information connection a frame
belongs to. Note that this DLCI has only local significance. A single physical channel
can multiplex several different virtual connections.
2. FECN, BECN, DE bits. These bits report congestion:
• FECN=Forward Explicit Congestion Notification bit
• BECN=Backward Explicit Congestion Notification bit
• DE=Discard Eligibility bit
3. Information Field. A system parameter defines the maximum number of data bytes that a
host can pack into a frame. Hosts may negotiate the actual maximum frame length at call
set-up time. The standard specifies the maximum information field size (supportable by any
network) as at least 262 octets. Since end-to-end protocols typically operate on the basis of
larger information units, Frame Relay recommends that the network support the maximum
value of at least 1600 octets in order to avoid the need for segmentation and reassembling by
end-users.
4. Frame Check Sequence (FCS) Field. Since one cannot completely ignore the bit error-rate
of the medium, each switching node needs to implement error detection to avoid wasting
bandwidth due to the transmission of erred frames. The error detection mechanism used in
Frame Relay uses the cyclic redundancy check (CRC) as its basis.
The Frame Relay network uses a simplified protocol at each switching node. It achieves simplicity
by omitting link-by-link flow-control. As a result, the offered load has largely determined the
performance of Frame Relay networks. When offered load is high, due to the bursts in some
services, temporary overload at some Frame Relay nodes causes a collapse in network throughput.
Therefore, frame-relay networks require some effective mechanisms to control the congestion.
Congestion control in frame-relay networks includes the following elements:
1. Admission Control. This provides the principal mechanism used in Frame Relay to ensure
the guarantee of resource requirement once accepted. It also serves generally to achieve high
network performance. The network decides whether to accept a new connection request,
based on the relation of the requested traffic descriptor and the network's residual capacity.
The traffic descriptor consists of a set of parameters communicated to the switching nodes at
call set-up time or at service-subscription time, and which characterizes the connection's
statistical properties. The traffic descriptor consists of three elements:
2. Committed Information Rate (CIR). The average rate (in bit/s) at which the network
guarantees to transfer information units over a measurement interval T. This T interval is
defined as: T = Bc/CIR.
3. Committed Burst Size (BC). The maximum number of information units transmittable
during the interval T.
4. Excess Burst Size (BE). The maximum number of uncommitted information units (in bits)
that the network will attempt to carry during the interval.
Once the network has established a connection, the edge node of the Frame Relay network must
monitor the connection's traffic flow to ensure that the actual usage of network resources does not
exceed this specification. Frame Relay defines some restrictions on the user's information rate. It
allows the network to enforce the end user's information rate and discard information when the
subscribed access rate is exceeded.
Explicit congestion notification is proposed as the congestion avoidance policy. It tries to keep the
network operating at its desired equilibrium point so that a certain Quality of Service (QoS) for the
network can be met. To do so, special congestion control bits have been incorporated into the
address field of the Frame Relay: FECN and BECN. The basic idea is to avoid data accumulation
inside the network. FECN means Forward Explicit Congestion Notification. The FECN bit can be
set to 1 to indicate that congestion was experienced in the direction of the frame transmission, so it
informs the destination that congestion has occurred. BECN means Backwards Explicit Congestion
Notification. The BECN bit can be set to 1 to indicate that congestion was experienced in the
network in the direction opposite of the frame transmission, so it informs the sender that congestion
has occurred.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy