TY - GEN
T1 - Further analysis of XCP equilibrium performance
AU - Wang, Peng
AU - Mills, David L.
PY - 2006
Y1 - 2006
N2 - Low analyzes the equilibrium performance of the recently developed eXplicit Control Protocol (XCP) by applying the derived window-based dynamical model. However, Low's window-based dynamic model is too complicated to be used easily. In our previous works, a simple rate-based model is proposed for analyzing XCP's equilibrium performance. Most results that appeared in Low's paper can be easily reproduced by applying our simple dynamic model. Furthermore, we prove that the shuffling parameter γ is no more than the parameter a to achieve high link utilization. In this paper, we derive stringent lower and upper bounds of link utilization provided with the new constraint γ ≤ α. Furthermore, to study the equilibrium performance of networks with the compensation policy, we use the simplest topology of two links in chains. The sufficient conditions of the compensation policy are proposed, and the link utilization with the compensation policy is derived as a root of a cubic equation. Simulation results are used to verify our results.
AB - Low analyzes the equilibrium performance of the recently developed eXplicit Control Protocol (XCP) by applying the derived window-based dynamical model. However, Low's window-based dynamic model is too complicated to be used easily. In our previous works, a simple rate-based model is proposed for analyzing XCP's equilibrium performance. Most results that appeared in Low's paper can be easily reproduced by applying our simple dynamic model. Furthermore, we prove that the shuffling parameter γ is no more than the parameter a to achieve high link utilization. In this paper, we derive stringent lower and upper bounds of link utilization provided with the new constraint γ ≤ α. Furthermore, to study the equilibrium performance of networks with the compensation policy, we use the simplest topology of two links in chains. The sufficient conditions of the compensation policy are proposed, and the link utilization with the compensation policy is derived as a root of a cubic equation. Simulation results are used to verify our results.
UR - https://www.scopus.com/pages/publications/50949126313
U2 - 10.1109/GLOCOM.2006.17
DO - 10.1109/GLOCOM.2006.17
M3 - Conference contribution
AN - SCOPUS:50949126313
SN - 142440357X
SN - 9781424403578
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
T2 - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
Y2 - 27 November 2006 through 1 December 2006
ER -