• Skip to main content
  • Skip to primary sidebar
  • Skip to secondary sidebar
  • Skip to footer

Computer Notes

Library
    • Computer Fundamental
    • Computer Memory
    • DBMS Tutorial
    • Operating System
    • Computer Networking
    • C Programming
    • C++ Programming
    • Java Programming
    • C# Programming
    • SQL Tutorial
    • Management Tutorial
    • Computer Graphics
    • Compiler Design
    • Style Sheet
    • JavaScript Tutorial
    • Html Tutorial
    • Wordpress Tutorial
    • Python Tutorial
    • PHP Tutorial
    • JSP Tutorial
    • AngularJS Tutorial
    • Data Structures
    • E Commerce Tutorial
    • Visual Basic
    • Structs2 Tutorial
    • Digital Electronics
    • Internet Terms
    • Servlet Tutorial
    • Software Engineering
    • Interviews Questions
    • Basic Terms
    • Troubleshooting
Menu

Header Right

Home » Networking » Routing » Algorithm CR (Constraint-based Routing)
Next →
← Prev

Algorithm CR (Constraint-based Routing)

By Dinesh Thakur

The CR (Constraint-based Routing) algorithm is applied when opening the way or if it reopens path is dynamic.

In addition to the topology constraints used by conventional routing algorithms, the CR algorithm calculates routes based on throughput constraints or administrative strip. The paths calculated by the RC protocol are not necessarily shorter. Indeed, the shortest path may not meet the bandwidth capacity requested by the LSP. The LSP can thus take another route, slower but have the required bandwidth capacity. In this way, traffic is distributed more evenly on the network.

The CR algorithm can be performed in real time or not. In the first case, the number of LSPs to cross is calculated arbitrary instants by routers on the basis of local information. In the second case, a server loads, based on information collected on the network, to calculate the paths periodically and automatically reconfigure routers with the new paths calculated.

The routing protocol is necessary to transport routing information. In the case of the CR algorithm, the routing protocol must carry, in addition to the topology information, constraints such as bandwidth requirements. The propagation of such information is more frequently than in the case of a standard IGP, since there are more factors may change. To avoid overloading the network, it must, however, ensure that the information propagation frequency is not too important. A compromise must be found between the need to update the information and that to avoid excessive propagation.

Designing a system for MPLS traffic engineering requires browsing the following steps:

1. Definition of the geographic extent of the MPLS system. Depends on the political administrative and network architecture.

2. Definition of member routers of MPLS system. This is to define the LSR entry, transit and exit of the MPLS system. For various reasons, it does not necessarily contain all network routers, especially if a router is not powerful enough or if it is not secure.

3. Definition of the hierarchy of the MPLS system. Two cases are possible: connect all MPLS LSR system and create a single level of hierarchy forming a largest MPLS or divide the network into several levels of hierarchy system. In the latter case, the LSR of first and second level of the hierarchy, which form the heart of the network are heavily meshed.

4. Definition of bandwidth requirements of LSP. The bandwidth requirements can be set by the end-to-end traffic matrix, which is not always available, or a statistical calculation based on the exploitation of LSP and regular updating of this information by constantly monitoring their traffic.

5. Definition of paths LSP. The roads are generally calculated dynamically by a CR real time. Where it proves difficult to achieve this real-time calculation, you can use a non-real-time CR algorithm.

6. Setting priorities LSP. Most can be assigned high priority to the LSP elapse before a large traffic. This will take the most routes short and to avoid overloading a large number of links in the network, while providing stability of routing and better utilization of resources.

7. Set the number of parallel paths between any two ends. You can configure multiple paths in parallel with roads physically different. This ensures load distribution more uniform traffic. The idea underlying LSP is set small for a better flexibility routing. This flexibility is the primary motivation parallel LSP.

8. Definition of the affinity of LSP and links. Colors can be assigned and links to the LSP according to administrative constraints. These colors are used determining the paths to choose from for the LSP.

9. Definition of adaptation and flexibility attributes. According developments network behavior, it is possible to find optimal paths for the LSP already calculated. The network administrator can accept or reject a new optimization LSP. It is not necessary that it be too frequent, because it could introduce instability routing. It should also include mechanisms to LSP rerouting in case of failure of an LSR.

The operation of an MPLS network follows the steps listed below:

1. Collection of statistical data using LSP at system startup. The purpose of this step is to calculate the traffic rate between each pair of routers. Existing statistical methods used to calculate the rate of traffic at the input and at the output of an interface but not up to a particular destination. The construction of the butt-end traffic matrix is ​​performed by estimation, which makes engineering difficult and inefficient traffic. Using LSP starting a MPLS system gives precisely the traffic rate between any two ends depending on the destination.

2. Operation of LSP with bandwidth constraints defined in step Previous. Step 1 above that allowed knowing the band needs bandwidth of each LSP; this information is used by the algorithm to recalculate the CR LSP with their real need for bandwidth.

3. Periodic updating LSP bandwidths. A periodic update the bandwidths of the LSP is required to ensure the development and adaptation of the network to changing traffic in the network.

4. Running the CR algorithm in real time. For efficient use of links, CR algorithm must be run on a dedicated server. Calculated on a server having all the topology information and attributes of all LSPs, this algorithm can achieve real time. The algorithm offers LSP with better performances compared to those of LSP already open. The CR algorithm must run in real time to reflect a failure of one LSP. The algorithm can then quickly determine a new LSP able to handle the traffic waiting.

You’ll also like:

  1. What is Routing? Type of Routing.
  2. SQL UNIQUE Constraint
  3. SQL DEFAULT Constraint
  4. SQL CHECK Constraint
  5. SQL PRIMARY KEY Constraint
Next →
← Prev
Like/Subscribe us for latest updates     

About Dinesh Thakur
Dinesh ThakurDinesh Thakur holds an B.C.A, MCDBA, MCSD certifications. Dinesh authors the hugely popular Computer Notes blog. Where he writes how-to guides around Computer fundamental , computer software, Computer programming, and web apps.

Dinesh Thakur is a Freelance Writer who helps different clients from all over the globe. Dinesh has written over 500+ blogs, 30+ eBooks, and 10000+ Posts for all types of clients.


For any type of query or something that you think is missing, please feel free to Contact us.


Primary Sidebar

Networking

Networking Tutorials

  • Network - Home
  • Network - Uses
  • Network - Advantages
  • Network - Classification
  • Network - Architecture Type
  • Nework - Networks Vs Comms

Networking Devices

  • Network - Modem
  • Network - Routers Types
  • Network - Bluetooth
  • Network - RS-232C
  • Network - Hub
  • Network - Devices
  • Network - Bridges
  • Network - Repeaters
  • Network - Routers
  • Network - Switching Hubs
  • Network - Transceiver
  • Network - Multiplexer
  • Network - Gateway
  • Network - BNC Connector
  • Network - Optical Connectors
  • Network - NICs
  • Networking Protocol

  • Protocol - Definition
  • Protocol - IP
  • Protocol - Aloha
  • Protocol - MAC Layer
  • Protocol - Sliding Window
  • Protocol - Stop & Wait
  • Protocol - Network Protocols
  • Protocol - Token Passing
  • Protocol - SIP
  • Protocol - Ad-Hoc Networks Routing
  • Protocol - Lap-f
  • Protocol - Point-to-Point
  • Protocol - PPP
  • Protocol - PPP Phases
  • Protocol - LDP
  • Protocol - MPLS
  • Protocol - MPOA
  • Protocol - HDLC
  • Protocol - Distance Vector routing
  • Protocol - IGMP
  • Protocol - ICMP
  • Protocol - SLIP
  • Protocol - DVMRP
  • Protocol - SDLC
  • Protocol - Routing
  • Protocol - UDP
  • Protocol - ARP and RARP
  • Protocol - Link-State
  • Protocol - ARP Table
  • Protocol - RTP
  • Protocol - NHRP
  • Network Addressing

  • Addressing - Home
  • Addressing - SubNetting
  • Addressing - Classless
  • Addressing - Classes or Classful
  • Addressing - IPV4 vs IPV6
  • Addressing - IPv6
  • Addressing - Subnet Mask
  • Addressing - MAC Address
  • Addressing - Supernetting
  • Addressing - Private IP
  • Addressing - IPv4
  • Addressing - Public IP
  • Addressing - Multihomed
  • Addressing - Indirect Addressing
  • Addressing - ASP
  • Addressing - VLSM
  • Addressing - Routing Algorithms
  • Addressing - Hierarchical Routing
  • Addressing - Routing
  • Addressing - Distributed Routing
  • Addressing - Data Routing
  • Addressing - Services
  • Addressing - IP forwarding
  • Addressing - Aging
  • Addressing - Algorithm CR
  • Networking Media

  • Transmission - Home
  • Transmission - Modes
  • Transmission - Media
  • Transmission - System
  • Transmission - Bound
  • Transmission - Unbound
  • Transmission - Baseband
  • Transmission - Wired
  • Transmission - Fiber Benfits
  • Transmission - Infrared
  • Transmission - UnGuided
  • Transmission - Microwave
  • Transmission - Infrared
  • Transmission - Radio Wave
  • Transmission - Network
  • Transmission - Digital Signal
  • Transmission - Data
  • Transmission - Asynchronous
  • Transmission - Sync Vs Async
  • Cable - Twisted-Pair
  • Cable - Coaxial
  • Cable - UTP and STP
  • Cable - Fiber Optics
  • Cable - Gigabit Ethernet
  • Cable - Fast Ethernet
  • Cable - Ethernet Cable
  • Cable - Fiber-Optic Using
  • Cable - CATV
  • Cable - 100Base T
  • Cable - 10BASE T
  • Cable - 10 Base 2
  • Cable - 10 Base 5
  • Networking Types

  • IEEE - 802.11
  • IEEE - 802.5
  • IEEE - 802.15
  • IEEE - 802.11e
  • IEEE - 802.11n
  • Network - Ethernet
  • Network - Arpanet
  • Network - Frame Relay
  • Network - X.25
  • Network - Telephone
  • Network - WSN
  • Network - Metro Ethernet
  • Network - WAN Ethernet
  • Network - Wireless Mesh
  • Network - SAN
  • Network - SNA
  • Network - Cisco Architecture
  • Network - Vlan
  • Network - FDDI
  • Network - 100VG-Any
  • Network - EPON
  • Network - ISDN
  • Network - ARCNet
  • Network - Passive Optical
  • Networking Reference Models

  • Models - TCP/IP
  • Models - OSI
  • Models - MAC Layer
  • Models - Network Layer
  • Models - MAC Layer Functions
  • Models - TCP/IP Vs OSI
  • Models - CSMA
  • Models - CSMA/CD
  • Models - CSMA/CA
  • Models - CDMA
  • Models - STDM
  • Models - FDMA
  • Models - TDMA
  • Models - SDH
  • Models - CDM
  • Models - Multiplexing
  • Models - Reference
  • Models - Random Access Methods
  • Models - TCP/IP Architecture
  • Models - FDM
  • Models - IP Header
  • Models - OTN
  • Models - Amplitude Levels
  • Models - MIMO
  • Models - Plesiochronous Media
  • Models - Half Duplex
  • Models - ISO Architecture
  • Models - Data-Link Layer
  • Models - WDM
  • Models - Duplex
  • Models - Ethernet FDSE
  • Networking Switching Techniques

  • Switching - Home
  • Switching - Techniques
  • Switching - Packet
  • Switching - Circuit
  • Switching - Message
  • Switching - Packet Vs virtual Circuit
  • Switching - Cell
  • Switching - ATM Cell Structure
  • Switching - Virtual Circuit Vs Datagram
  • Switching - Time Space
  • Switching - Modulation
  • Switching - Cell Relay
  • Switching - ATM Structure
  • Switching - VC Vs PVC
  • Switching - Packet and Circuit
  • Switching - VPC
  • Switching - IP
  • Switching - Logical Channels
  • Switching - TDM
  • Switching - FDM
  • Network Codes

  • Codes - CRC
  • Codes - Error Correction and Detection
  • Codes - Hamming
  • Codes - Piggybacking
  • Codes - Encoding Techniques
  • Codes - Error Control
  • Codes - Parity Check
  • Codes - Parity bit
  • Codes - Bit Error
  • Codes - CRC
  • Codes - Transmission Errors
  • Codes - Error Detection and Correction
  • Network Communication

  • Communication - Home
  • Communication - Satellite
  • Communication - Wireless
  • Communication - Data Type
  • Communication - Congestion Control
  • Communication - Network
  • Communication - Data
  • Communication - Software
  • Communication - Layering Process
  • Networking Signaling

  • Signal - Analog
  • Signal - Digital
  • Signal - Analog Vs Digital
  • Signal - Digitization
  • Network Security

  • Security - Home
  • Security - Requirements
  • Security - Threats
  • Security - Services

Other Links

  • Networking - PDF Version

Footer

Basic Course

  • Computer Fundamental
  • Computer Networking
  • Operating System
  • Database System
  • Computer Graphics
  • Management System
  • Software Engineering
  • Digital Electronics
  • Electronic Commerce
  • Compiler Design
  • Troubleshooting

Programming

  • Java Programming
  • Structured Query (SQL)
  • C Programming
  • C++ Programming
  • Visual Basic
  • Data Structures
  • Struts 2
  • Java Servlet
  • C# Programming
  • Basic Terms
  • Interviews

World Wide Web

  • Internet
  • Java Script
  • HTML Language
  • Cascading Style Sheet
  • Java Server Pages
  • Wordpress
  • PHP
  • Python Tutorial
  • AngularJS
  • Troubleshooting

 About Us |  Contact Us |  FAQ

Dinesh Thakur is a Technology Columinist and founder of Computer Notes.

Copyright © 2025. All Rights Reserved.

APPLY FOR ONLINE JOB IN BIGGEST CRYPTO COMPANIES
APPLY NOW