Finding an appropriate end to end congestion control scheme for each type of flow, such as real-time or multicast flows, may be difficult. But it becomes even more complex to have these schemes be friendly among themselves and with TCP. The assistance of routers within the network for fair bandwidth sharing among the flows is therefore helpful. However, most of the existing mechanisms that provide this fair sharing imply complex buffer management and maintaining flow state in the routers. In this paper, we propose to realize this fair bandwidth sharing \it without per-flow state in the routers, using only a trivial queueing discipline. Packets are tagged near the source, depending on the nature of the flow. In the core of the network, routers use FIFO queues, and simply drop the packet with the highest tag value in case of congestion. We call our scheme \TUF, Tag-based Fair Queueing for Responsive and Unresponsive Flows, and compare it with the Core Stateless Fair Queueing (CSFQ) proposed recently by Stoica et al \citeStoica98S. We believe our approach is simpler, avoids in particular parameter tuning and label rewriting in the core routers, while providing similar performances. Moreover, tagging flows depending on their responsivenes- s to losses, as proposed in \TUF, avoids poor performances in bursty environme- nts, as in CSFQ.