What are the advantages and disadvantages of datagram approach?

- Today’s packet switching networks make use of a basic transfer unit commonly known as the datagram. 

- In such packet switched networks, the order of the data packets arrival, time of arrival and delivery comes with no guarantee. 

- The first packet switching network to use the datagrams was CYCLADES. 

- Datagrams are known by different names at different levels of the OSI model. 

- For example, at layer 1 we call it Chip, at layer 2 it is called Frame or cell, data packet at layer 3 and data segment at layer 4. 

- The major characteristic of a datagram is that it is independent i.e., it does not rely on any other thing for the information required for exchange.

- The duration of a connection between any two points is not fixed such as in telephone conversations. 

- Virtual circuits are just the opposite of the datagrams. 

- Thus, a datagram can be called as a self containing entity. 

- It consists of information sufficient for routing it from the source to the destination without depending up on the exchanges made earlier. 

- Often, a comparison is drawn between the mail delivery service and the datagram service. 

- The user’s work is to just provide the address of the destination. 

- But he/she is not guaranteed the delivery of the datagram and if the datagram is successfully delivered, no confirmation is sent to the user. 

- The data gram are routed to some destination without help of a predetermined path. 

- The order in which the data has to be sent or received is given no consideration. 

- It is because of this that the datagrams belonging to a single group might travel over different routes before they reach their common destination. 

Advantages of Datagram Approach

1. Datagrams can contain the full destination address rather than using some number.
2. There is no set up phase required for the datagram circuits. This means that no resources are consumed.
3. If it happens during a transmission that one router goes down, the datagrams that will suffer will include only those routers which would have been queued up in that specific router. The other datagrams will not suffer.
4. If any fault or loss occurs on a communication line, the datagrams circuits are capable of compensating for it.
5. Datagrams play an important role in the balancing of the traffic in the subnet. This is so because halfway the router can be changed.

Disadvantages of Datagram Approach

1. Since the datagrams consist of the full destination address, they generate more overhead and thus lead to wastage of the bandwidth. This in turn makes using datagram approach quite costly.
2. A complicated procedure has to be followed for datagram circuits for determining the destination of the packet.
3. In a subnet using the datagram approach, it is very difficult to keep congestion problems at bay.
4. The any-to-any communication is one of the key disadvantages of the datagram subnets. This means that if a system can communicate with any device, any of the devices can communicate with this system. This can lead to various security issues.
5. Datagram subnets are prone to losing or re - sequencing the data packets during the transition. This puts a great burden on the end systems for monitoring, recovering, and reordering the packets as they were originally.
6. Datagram subnets have less capability of dealing with congestion control as well as flow control. This happens because the direction of the incoming traffic is not specified. In the virtual circuit subnets, the flow of the packets is directed only along the virtual circuits thus making it comparatively easy for controlling it.
7. The unpredictable nature of the flow of the traffic makes it difficult to design the datagram networks. 

What is inter-network routing?

In this article we shall discuss about inter-network routing. Before moving to that there are certain terms with which you should be familiar:

Ø  End systems: The ISO (the international standards of organization) defines the end systems as the network elements that do not have the ability of forwarding the packets across the networks. Sometimes the term host is used to refer to the end systems.

Ø  Intermediate systems: These are the network elements that have the ability of forwarding the packets across the network. Most common examples are routers, switches, bridges and so on.

Ø  Network: It can be defined as a part of the inter-network infrastructure encompassing various elements including hubs, repeaters, bridges and so on. The networks are bounded by the intermediate systems.

Ø Router: This is one of the intermediate systems that is used for connecting various networks with each other. It might support one protocol (router) or many protocols (multi-protocol router). Its hardware part is optimized especially for performing routing. The software part is responsible for carrying out the routing and takes care of the routing tables.

Apart from these devices, there are 3 types of addresses involved in inter-network routing:

Ø  The inter-network address: The host address and the network address are combined together to form this address. This is used for unique identification of a host over the inter-network.

Ø The host address or host ID: This ID might be assigned by the administrator or might be simply the physical address of the host. It is used for the unique identification of the host on its network.

Ø  The network address or network ID: This is address of a network for identifying it in an inter-network.

All the data packets consist of a network layer header. This network layer header consists of the following when the packet is transmitted from one host to another:

ØThe address of the source inter-network: This address combines the address of the source host and the source network.

ØThe address of the destination inter-network: This address combines the address of the destination host and the destination network.

ØThe hop count: This usually begins at zero and is numerically incremented when the packet crosses a router. Or in the opposite case it might be assigned some maximum value which might be decremented on reaching a router. The purpose of using the hop count is to make sure that the packet does not keeps on circulating endlessly in the network.

- For inter-network routing, two things have to be known.

- Firstly, how do you reach other routers which lie in the same network and secondly, how do you reach other routers which lie in other networks? 

- The answer to the first question is easy as it is the common routing problem among two hosts residing over the same network. 

- This routing is handled by the interior gateway protocol and it is different for different networks since only local routing info is required. 

- In this case, the commonly used protocol is the open shortest path first or OSPF protocol. 

- The routing between two different networks is performed using the exterior gateway protocol. 

- This is actually the problem of inter-network routing. 

- Here, the commonly used protocol is the BGP or the border gateway protocol. 

- The graph for inter-network routing is quite different from the one that is used in the network routing. 

- This is so because the routers which lie in the same network can be thought of as being directly connected to one another for routing across inter-network. - All the networks in an inter-network function as though they are one large unit. 

Explain Border Gateway Protocol (BGP)?

- BGP or Border gateway protocol is the set of rules that is implemented for making the routing decisions at the core of the internet. 

- It involves the use of the IP networks table or we can say prefixes which are used for designating the reach-ability of the network to the autonomous systems. 

- This protocol falls under the category of the path vector protocol or sometimes classified as a variant of the distance vector routing protocols. 

- The metrics of the IGP or the interior gateway protocol are not used by the border gateway protocol rather paths, rule sets or polices are used for making decisions for routing. 

- This is why the border gateway protocol is often called a reach-ability protocol rather than being termed as a routing protocol. 

- The BGP has ultimately replaced the EGP or the exterior gateway protocol. 

- This is so because it allows the full decentralization of the routing process for making transition between the ARPANET model’s core and the decentralized system that consists of a NSFNET backbone and the regional networks associated with it. 

- The present version of the BGP that is being used is the version 4. 

- The earlier versions were discarded for being obsolete. 

- The major advantage is of the classless inter-domain routing and availability of a technique called the route aggregation for making reductions in the routing size. 

- The use of the BGP has made the whole routing system a decentralized system.

- BGP is used by most of the internet service providers for establishing a route between them. 

- This is done especially when the ISPs are multi-homed. 

- That’s why even though it is not used directly by the users; it is still one of the most important protocols in networking. 

- The BGP is used internally by a number of large private IP networks. 

- For example, it is used to combine many large open shortest path first or OSPF networks where these networks do not have the capability to scale to the size by themselves. 

- BGP is also used for multi-homing a network so as to provide a better redundancy. 

- This can be either to many ISPs or to a single ISP’s multi access points. 

- Neighbors of the border gateway protocol are known as the peers. 

- They are created by manually configuring the two routers so as to establish a TCP session on the port. 

- Messages called the 19 byte keep alive messages are sent to the port periodically by the BGP speaker for maintaining the connection. 

- Among the various routing protocols, the most unique is BGP since it relies up on TCP for transporting. 

- When the protocol is implemented in the autonomous system among two peers, it is called IBGP or the internal border gateway protocol. 

- The protocol is termed as the EBGP or the external border gateway protocol when it runs between many autonomous systems.

- Border edge routers are the routers that are implemented on the boundary for exchanging information between various autonomous systems.

- BGP speakers have the capability for negotiating with the session’s option capabilities such as the multi-protocol extensions and a number of recovery modes. 

- The NLRI (network layer reach-ability information) can be prefixed by the BGP speaker if at the time of the creation itself, the multi-protocol extensions are negotiated. 

- The NLRI is advertised along with some address family prefix. 

The family consists of the following:

Ø  IPv4

Ø  IPv6

Ø  Multicast BGP

Ø  IPv4/ IPv6 virtual private networks

- These days the border gateway protocol is being commonly employed as the generalized signaling protocol whose purpose is to carry information via the routes that might not form the global internet’s part. 

What are multi-protocol routers?

- There are routers that have the capability to route a number of protocols at the same time. 

- These routers are popularly known as the multi-protocol routers. 

- There are situations in networking where combinations of various protocols such as the appletalk, IP, IPX etc. are used. 

- In such situations normal typical router cannot help. This is where we use the multi-protocol routers. 

- Using the multi-protocol routers, information can be shared between the networks. 

- The multi-protocol router maintains an individual routing table for each of the protocols.

- The multi-protocol routers have to be used carefully since they cause an increase in the number of routing tables that are present on the network. 

- Each protocol is advertised individually by the router. 

A multiprotocol router consists of the following information:

Ø  Routing information protocol (RIP)

Ø  Boot protocol relay agent (BOOTP)

Ø  RIP for IPX

- The multi-protocol routers use this routing information protocol for performing dynamic exchange of the routing info. 

- Routers using RIP protocol can dynamically exchange information with the other routers that use the same protocol. 

- The BOOTP agent is included so that the DHCP requests can be forwarded to their respective servers residing on other subnets. 

- It is because of this, a single DHCP server can process a number of IP subnets. 

- Multi-protocol routers do not require to be manually configured.

- The networking world these days relies totally up on the internet protocol. But there are certain situations where certain tasks can be performed more efficiently by the other protocols. 

- Most of the network protocols share many similarities rather than being different. 

- Therefore, if one protocol can be routed by a protocol efficient, then it is obvious that it can route the other one also efficiently. 

- If we route the non-IP protocols in a network, this implies that the same staff that takes care of the IP monitoring is administering the non-IP routing also. 

- This reduces the need for more equipment and effort. 

- There are a number of non-IP protocols available using which a LAN can work more effectively. 

- Using a number of non-IP protocols, a network can be made very flexible and easier to meet the demands of its users. 

- All these points speak in the favor of multi-protocol routing in an abstract way. 

- But the non-IP protocols to be routed must be selected with care. 

Below we mention reasons why routing non – IP protocols can be avoided:

1. It requires additional knowledge because you cannot master everything. For individual protocol an expert is required who in case of a failure can diagnose it and fix it.
2. It puts extra load on the routers. For every protocol, the router would have to maintain a separate routing table. This calls for a dynamic routing protocol for the router itself. For all this, more memory is required along with high processing power.
3. It increases the complexity. Multi-protocol router even though it seems to be simple, it is quite a complicated thing in terms of both hardware and software. Any problem in the implementation of the protocol can have a negative impact up on the stability of all the protocols.
4. Difficulty in designing: There are separate rules for routing of each protocol, assignment of the addresses and so on. There are possibilities that there might be conflicts between these rules which means it is very difficult to design.
5. It decreases stability. Scaling capacity of certain protocols is not as good as of the others. Some of the protocols are not suited to work in a WAN environment. 

Explain the concept of inter-networking?

- The practice in which one computer network is connected with the other networks is called inter-networking. 

- The networks are connected with the help of gateways. 

- These gateways are used since they offer a common method for routing the data packets across the networks.

- The resulting system in which a number of networks are connected is called the inter-network or more commonly as the internet. 

- The terms “inter” and “networking” combine together to form the term “internet working”.  

- Internet is the best and the most popular example of the inter networking. 

- Internet has formed as a result of many networks connected with the help of numerous technologies. 

- Many types of hardware technologies underlie the internet. 

- The internet protocol suite (IP suite) is the inter networking protocol standard responsible for unifying the diverse networks. 

- This protocol is more commonly known as the TCP/ IP. 

- Two computer local area networks (LANs) connected to one another by means of a router form the smallest internet but not the inter network. 

- Inter networking is not formed by simply connecting two LANs together via a hub or a switch. 

- This is called expansion of the original local area network. 

- Inter networking was started as a means for connecting the disparate networking technologies. 

- Eventually, it gained widespread popularity because of the development needs of connecting many local area networks together through some kind of WAN (wide area network). 

- “Catenet” was the original term that was used for the inter network. 

- Inter network includes many types of other networks such as the PAN or personal area network. 

- Gateways were the network elements that were originally used for connecting various networks in predecessor of the internet called the ARPANET. 

- Today, these connecting devices are more commonly known as the internet routers. 

- There is a type of interconnection between the various networks at the link layer of the networking model. 

- This layer is particularly known as the hardware centric layer and it lies below the TCP/ IP logical interfaces level. 

Two devices are mainly used in establishing this interconnection:

Ø  Network switches and

Ø  Network bridges

- Even now this cannot be called as inter networking rather, the system is just a single and large sub-network. 

- Further, for traversing these devices no inter networking protocol is required. 

- However, it is possible to convert a single network in to an inter network. 

- This can be done by making various segments out of the network and also making logical divisions of the segment traffic using the routers. 

- The internet protocol suite has been particularly designed for providing a packet service. 

- This packet service offered by the IPS is quite unreliable. 

- The elements that maintain a network state and are intermediate in the network are avoided by the architecture. 

- The focus of the architecture is more on the end points of the active communication session.

- For a reliable transfer of the data, a proper transport layer protocol must be used by the applications. 

- One such protocol is the TCP (transmission control protocol) and it is capable of providing a reliable stream for communication. 

- Sometimes a simpler protocol such as the UDP (user datagram protocol) might be used by the applications. 

- The applications using this protocol carry out only those tasks for which reliable data delivery is not required or for which realtime is required. 

Examples of such tasks include voice chat or watching a video online etc. Inter networking uses two architectural models namely:

1. OSI or the open system interconnection model: This model comes with 7 layer architecture that covers the hardware and the software interface.
2. TCP/ IP model: The architecture of this model is somewhat loosely defined when compared with the OSI model. 

Explain multicast routing?

- Multicast routing is also known as the IP multicast. 

- For sending the IP (internet protocol) data-grams to a group of receivers who are interested in receiving the data-grams, multicast routing is used.

- The data-grams are sent to all the receivers in just one transmission. 

- Multicast routing has got a special use in the applications that require media streaming on private networks as well as internet. 

- Multicast routing is IP specific version. 

- A more general version is the multicast networking.

- Here, the multicast address blocks are especially reserved in IPv6 and IPv4. 

- Broadcast addressing has been replaced by multicast addressing in IPv6. 

- Broadcast addressing was used in IPv4. 

- RFC 1112 describes the multicast routing and in 1986 it was standardized. 

This technique is used for the following types of real – time communication over the IP infrastructure of the network:

Ø  Many – to – many

Ø  One – to – many

- It scales up to receiving population that is large enough and it does not require either knowledge regarding the receivers and the identity of the receivers. 

- Network infrastructure is used efficiently by the multicast efficiently and requires source sending packet to a large number of receivers only once. 

- The responsibility of the replication of the packet is of the nodes which are nothing but the routers and the network switches.

- The packet has to be replicated till it reaches the multiple receivers. 

- Also, it is important that the message is sent only once over the link.   

- UDP or the user data gram protocol is the mostly used protocol of low level. 

- Even though if this protocol does not guarantees reliability i.e., the packets might get delivered or get lost. 

- There are other multicast protocols available that are reliable such as the PGM or the pragmatic general multicast. 

It has been developed for adding the following two things a top the IP multicast:

Ø  Retransmission and

Ø  Loss detection

The following 3 things are key elements of an IP multicast:

1. Receiver driven tree creation
2. Multicast distribution tree
3. IP multicast group address

- The receivers and the sources use the last for sending as well as receiving the multicast messages. 

- The group address serves as the destination address of the data packets for the sources whereas it is used for informing the network whether or not the receivers want those packets.

- Receivers need a protocol for joining a group. 

- One most commonly used protocol for this purpose is the IGMP i.e., the internet group management protocol. 

- The multicast distribution trees are set up using this protocol. 

- Once a group has been joined by the receiver, the PIM (protocol independent multicast) protocol is used for constructing a multicast distribution tree for this group. 

- The multicast distribution trees set up with the help of this protocol are used for sending the multicast packets to the members of the multicast group. 

PIM can be implemented in any of the following variations:

1. SM or sparse mode
2. DM or dense mode
3. SSM or source specified mode
4. SDM or sparse – dense mode or bidirectional mode (bidir)

- Since 2006, the sparse mode is the most commonly used mode. 

- The last two variations are more scalable and simpler variations of PIM and are also popular. 

- An active source is not required for carrying out an IP multicast operation and knowing about the group’s receivers. 

- The receiver drives the construction of the IP multicast tree. 

- The network nodes which lie closer to receiver are responsible for initiating this construction.

- This multicast then scales to a receiver population that is large enough. 

- It is important for a multicast router to know which all multicast trees can be reached in the network. 

- Rather, it only requires knowledge of its downstream receivers. 

- This is how the multicast – addressed services can be scaled up. 

What is meant by multi-destination routing?

- So many routing algorithms have been devised to aid in routing under different conditions.
- Effective routing algorithms have been developed that are capable of routing the messages from one source node to a number of receiving nodes i.e., the multiple destination nodes.
- These algorithms are termed as the multi – destination routing algorithms and the process is therefore called as the multi – destination routing.
- This type of routing has been developed for the minimization of the cost of the network i.e., NC (network cost).
- Network cost can be defined as the sum of all the links’ weights that consist of the routing path.
- There are many heuristic algorithms available for determining the NC min path.
- This problem falls under the category of the NP – complete problems.
- Heuristics are available for the traveling salesman problem and MST (minimum spanning tree) variations.
- Global information is used by both of them.
- Another set of such heuristics is available that uses only shortest paths for reaching the destinations.
- The best worst case performance is exhibited by the MST algorithm.
- However, one study revealed that effectiveness of the simpler heuristics is higher.
- The network cost (NC) is often compared with the destination cost (DC).
- Destination cost is the sum of the cost of all the shortest paths that lead to the destination.
- A scheme of algorithms has been developed for trading off between these two costs i.e., the NC and DC.  
- The sender of the transmitted data cannot be taken as a single node in a network where the cooperative communication is supported.
- This asks for the re-investigation of the traditional link concept.
- Any routing scheme thus depending up on this link concept needs to be reconsidered.
- Also, the potential performance gain resulting because of the cooperative communication needs to be exploited.

- Routing often gets complicated for some networks where the selection of the paths is no longer the job of a single entity.
- Rather, a number of entities are involved in the selection of the paths.
- Multiple entities can even select specific parts of a path.
- If these selected paths are chosen by the entities for their own objectives optimization then it can lead to inefficiency or serious complications in the network since they may or may not conflict with the other entities’ objectives.
- This would become clear from the following example, consider traffic moving in a system of roads.
- Now here each driver selects a path that would minimize only his/her traveling time.
- In this kind of routing, there are longer equilibrium routes (i.e., longer than the optimal.) for almost all other drivers.
- This is often termed as the Braess paradox.
- Another example is of the routing the AGVs (automated guided vehicles) by a model on some terminal.
- For prevention of the simultaneous usage of the infrastructure’s same part reservations are made. - This is called as the context – aware routing.
- The internet is divided in to a number of divisions which are nothing but Ass i.e., the autonomous system like ISPs.
- All these systems have control over the routes that lie in their own network at various different levels.

Following steps are involved in multi – destination routing:
1. The BGP protocol is used for selecting the AS – level paths.
2. A sequence of autonomous systems is produced by the BGP protocol via which the packet flow will take place.
3. The neighboring Ass offer multiple paths for each of the AS from which it can choose. Paths are selected based up on the relationships between the neighboring systems.
4. Each selected path refers to multiple corresponding router level paths.

What is reverse path forwarding?

- RPF or reverse path forwarding is a common technique used for ensuring that the multicast packets are forwarded without any loops in the modern routers in multicast routing. 

- This technique is also used for the prevention of the IP address spoofing during the unicast routing.

- Multicast RPF or just RPF is not used alone. 

- Rather, it is used along with some multicast routing protocol. 

- There are various multicast routing protocols such as the PIM – SM, PIM – DM, MSDP and so on. 

- This is for ensuring that no loops are formed in forwarding the multicast packets. 

- Source address is used for deciding whether the traffic has to be forwarded or not in multicast routing. 

- On the other hand in unicast routing, this depends up on the destination address instead of source address. 

- This it achieves either through utilization of either the unicast routing table of the router or a multicast routing table that has been dedicated to the purpose. 

- As and when a packet comes to the interface of the router, it searches in the networks list for the networks that can be reached through this interface. 

- This is nothing but the reverse path checking of the multicast packet.  

- If the appropriate routing entry is found for the multicast packet’s source IP address, it is said to pass the RPF check. 

- After this the packet is sent to all the participating interfaces in that particular multicast group.  

- If the packet fails at this RPF check, the packet is simply dropped. 

- Because of this, the packet forwarding has to be decided depending up on its reverse path. 

- Otherwise, the forward path can be used as usual. 

- Only those packets are forwarded by the RPF routers which pass this RPF check. 

- Passing this RPF check means breaking any loop that might otherwise exist. 

- This is of critical importance in the multicast topologies that are redundant. 

- This is so because it is possible for the same packet to come again and again to the same router through a number of multiple interfaces. 

- The RPF check is an integral part of the decision concerning forwarding of the packets. 

- Consider a router forwarding a packet from first interface to the second interface and also from second interface to the first one. 

- Thus, the same packet is received by the two packets, thus creating a common routing loop. 

- This loop will keep on forwarding the packets until the expiry of their TTLs. 

- Even if the TTL expiry is considered, the best thing to do is to avoid the routing loops because they are a main cause of the temporary network degradation.

RPF check has the following underlying assumptions:

1. The given unicast routing table is converged as well as correct.
2. There is symmetry between the path that goes from sender to router and the path that comes back from the router to the sender.

- RPF check uses the unicast routing table as the fallback. 

- Therefore, if the first assumption is not satisfied, the check will fail. 

- But in case the second assumption is false, the multicast traffic is rejected by the RPF check save the traffic on the shortest path that exists between the sender and the router. 

- This results in a multicast tree that is non–optimal.

- The reverse path forwarding will not work if there are uni-directional links present in the network.

Unicast RPF: 

- This type of the reverse path forwarding is based up on the concept that the interface which does not originate traffic must not accept it. 

- It is good for the organizations to not allow private address propagation on their network until and unless they are continuously using it. 

What is meant by flow based routing?

- The routing algorithm that considers the flow in the network is known as flow based routing. 

- It takes into consideration the amount of traffic flowing in the network before making a decision regarding the outgoing link over which the packet has to be sent. 

- The ability to characterize the traffic flow’s nature with respect to time is the key to the successful implementation of the flow based routing. 

- For any given line, if we know what is its average flow or capacity we can very well compute the mean packet delay of the line using the queuing theory. - This is the basic idea behind the implementation of this algorithm. 

- This idea reduces the size of the problem i.e., only the minimum average delay has to be calculated for the sub net and nothing else. 

- Thus, the flow based routing considers the load and topology of the network while other routing algorithms do not. 

- In few networks, the mean data flow existing between two nodes might be predictable as well as relatively stable. 

- There occur such conditions under which the average traffic between the two points is known. 

- In such conditions the mathematical analyzation of the flow is possible. 

- This calculation can be used in the optimization of the routing protocol. 

- The flow weighted average can be straightforward calculated which in turn can be used for the calculation of the mean packet delay of the entire sub-net. 

The flow based routing algorithm requires the following things in advance:

Ø  Topology of the subnet

Ø  Traffic matrix

Ø  Capacity matrix

Ø  A routing algorithm

- Information flow based routing algorithms are commonly used in the wireless sensor networks. 

- These days, the measure of information is being used a criterion for the analyzation of the performance of the flow based routing algorithms. 

- One research has put forward an argument stating that since the sensor network is driven by the objective of the estimation of a 2D random field, the information flow must be maximized over the entire field and the sensor’s lifetime. 

In response to this algorithm two types of flow based routing algorithm have been designed namely:

1. Maximum information routing (MIR) and
2. Conditional maximum information routing (CMIR)

- Both of these algorithms have proved to be quite significant when compared to the exiting algorithm – maximum residual energy path or MREP.

About MREP Algorithm

 

- This proves to be quite effective in conservation of the energy. 

- The battery energy which is limited is taken as the most important resource. - For the maximization of the lifetime, the energy consumption has to be balanced throughout the nodes. 

- This should be done in proportion to the resource reserves. 

- This is better than routing for the minimization of the absolute consumed power.

About MIR Algorithm

 

- The ideology behind the MIR algorithm is that there is inequality between the nodes. 

- For example, two very close nodes might not provide twice as much information provided by a lonely node. 

- Therefore, the nodes that provide more information are only given preference. 

- An additional penalty according to the node’s contribution is added to the node for achieving the above mentioned preference. 

- Dijkstra’s algorithm is used for the computation of the shortest path. 

- This helps in sending the data to the sensor as per both the information of the origin and the power consumed.

About CMIR Algorithm

- This one is a hybrid algorithm and makes use of MIR to some extent and then uses MREP algorithm for the rest of the cycle. 

- This hybrid version is better than the above two standalone algorithms since it runs better.