Computer networks typically consist of nodes and edges—they are graphs. The node

Question

Computer networks typically consist of nodes and edges—they are graphs. The nodes can typically be computers, routers, servers, and so on. The edges indicate a communication path between nodes. Assume you are a network administrator for a distributed system and that you wish to perform maintenance of all the servers in your system. You have decided to do this by using a mobile agent. To get started, look up and answer the questions in Part 1. After that, complete Part 2:

Part 1

What is a distributed system?

What is a mobile agent?

Since this agent is autonomous and moves from computer to computer, it would be smart to equip it with shortest path algorithms, so that it can go from server to server, reaching all the servers only once, in the shortest amount of time. This is the traveling sales person (TSP) problem. Note that computer networks can be modeled using graphs and that shortest paths solutions, Hamilton cycles, TSP, and so on can be found using graph-based algorithms.

Part 2

How would you model a computer network using a graph? What are potential nodes, edges, and weights?

Which of these traversal algorithms should the agent be equipped with? Which will help the agent traverse the network in an efficient manner? Explain why.

What is the TSP problem, and how does it relate to this question?

Explanation / Answer

Distributed System:-

The Distributed system is a type of network in which consist of self determining computers that are connected using distributed middleware.A Distributed syatem allow to share resources, including software.there is greater fault endurance in a distributed system.permormance ration is high.
The key goal of distributed system are:

Mobile Agent:-

The mobile agent is a program that once it is launched by the user it travel to all the nodes simultaneously node to node. it's continusly functioning even the user is disconnected from network.The agent decides when and where to move next
Advantages of mobile agents:-

The agent is autonomous and moves from computer to computer.The agent decides when and where to move next.if it equip with shortest path algorithms so it can provide better output.The Traveling salesman problem can find the the best route availabe on the network

We can model a computer network using a graph in which all nodes are the system and all edges are the path between the systems. The Weight is the flow of data on the edge. in the network graph the weight is associated with the capicity of the edge.

the dijkstra's algorithm can be used to find the shortesh route between all nodes. the dijkstra's algo can find the efficient way to find shortest path.

The traveling sales man problem is used to find the shortest path between nodes in TSP the starting node and end node is same.

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.