router - EE322C: Data Structures Programming Assignment #1...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
EE322C: Data Structures Programming Assignment #1 “Routing Simulation” Dr. Ramesh Yerraballi TAs: Vinoth Chander, Srivatsan Ramanujan, Birgi Tamersoy,and Fei Zhou Due : Friday September 26th at 11:55pm September 10, 2008 1 Problem Description Internet can be defined as the “network of networks”, where millions of private and public, academic, business and government networks are connected 1 . This giant network is used to exchange web pages, files, messages, etc. between the nodes that are connected to the Internet. It would be na¨ ıve to assume that each and every node in the Internet must be directly connected to each other in order to exchange some data packets. So, how can two nodes be able to exchange packets when they are not directly connected? “Routing” comes into the play at this point. It is nothing but to select paths in a network along which to send data packets 2 . Take the network topology in Figure 1 as an example. If Node A wants to send a data packet to Node B, it should follow an indirect path. Node A must send its data packet to Node N0, then again following a similar path, the packet should arrive to Node N1, where it will be passed to Node N2, and finally arrive at Node B, the destination node. Figure 1: An example network topology. Routing of data packets is achieved by the help of “routing tables”. Each node in the network has a routing table. An example routing table is given in Table 1. In a routing table, there is 1 http://en.wikipedia.org/wiki/Internet 2 http://en. wikipedia.org/wiki/Routing 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
a pair of node numbers for each possible destination 3 . This pair defines: the destination and the next node that the packet should be sent along the routing path to reach the destination. For example, in Table 1, the node that has this routing table should pass all the packets that it receives, which are destined to Node N2, to Node N9. destination
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 5

router - EE322C: Data Structures Programming Assignment #1...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online