Nt1310 Unit 1 Problem Analysis Paper

Words: 2365
Pages: 10

Part1
Question 1
a) Bit rate is how many data bits are transmitted per second, or the number of times per second a signal in a communication channel changes. Moreover, baud rate is the number of times per second a signal in a communication channel changes, or Baud rate (or signaling rate) defines the number of symbols per second.

b) Because not all bits transferred in a serial system are actual data bits, this will cause data bits to be larger than baud rate e.g. if 8-bit data words are transferred at the rate of one word per second, the data transfer rate might be considered as 8 bits per second but however, since each word has a start and stop bit added, in order to transfer one word per second the transfer rate must be 10 bits per second.
…show more content…
The algorithm finds the shortest path between source and all destinations in the network. Each node is labeled in parenthesis with its distance from the source node along the best-known path. The distance must be none negative, as they will be if they are based on real qualities like bandwidth and delay. Initially no paths are known, so all nodes are labeled with infinity. As the algorithm proceeds and paths are found, the labels may change, reflecting better paths. A label may be either tentative or permanent. Initially, all labels are tentative. When it is discovered that a label represents the shortest possible path from the source to that node, it is made permanent and never changed …show more content…
RIP uses a distance vector algorithm to decide which path to put a packet on to get to its destination. It stores in its routing table the distance for each network it knows how to reach, along with the address of the "next hop" router -- another router that is on one of the same networks -- through which a packet has to travel to get to that destination. If it receives an update on a route, and the new path is shorter, it will update its table entry with the length and next-hop address of the shorter path; if the new path is longer, it will wait through a "hold-down" period to see if later updates reflect the higher value as well, and only update the table entry if the new, longer path is