Paper #26

SF-FC: A Neighbor-State Based Flow Control
with Soft Fairness

Yosuke Tamura, Yoshito Tobe
& Hideyuki Tokuda
Keio University, Japan


Many audio and video stream applications in the Internet require good network performance but not perfect reliability. Such applications should employ congestion control and should not shut down the TCP flows by restricting buffering too much.

However, the Internet is not a small local community, and it is impossible to rely on all developers to incorporate end-to-end congestion control in their Internet applications. The network should take part in controlling its own resource utilization.

Most research for fair queuing tend to focus on reducing processing overhead and achieving exact fairness for each flow. In this paper we claim that perfect fair queuing is not effective for end users in the current complicated network environment.

We propose Soft Fair Flow Control(SF-FC) which is a light weight router mechanism that employs simple FIFO queuing, and shows high performance than other fair queuing. SF-FC provides fair network resource allocation to non-adaptive and adaptive flows. Each SF-FC router informs the upstream SF-FC router of its link state. Based on the received state, SF-FC dynamically sets the packet discard rate of the non-adaptive flows.

Download a copy of this paper in either: Compressed PostScript (835K) - or - PDF (324K) format.

Back to the NOSSDAV 2000 On-Line Proceedings.


- Last revised: Weds Jun 27 20:56:29 EDT 2000