Scalable distributed router mechanisms to encourage network congestion avoidance
Rena Whei-Ming Yang · 1998
Many forces have led to an increase in the amount of network traffic which is non-adaptive in the presence of congestion. This non-congestion-controlled network traffic is difficult to constrain because of the aggregating process which occurs within the network. Previous attempts have been made to enforce compliance to network feed-back by isolating and regulating individual flows, but with these come considerable development and/or computational costs. However, several new designs are emerging which allow less costly access to infor-mation to identify traffic flows which could be considered non-congestion-controlled and which provide ways to penalize these flows locally. This thesis studies a means of using such mechanisms to identify nonadaptive network flows, and proposes a proto-col to push this information, along with penalization responsibility, towards the flows' sources. This reduces the negative effects that these flows have on adaptive network traffic competing for the same resources. We propose a design for such a pushback protocol, build a network simulation of this pushback protocol integrated with an