MAT 2051 Unit 7 Discussion DQ1 Computer Networks, Distributed Systems, and Mobile Agents

MAT 2051 Unit 7 Discussion DQ1 Computer Networks, Distributed Systems, and Mobile Agents

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?

Review the Discussion Participation Scoring Guide prior to posting.

Response Guidelines

Read your peers’ posts and respond to two. Compare your response to your peer’s response. Did you come up with the same results? Explain why or why not.