Deterministic packet marking for link price estimation

Abstract

Traditionally, window-based congestion flow control protocols such as Slow Start, Congestion Avoidance, Fast Recovery and Fast Retransmit are mainly used for congestion control in Internet. Those window-based congestion flow control protocols rely on packet loss for indicating congestion. However, price-based congestion flow control protocols enable the source to determine the optimal rate at which data is transmitted to the receiver. So, the overall performance of price-based congestion flow control is better than window-based congestion flow control. Many price-based congestion flow control schemes require each link to maintain the congestion price as a congestion signal and convey this price information back to the source. Several deterministic packet marking schemes have emerged to convey the link prices to each source. In this project, we study a new marking scheme based on adaptive deterministic packet marking which can achieve max-min fairness. The performances between these schemes will be compared.