The Internet has given to the proliferation of non-behaving flows that consume excess network bandwidth from behaving TCP flows. This has brought about the development of fair bandwidth sharing mechanisms at routers to deal with non-responsive flows. One such scheme that allocates bandwidth fairly to competing flows is Core Stateless Fair Queueing. This scheduling technique divides the network into edge routers that dominate the edge of the network core routers that inhabit the interior of the network. However complexity contained at the edge of the network can prohibit the full-scale implementation of the scheme. We discuss the development of an alternative fair bandwidth-sharing mechanism that removes the edge router complexity imposed by CSFQ et al. and distributes bandwidth fairly amongst competing flows. To this end, we propose an algorithm known as Source Layered Rate Estimation (SLRE).