Analysis and Implementation of a QoS Optimization Method for Access Networks

Zheng, Ling; Qiu, Zhiliang; Pan, Wei; Mei, Yibo; Sun, Shiyong; Zhang, Zhiyi

doi:10.1587/transcom.2017ebp3405

Cited by 2 publications

(1 citation statement)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the above system can be modeled as an

M

‐dimensional Markov chain, whose state can be described by the vector

bold-italicn = false(n_{1}, n_{2}, \dots, n_{M} false)

. The system's stationary distribution is described in the following form:

P false(n_{1}, n_{2}, \dots, n_{M} false) = \frac{ρ_{1}^{n_{1}} ρ_{2}^{n_{2}} \dots ρ_{M}^{n_{M}}}{G},

where

G

is a normalization constant guaranteeing that

P false(n_{1}, n_{2}, \dots, n_{M} false)

is a probability distribution, that is,

G = \sum_{false(n_{1}, n_{2}, \dots, n_{M} false) \in S} ρ_{1}^{n_{1}} ρ_{2}^{n_{2}} \dots ρ_{M}^{n_{M}},

where

S

is the state space of the Markov chain.…”

Section: System Model and Analysismentioning

confidence: 99%

Performance analysis and hardware implementation of a nearly optimal buffer management scheme for high‐performance shared‐memory switches

Liu

Pan

et al. 2020

Int J Communication

Self Cite

View full text Add to dashboard Cite

Summary Burst traffic is a common traffic pattern in modern IP networks, and it may lead to the unfairness problem and seriously degrade the performance of switches and routers. From the perspective of switching mechanism, the majority of commercial switches adopt the on‐chip shared‐memory switching architecture, and high‐speed packet buffer with efficient queue management is required to deal with the unfairness and congestion problem. In this paper, the performance of a shared‐private buffer management scheme is analyzed in detail. In the proposed scheme, the total memory space is split into shared area and private area. Each output port has a private memory area that cannot be used by other ports. The shared area is completely shared among all output ports. A theoretical queuing model of the proposed scheme is formulated, and closed‐form formulas for multiple performance parameters are derived. Through the numerical studies, we demonstrate that a nearly optimal buffer partition policy can be obtained by setting an equally small amount of private area for each queue. This work is validated by simulations as well as hardware experiments. Software simulations show that the proposed scheme performs better than existing methods, and packet dropping caused by burst traffic can be significantly reduced. Besides, a prototype of the buffer management module is implemented and evaluated in field programmable gate array platform. The evaluation shows that the proposed scheme can ensure the efficiency and fairness while keeping a high throughput in real workload.

show abstract

“…Therefore, the above system can be modeled as an