On a p-node linear array there are two packets at each node to begin with. Assume p is even. Packets at node 1 are destined for node + 1, packets at node 2 are destined for + 2, and so on. Let each packet take the shortest path from its origin to its destination. Compute the routing time for this problem under the following priority schemes: farthest origin first, farthest destination first, FIFO, and LIFO.

C PROGRAMMING you are to write a TCP/IP server that can build up a graph of a network ofnetworks (using the supplied graph library and implementation of Dijkstra’s algorithm) and thenquery that graph to find out which link between two networks should be used as the next hop tosend a packet of data from one network to another within the network of networks (using thesupplied implementation of Dijkstra’s algorithm). using the following program as a start point: /* *  NetworkServer.c *  ProgrammingPortfolio Skeleton * */ /* You will need to include these header files to be able to implement the TCP/IP functions */#include <stdio.h>#include <stdlib.h>#include <string.h>#include <sys/types.h>#include <netinet/in.h>#include <netdb.h>#include <fcntl.h>#include <unistd.h>#include <errno.h>#include <sys/socket.h> /* You will also need to add #include for your graph library header files */ int main(int argc, const char * argv[]){    int…

Given the following network configuration (A,B... stand for node name, 1,2... stand for the length of the link), please apply Dijkstra's algorithm to calculate the shortest path from A to all the other nodes and answer following questions. B E 3 2 2 D F 5 A 5 H. G Simulate the execution of Dijkstra Algorithm round by round with fulfilling the following table. (6') Node Set B C D E G A 2, A 1,A 5, A INF INF 4,A INF AC 2, A 5, A INF INF 3,С INF 3.

3. Consider the M/M/1 queue discussed in class. Assume that packets arrive to a queue with average arrival rate A [pkts/s]. The average service rate of the queue is denoted by u [pkts/s]. (a) Write expressions for: (i) the mean time between packet arrivals to the queue, i.e., the average inter-arrival time; and (ii) the mean service time, i.e., the average time needed to transmit a packet onto the outgoing link. (b) Let N denote the number of packets in the system in steady-state. Suppose A = 850 and u 1000. Find the smallest value of B such that P(N > B) < e = 10¬4. Hint: Use MATLAB or some other computational tool (you could even use an Excel spreadsheet) to test different values of B. 4. Consider the M/M/1 queue from Problem 3. (a) Find an expression for E[N], i.e., the average number of packets in the system in steady- state. For the values of A and µ specified in Problem 4(b), compute the value of E[N]. What happens when A→ µ? (b) Find an expression for Var[N], i.e., the variance…

Demonstrate that two red nodes in a route cannot be contiguous (e.g., parent and child). As a result, no more than half of the nodes in a path may be red.

If we have a regular queue (X) and a queue (Y) that is using weighted fair queuing with a weight equal to 2. Given the following data:   Queue Packet Arrival Time Length        X A 0 10               X B 3 8                 Y C 5 8                 Y D 7 10                  What is the output order of the packets? Show your work.

In the node a  find the table using distance vector routing algorithm

In the congestion control method of TCP we are having a connection between nodes A and node B which is called connection X. There is another TCP connection between node C and node D which is called connection Y. The initial threshold window size for connection X is 20 KB and for Y is 16 KB. Both the connections X, Y are working independently and follow the Additive increase multiplicative decrease algorithm (AIMD) for congestion control with a maximum segment size of 2 KB. The first timeout occurs at the fifth transmission in connection X and at the sixth transmission in connection Y. After every third transmission from timeout, you again encounter the timeout in both X and Y. At which transmission the connection Y reaches to the same threshold value of the connection X for the first time.