Improving Internet Speed: A Comparison of Round-Trip Time Algorithms
Stephanie Lukin, Department of Computer Science, Loyola University Maryland Bruno Nunes, Kerry Veenstra, Katia Obrackza
Department of Computer Engineering, University of California, Santa Cruz
The time it takes for a packet to traverse the internet is a difficult value to calculate. Based upon this Round-Trip Time (RTT), a timer is set. It is initiated when the packet is sent, and is terminated when the sender receives an acknowledgement from the recipient indicating the packet’s completed delivery. We can reduce the amount of time wasted during internet communication by closely estimating this travel time. The Inter-Networking Research Group (i-NRG) at the University of California, Santa Cruz, have developed their own approximating algorithm which they have compared to the original algorithm named after its developer, Jacobson. This summer’s research was to look at another approximating algorithm, called Eifel, and compare the results of all three.
Stephanie Lukin, under the guidance of Katia Obraczka and her graduate students Kerry Veenstra and Bruno Nunes, created a module which tested the computation of each approximator algorithm. Once the module was integrated into the network testbed, Stephanie and the graudate students devised a series of tests looking not only at the varying RTT values themselves but at their effect on the entire network communication. This work began last year by the i-NRG team and with Stephanie’s contribution, the team will be able to analyze these results and submit a research paper on their findings.
Stephanie is a rising senior Computer Science major and Mathematics minor at Loyola University Maryland.In addition to concentrating on computing and its applications, Stephanie is involved with the Chamber Ensemble and Chapel Choir where she plays flute and sings at weekly mass. Her goal is to attend graduate school and pursue a Ph.D. in Computer Science.