[Colloq] **Thesis Proposal ****January 24, 2003**

[Rachel Bates]

Date: Friday 24th of January 2003
Time: 9:45 am
Location: 149 Cullinane Hall

Thesis Proposal: On the Efficiency and Fairness of AIMD-based Congestion
                 Avoidance Algorithms

			by Adrian Llahanas

Advisor:   Prof. Vassilis Tsaoussidis
Committee: Prof. Paul Attie
	   Prof. Gene Cooperman
           Prof. Ibrahim Matta (Boston University)

Abstract:

Congestion is a common problem in packet networks.  Several resource
management techniques have been designed to deal with congestion.  AIMD is
the
dominant algorithm for congestion control since it is the core mechanism of
TCP. In this presentation I will explain briefly how this distributed
algorithm works and discuss its efficiency and fairness potential.

In the rest of the time I will present three algorithms that improve both
efficiency and fairness of AIMD up to 14%. In order to demonstrate the
practical impact of the algorithms, I will present results from experiments.

Based on my thesis proposal, I will discuss my future plans and I will
summarize my prior work.


Biography

Adrian Llahanas received his BSc degree in Computer science from University
of
Cyprus (1993-1997). Currently he is PhD candidate at Northeastern
University.
His research interests lie in computer networks and specifically in
congestion avoidance and control mechanisms. He is also working on transport
protocols over heterogeneous (wired/wireless) networks.
Adrian has published 4 journal articles and 10 conference papers.