What is fragmentation?

- The fragmentation technique is implemented in the IP (internet protocol) for breaking down the datagrams into smaller pieces. 

- This is done so that it becomes easy for the data packets to be passed through the link with a datagram size smaller than that of the original MTU or the maximum transmission unit. 

- The procedure for the IP fragmentation along with the procedures for reassembling and transmitting the datagrams is given in the RFC 791. 

- For determining the optimal MTU path, the IPv6 hosts are needed so that the packets can be sent. 

- If in case the PDU i.e., the protocol data unit received by the router is larger than the MTU of the next hop, then there are two options are available if IPv4 transport is being used:

Ø Dropping the PDU and sending an ICMP (internet control message protocol) message indicating that the condition packet is quite big.

Ø  Fragmenting the IP packet and then transmitting it over the link whose MTU is smaller. Any IPv6 packet with a size less than or equal to 1280 bytes can be delivered without having the need for using the IPv6 fragmentation.

- If a fragmented IP packet is received by the recipient host, its job is to reassemble the datagram and then send it over to the protocols at the higher layers. 

- The purpose of reassembling is expected to take place at the recipient’s host side but for some practical reasons it might be done by some intermediate router. 

- For example, the fragments might be reassembled by the NAT (network address translation) for translating the data streams. 

- Excessive re-transmission can result as a consequence of the IP fragmentation whenever packet loss might be encountered by the fragments. 

- It is required for all the reliable protocols (example, TCP) for re-transmitting the fragments in their correct order for recovering from the single fragment loss. 

Thus, typically two approaches are used by the senders for determining datagrams of what size should be transmitted over the network:

1. First approach: The sender must transmit an IP datagram of size as same as that of the first hop’s MTU.
2. Second approach: Running the path MTU discovery algorithm.

- Fragmentation does leave an impact on the network forwarding. 

- When there are multiple parallel paths for the internet router the traffic is split by the technologies such as the CEF and LAG throughout the links via some hash algorithms. 

- The major goal of this algorithm is to make sure that all the packets with the same flow are transmitted out on the same path for the minimization of the not so required packet reordering. 

- If the TCP or UDP port numbers are used by the hash algorithm, the fragmented packets might be forwarded through different paths. 

- This is so because the layer 4 information is contained only in the first fragment of the packet. 

- As a result of this, usually the initial fragment arrives after the non-initial fragments. 

- This condition is often treated as an error by most of the security devices in the hosts.  

- Therefore, they drop these packets.

- The fragmentation mechanism differs in IPv4 and IPv6. 

- In the former, the fragmentation is performed by the router. 

- On the other hand, in IPv6 fragments that are larger than MTU are dropped by the routers.

- Also, in both the cases there is a variation in the header format. 

- Since fragmentation is carried out using analogous fields, therefore the algorithm can be used again and again for the purpose of fragmentation and reassembling. 

- A best effort should be made by the IPv4 hosts for reassembling the datagram fragments. 

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 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 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. 

What is the idea behind link state routing?

There are two main classes of the routing protocols out of which one is the link state routing protocol on which we shall focus in this article. The other class of the routing protocols is the distance vector routing protocols.

In computer communications, the link state routing protocol is applied in the packet switching networks. 

We can give two main examples of the link state routing protocol namely:

1. IS – IS i.e., intermediate system to intermediate system and
2. OSPF i.e., the open shortest path first

Almost every switching node is capable of performing the link – state routing in the network. Switching nodes can be defined as the nodes that can forward the packets. We call these nodes as routers in the internet.

Idea behind the Link State Routing

 

- A map is constructed by every node concerning its connectivity with the network. 

- This map is actually in a graph’s form. 

- This graph shows all the connections that exist between the various nodes in the graph. 

- The next “best logical path” is then calculated independently by each node to every destination in the network based up on its possibility. 

- The routing table of the node will then be formed by this collection of the best paths.

- This is in total contrast with the second class of the routing protocols.

- In the distance vector routing protocols, the routing table of a node is also shared by its neighbors whereas in the link state routing protocol, only the connectivity related information is passed between the nodes. 

- The simplest configuration of the link state routing protocols is the one that has no area. 

- This implies that each node possesses a map of the whole network. 

- The first main stage involves providing map of the network to each node. 

For doing the following, subsidiary steps are followed:

1. Determination of the neighboring nodes: Each node determines to which all neighboring nodes it is connected to. Also, it needs to know whether over the links through which it is connected are fully working or not. A reach-ability protocol is used for accomplishing this task. This protocol is run regularly but in separation from the neighboring nodes.
2. Distribution of the map information: The link state advertisement is the short message that is made by the node in case of some modification in the connectivity periodically.

- The above obtained set of such link state advertisements is used for the creation of the map of the entire network. 

- The second stage involves production of the routing tables through the map inspection. 

This again involves a number of steps:

1. Calculation of the shortest paths: Shortest path from one node to other nodes is determined by running a shortest path routing algorithm over the entire map. The commonly used algorithm is the Dijkstra’s algorithm.
2. Filling the routing table: The table is filled with best shortest paths obtained in the above step for every two nodes.  
3. Optimizations: We gave a glance of the simple form of this algorithm but in practical applications this form is used along with a number of optimizations. Whenever a change is detected in the network connectivity, the shortest path tree has to be immediately recomputed and then the routing table must be recreated. A method was discovered by the BBN technologies for recomputing only the affected part of the tree.

- Routing loops can be formed if working of the nodes using the exactly same map is not proper. 

- For adhoc networks such as the mobile networks, the optimized form of the protocol i.e., the optimized link state routing protocol is used. 

What is meant by an optimal route?

- For selecting a path or route, a routing metric has to be applied to a number of routes so as to select the best out of them. 

- This best route is called the optimal route with respect to the routing metric used. 

- This routing metric is computed with the help of the routing algorithms in computer networking.

- It consists of information such as network delay, hop count, network delay, load, MTU, path cost, communication cost, reliability and so on.

- Only the best or the optimal routes are stored in the routing tables that reside in the memory of the routers. 

- The other information is stored in either the topological or the link state databases. 

- There are many types of routing protocol and each of them has a routing metric specific to it. 

- Some external heuristic is required to be used by the multi-protocol routers for selecting between the routes determined using various routing protocols. 

- For example, the administrative distance is the value that is attributed to all the routes in Cisco routers. 

- Here, smaller distances mean that the protocol is a reliable one. 

- Host specific routes to a certain device can be set up by the local network admin. 

- This will offer more control over the usage of the network along with better overall security and permission for testing. 

- This advantage comes handy especially when it is needed to debug the routing tables and the connections. 

In this article we discuss about the optimal routes. 

- With the growing popularity of the IP networks as the mission critical tools for business, the need for methods and techniques using which the network’s routing posture can be monitored is increasing.

- Many routing issues or even incorrect routing can lead to undesirable effects on the network such as downtime, flapping or performance degradation. 

- Route analytic are the techniques and tools that are used for monitoring the routing in a network. 

The performance of the network is measured using the following 2 factors:

1. Throughput or the Quantity of service: This includes the amount of data that is transmitted and time it takes to transfer.
2. Average packet delay or Quality of service: This includes the time taken by a packet to arrive at its destination and the response of the system to the commands entered by the user.

- There is always a constant battle between the fairness and optimality or we can say between quantity of service and quality of service. 

- For optimizing the throughput, the paths existing between the nodes have to be saturated and the response time from source point to destination point must be noticed. 

For finding the optimal routes, we have two types of algorithms namely:

1. Adaptive Algorithms: These algorithms are meant for the networks in which the routes change in a dynamic manner. Here the information regarding the route to be followed is obtained at the run time itself from adjacent as well as the all other routers. The routes change whenever there is a change in the load, change in the topology and every delta T seconds.
2. Non – adaptive algorithms: These algorithms the same routes cannot be followed every time. Therefore the measurements that were made for the previous condition cannot be used for the current condition. The routes thus obtained are called static routes and are computed at the boot time.

Finding optimal routes requires following the principle of optimality according to which the optimal path between an intermediate router and the destination router lies on the same route from the source to the destination route. 

What are the goals and properties of a routing algorithm?

Routing requires the use of routing algorithms for the construction of the routing tables.

A number of routing algorithms are today available with us such as:

1.   Distance vector algorithm (bellman ford algorithm)

2.   Link state algorithm

3.   Optimized link state routing algorithm (OLSR)

- In a number of web applications, there are a number of nodes which require communicating with each other via communication channels. 

- Few examples of such applications are telecommunication networks (such as POTS/ PSTN, internet, mobile phone networks, and local area networks), distributed applications, multiprocessor computers etc. 

- All nodes cannot be connected to each other since doing so will require many high powered transceivers, wires and cables. 

- Therefore, the implementation is such that the transmissions of nodes are forwarded by the other nodes till the data or info reaches its correct destination. 

- Thus, routing is the process of determining where the packets have to be forwarded and doing so.

Properties of Routing Algorithm
- The packets must reach their destination if there are no factors preventing this such as congestion.

- The transmission of data should be quick.

- There should be high efficiency in the data transfer.

- All the computations involved must not be long. They should be as easy and quick as possible.

- The routing algorithm must be capable of adapting to the two factors i.e., changing load and changes in topology (this includes the channels that are new and the deleted ones.)

- All the different users must be treated fairly by the routing algorithm.

The second and the third properties can be achieved using fastest or the shortest route algorithms. 

- Graphical representation of the network is a crucial part of the routing process.

- Each network node is represented by a vertex in the graph whereas an edge represents a connection or a link between the two nodes. 

- The cost of each link is represented as the weight of the edge in the graph. 

- There are 3 typical weight functions as mentioned below:

1.   Minimum hops: The weight of all the edges in the graph is same.

2.  Shortest path: The weight of all the edges is a constant non – negative value.

3.   Minimum delay: The weight of every edge depends up on the traffic on its link and is a non – negative value.

However in real networks, the weights are always positive.

Goals of Routing Algorithms

- The goal of these routing algorithms is to find the shortest path based up on some specified relationships that if used will result in the maximum routing efficiency. 

- Another point is to use as minimum information as possible.

- Goal of the routing algorithm is also to keep the routing tables update with all alternative paths so that if one fails, the other one can be used.

- The channel or the path that fails is removed from the table. 

- The routing algorithms need to be stable in order to provide meaningful results but at the same time is quite difficult to detect the stable state of an algorithm. 

- Choosing a routing algorithm is like choosing different horses for different courses. 

- The frequency of the changes in the network is one thing to be considered. 

- Other things to be considered include the cost function that is needed to be minimized and the calculation of the routing tables in a centralized fashion.

- For static networks the routing tables are fixed and therefore they require only simple routing algorithms for calculation. 

- On the other hand, the networks that are dynamic nature require distributed routing algorithms which are of course complex.

What are the challenges of testing Web Applications? How to use Silk Test with Web Applications?

Web applications are a rage these days and thus a fast delivery of web applications is in urgent need. But at the same time it is important to keep the security of these web applications in check. 

However, web testers continue to face some challenges while testing the web applications and this is what that we are going to discuss in this article. 

What are Web Applications?

- As we are familiar with the growing popularity of the web applications, with the time, new and advance features are being introduced in the web applications.

- It makes them one of the most popular means for the development of the commercial systems. 

- Nowadays, almost all the companies opt for developing web based software wherever and for whatever possible. 

- This is so because with the help of web applications the company can easily cater to the needs of a large number of people. 

- Also, once the infrastructure of the application is put in place the deployment of the apps becomes quite easy. 

- The web applications are powerful assets and using them, a feature rich content can be provided to a large audience across the globe at quite an economical cost.

- Hence, it becomes more and more daunting to test these complex applications. 

- For the web applications the two factors continue to be the most important:

1. Accessibility and
2. Security

Challenges in testing Web Application

While on one side, the company wants to cater to the users all over the world, on the other side their web application can fall prey to some grave security issues. Thus, only web application testing stands a chance to secure the data as well the organization. 

- The design and nature of every web application is somewhat unique to it and so it is possible for the users to follow different paths of usage.

- In such cases, it is necessary to ensure that all paths are working well by testing all the permutations and combinations. 

- Also, all the software applications are not self explanatory. 

- Users of a web application are from various back grounds and those who are from a non technical background may find it hard to use the application. 

- This does affects the design of the application and therefore should be tested during the usability testing of the application. 

- For intranet based web applications, it is possible for the developers to make assumptions regarding the audience but this is impossible for the internet based web applications. 

- Today, there are many web browsers available and so different browsers are used by different users. 

- Thus, there is a need to test this aspect since it can be ensured that the web application is compatible with all the platforms.

How is web testing done in SilkTest?

- Web testing is possible using the Borland’s silk test. 

- Till now, it has been proven to be the leading functional testing tool in the software industry when it comes to testing e- business applications either based up on windows, web, java or client or server based and so on. 

- Silk test is used for the following purposes:

1. Test planning
2. Test management
3. Direct data base access and validation

- It also comes with a built – in recovery system for the purpose of unattended testing of the web applications across multiple browsers, platforms and technologies.

Is there any problem in using scripts created on v6.0 to 6.5 or higher versions?

In some cases, it may happen that while trying to automate a java swing application using an early version of silk test such as the silk test 5.0.3. You found that the objects and controls in the application window of the application under test or AUT might not be recognizable by the silk test. 

This is just an example of problems of such category and at times you may wonder if the higher versions such as the silk test v 6.0 or silk test v 6.5 are suitable for automating your application or not? Or does the silk test comes with some extensions or add – ons as an alternate for overcoming such situations. 

The version 6.0 of the silk test is known to have some bugs in it, however, the Segue software has known to resolve these known issues. Actually, advancing form a lower version to a higher version of the silk test must not pose a problem. 

Though this is a general statement that we made on the basis of observation of several instances, it is not necessary that it should turn out to be true in all the cases. You may face some problems with the scripts that will work on an earlier but not on higher versions such as 6.0 and above because the object recognition patterns in both of them are not the same and vary from version to version. 

There are certain situations where the two paths of the script might be used for performing the same action but based up on the version. 

The silk test version 6.0 and silk test version 6.5 are somewhat similar and though no problems are experienced in advancing from version 6.0 to version 6.5 of the silk test. 

The various client forms of silk test are available such as those stated below:

1. Silk test classic: This client of the silk test makes use of the domain specific language called “4test” for scripting of the test automation scripts. This language just like the C++ language is an object oriented language. Just like C++ it also makes use of the Object Oriented concepts such as following:

a)   Inheritance

b)   Classes and

c)   objects

2. Silk 4J: This client of the silk test enables one to follow test automation by using java as the scripting language in eclipse.
3. Silk 4 net: This client of the silk test also enables one to follow test automation by using VBScript or sometimes using C# as the scripting language in the visual studio.
4. Silk test work bench: This client of the silk test enables the testers to carry out the automation testing using VB.net as the scripting language as well as on a visual level.

Below stated is the list of the silk test versions that have been released till now:

1. Borland silk test 13- june 2012
2. Micro focus silk test 2011 – November 2011
3. Micro focus silk test 2010 R2 WS 2 – may 2011
4. Micro focus silk test 2010 R2 – December 2010
5. Micro focus silk test 2010 – july 2010
6. Silk test 2009 – august 12, 2009
7. Silk test 2008 SP1 – jusly 2008
8. Silk test 2008 – april 2008
9. Silk test 2006 R2 service pack 2 – September 2007
10. Silk test 2006 R 2 service pack 1 – june 2007
11. Silk test 2006 R2 – January 2007
12. Silk test 2006 – September 2006
13. Silk test 8.0 – may 2006
14. Silk test 7.6 – September 2005
15. Silk test 7.5 – june 2005
16. Silk test 7.1 – October 2004
17. Silk test 6.5 – November 2003
18. Silk test 6.0 – November 2002
19. Silk test 5.0.1 – September 1999
20. QA partner 4.0 – November 1996