n this paper we deal with the characterization and computation of the $p$ value, say $p_{opt}$, corresponding to the maximum protocol capacity in $p$-persistent CSMA protocols. The contribution of this paper is twofold. First, we give an analytical justification, and a numerical validation of a heuristic formula widely used in the literature to characterize the $p_{opt}$. Second, we provide closed formulas for the $p_{opt}$, and we show that the optimal capacity state, given the message length distribution, is characterized by an invariant figure: the $Mp_{opt}$ product.
Optimal capacity of p-peristent CSMA protocols
Bruno R;Conti M;Gregori E
2003
Abstract
n this paper we deal with the characterization and computation of the $p$ value, say $p_{opt}$, corresponding to the maximum protocol capacity in $p$-persistent CSMA protocols. The contribution of this paper is twofold. First, we give an analytical justification, and a numerical validation of a heuristic formula widely used in the literature to characterize the $p_{opt}$. Second, we provide closed formulas for the $p_{opt}$, and we show that the optimal capacity state, given the message length distribution, is characterized by an invariant figure: the $Mp_{opt}$ product.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


