Approximation Analysis for Routing with Clue in Mesh TCP/IP Network
Piboonlit Viriyaphol, Chanintorn Jittawiriyanukoon · 2006
Transmission Control Protocol/ Internet Protocol (TCP/IP) network is widely used as the source of information and medium of communication. An Internet Protocol (IP) also becomes the most important core protocol used in the world’s largest network. The larger IP network size it becomes the longer IP addressing delay it endures, so many techniques are invented to increase the performance of the IP lookup process. One of the most interesting ideas is Routing with a Clue (RC) which introduces the distribution of IP lookup process to all nodes along the route/path. This paper compares the performance of the distributed IP lookup with conventional IP lookup process by applying to expandable meshed network. We simulated up to three meshed nodes network. Then, the performance matrices such as throughput (THRU), mean queue length (MQL), mean waiting time (MWT), and utilization factor ( ), are collected in order to explain the eect of expanding network (scalability) versus the performance of both networks. Results indicate that RC network outperforms vis-a-vis the conventional IP network in terms of expanding the network size. Moreover, the performance of the RC network is not dropping much compared to those of the IP network. As the data rates are increased, simulations show that throughputs from both RC and IP network also increased, however the throughputs as of RC network outperform in all data rates. The input trac fluctuates into the first mesh causing higher burden for nodes in the first mesh than ones in the next adjacent mesh, so performance parameters for nodes in the first mesh is found to be lower than those in the next meshes. Results from nodes in the higher mesh indicate that the nodes will handle little low trac,