|
|
|
| This is only the first few lines of this paper. If you would like to view the entire paper you need to register for free here. If you are already a member then login here. |
| Word Count: |
1026 |
Featured Papers from DirectEssays
1. Austalia
|
|
|
Routing: We’re Moving Now!
|
|
|
Before a message can be passed to its target, it has to be formed; the message is enveloped inside a packet, which is formed by putting the address information of the target as a header of the actual message, so that the destination of the message and its size etc. can be read before the actual message is received. The actual message is then encoded in order to lessen transmittal time. This finalized packet is what gets "pushed out of the door". Now our message is ready to be routed to its destination node. Routing is the act of moving a message from a source node or other network entity to its destination. A routing technique is a way of handling the message as it passes through individual nodes. A routing algorithm is a rule set for determining where to send a message next. There are several routing techniques used by entities accessing the Internet lets explore some of these routing techniques and algorithms. Dijkstra’s least cost algorithm finds all possible paths between two locations. After identifying all possible paths, it also identifies the least cost path. The algorithm can be applied to determine the least cost path between any pair of nodes; this is the basic principal of routing messages. Lets examine some interesting and notable aspects of routing. E-cube routing A message routing algorithm used on binary hypercubes. Hypercube is a topology used by early American multiprocessors where each node is the vertex of a d-Dimensional cube. If <|Sn-1...S0|> and <|Dn-1...D0|> are the binary co-ordinates of the source and destination of the message, and <|Xn-1...X0>| their difference, then the e-cube algorithm routes the message along links parallel to the axes corresponding to 1's in <|Xn-1...X0|>, in order from highest to lowest.
|
|
|
|
Still Can't Find What Your Looking For? Then Try a Essay Search!
|
