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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Takashi SHIMIZU, Masayoshi NABESHIMA, Ikuo YAMASAKI, Takashi KURIMOTO, "MXQ (MaXimal Queuing): A Network Mechanism for Controlling Misbehaving Flows in Best Effort Networks" in IEICE TRANSACTIONS on Information,
vol. E84-D, no. 5, pp. 596-603, May 2001, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_5_596/_p
Copy
@ARTICLE{e84-d_5_596,
author={Takashi SHIMIZU, Masayoshi NABESHIMA, Ikuo YAMASAKI, Takashi KURIMOTO, },
journal={IEICE TRANSACTIONS on Information},
title={MXQ (MaXimal Queuing): A Network Mechanism for Controlling Misbehaving Flows in Best Effort Networks},
year={2001},
volume={E84-D},
number={5},
pages={596-603},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - MXQ (MaXimal Queuing): A Network Mechanism for Controlling Misbehaving Flows in Best Effort Networks
T2 - IEICE TRANSACTIONS on Information
SP - 596
EP - 603
AU - Takashi SHIMIZU
AU - Masayoshi NABESHIMA
AU - Ikuo YAMASAKI
AU - Takashi KURIMOTO
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E84-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2001
AB - 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.
ER -