Preview

Nt1330 Unit 3 Exercise 1 Essay

Satisfactory Essays
Open Document
Open Document
503 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Nt1330 Unit 3 Exercise 1 Essay
Exercise 2.3.1
LAN – Local Area Network – within a building
MAN – Metropolitan Area network – larger than a LAN, smaller than a WAN
PAN – Personal Area Network – less than 30 feet
WAN – Wide Area Network – collection of LANs geographically spread over large distance

Exercise 2.3.2
Network Topology – A drawing of a series of connected nodes via links, including descriptions.

Exercise 2.3.3
It would take 1 (hop) message to send a message from node A to node B. It would take 3 (hop) messages to send a message from node B to node A. One additional link is required to add a new node E between node C and node D. With the new node added, the number of messages to Travers from node B to node A would increase by one.

Exercise 2.3.4
…show more content…
It would take 3 (hop) messages to send a message from node D to node A. One additional link would be required to add a new node E between node C and node B. The added node E will increase the number of actual messages required to be sent form one node to another.

Exercise 2.3.5
There are three messages that are sent from the hub to node B when node A sends a message to node B in the Star Topology. One message is sent from the switch to node B when node A sends a message to node B.
If a hub is the central device used when adding a new node D then another message is sent for a total of four messages sent from the hub when a message is sent from node A to node B. However, there is no change to in the number of messages sent on the network when the central device is a switch, it is still one message.

Exercise 2.3.6
Three messages are necessary to send a message from node A to node D. Three messages are also necessary to send a message from node A to node B.
Four new links are required to add a new node E between node C and node D. Five new links would be required to add a new node F.

Lab 2.3

You May Also Find These Documents Helpful

  • Good Essays

    Nt1330 Unit 7 Exercise 1

    • 489 Words
    • 2 Pages

    The neighbor nodes forward the Route Request (RREQ) to the destination node. If Rushing attacks send duplicate Route Request (RREQ) to the neighbor node. If Request RREQ is from the true source address, then the system is regular and begins to transmit data packets otherwise repeat the process. This process is illustrated in Fig 1.…

    • 489 Words
    • 2 Pages
    Good Essays
  • Good Essays

    Between two nodes in a network there can be many connecting paths but usually shortest path is considered best. It means any information exchange between two nodes also go through all nodes appearing in shortest path. By this reason any node involved in shortest paths can have…

    • 596 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Nt1330 Exercise 1.1

    • 1895 Words
    • 8 Pages

    Newly arriving calls influence the load on nodes, which will influence the ants by means of the delay mechanism. Ants influence the routes represented by the pheromone tables, which in their turn determine the routing of new calls. These relationships are illustrated in Figure 5. One needs to realize that the pheromone table by which an individual ant is influenced, is a different table than the pheromone table that will be updated by this ant. The load on the network at any given time influences which calls can subsequently be placed on the network and which calls will fail; which of course determines the load at a later…

    • 1895 Words
    • 8 Pages
    Good Essays
  • Powerful Essays

    Nt1310 Unit 3 Assignment 1

    • 6320 Words
    • 26 Pages

    “A ring network is a network topology in which each node connects exactly to two other nodes, forming a single continual pathway for each node - a ring” (Conjecture Corporation, 2003). In a ring network data travels from each node to the other node/s with each node handling every packet. A ring network provides only a pathway between any two nodes at one time. Ring networks may be disrupted by the failure of a link. A node failure or cable break will isolate every node attached…

    • 6320 Words
    • 26 Pages
    Powerful Essays
  • Powerful Essays

    IT321 Final Exam Paper

    • 1235 Words
    • 5 Pages

    37 (T or F) In a properly operating packet network, all of the packets from a single message will arrive at the destination node at the same time.…

    • 1235 Words
    • 5 Pages
    Powerful Essays
  • Good Essays

    unit 2 labs

    • 465 Words
    • 2 Pages

    LAN: local area network. Small group, usually home or workplace. MAN: Metropolitan area network. City. PAN: Personal area network. WAN: Wide area network. State or country.…

    • 465 Words
    • 2 Pages
    Good Essays
  • Powerful Essays

    network 204

    • 558 Words
    • 3 Pages

    For the simple 3 router network (Figure 1), fill in the information that would be in each router’s routing table once the network has converged (see example in Chapter 4, pages 192-193).…

    • 558 Words
    • 3 Pages
    Powerful Essays
  • Satisfactory Essays

    Study Guide

    • 350 Words
    • 2 Pages

    Circuit configuration affects the way in which two or more communicating devices share their link with each other.…

    • 350 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    W4 Hw Ev

    • 534 Words
    • 3 Pages

    Use the network diagram below and the additional information provided to answer the corresponding questions. [13 points]…

    • 534 Words
    • 3 Pages
    Good Essays
  • Good Essays

    1. Which network device directs the flow of information from one node on a network to another by giving each sender/receiver pair the line's entire bandwidth?…

    • 5236 Words
    • 21 Pages
    Good Essays
  • Good Essays

    Assignment 1 Soln

    • 846 Words
    • 4 Pages

    Consider sending a large file of F bits from Host A to Host B. There are three links (and…

    • 846 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    Leadership Management

    • 582 Words
    • 3 Pages

    The two key stages in the communication process are the sender who sends the message and the recipient who receives the message. Eg: when I send message to my friend I become the sender and when she receives the message she becomes the receiver.…

    • 582 Words
    • 3 Pages
    Satisfactory Essays
  • Better Essays

    (b) Come up and describe a revised mechanism that can achieve the ping pong message exchange objectives but with less network traffic and…

    • 4271 Words
    • 18 Pages
    Better Essays
  • Good Essays

    Prim's Algorithm

    • 625 Words
    • 3 Pages

    Consider the Philadelphia as the starting node. As this node is connected with only one node Pittsburgh with a distance of 320. So, a connection should be made between both nodes. Set S will have { Philadelphia, Pittsburgh } and Set V-S will have { Toledo, Detroit, Ann Arbor, Chicago, Ft. Wayne, Indianapolis, Cleveland, Columbus }. This can be shown as:…

    • 625 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Graphs In Data Structure

    • 1178 Words
    • 21 Pages

    Graphs - Introduction Terminology Graph ADT Data Structures Reading: 12.1-12.2 COSC 2011, Summer 2004 Definition • A graph is a pair (V, E), where – V is a set of nodes, called vertices – E is a collection of pairs of vertices, called edges • Both are objects (i.e. store data) G E B F A Vertex city computer web page airport C…

    • 1178 Words
    • 21 Pages
    Good Essays