For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
MXQ (MaXimal Queuing): A Network Mechanism for Controlling Misbehaving Flows in Best Effort Networks
Takashi SHIMIZU Masayoshi NABESHIMA Ikuo YAMASAKI Takashi KURIMOTO
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2001/05/01
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Issue on High-speed Internet Technology and its Applications)
fairness, misbehaving flows, best effort, Internet,
Full Text: PDF>>
The problems caused by misbehaving flows are becoming important issues in high-speed best effort networks. In this paper, we propose the MXQ (MaXimal Queuing) mechanism which correctly identifies and adequately penalizes misbehaving flows. Identification and penalization are the keys to controlling misbehaving flows, which is believed to be crucial for providing best effort services to a large number of residential customers at reasonable cost. The proposed mechanism consists of estimating incoming traffic at network edges and selective packet discard at network nodes. This combination realizes the identification and penalization in a correct, adequate and easy to understand way, thus maintaining the stability and efficiency of best effort networks. A number of experiments are performed on a prototype system to examine the unfairness caused by different TCP implementations, which is one type of misbehavior. The results show that the MXQ mechanism can adequately penalize the misbehaving flows, and can improve fairness, even when differently implemented TCP flows are present.