Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline

Németh, Felicián; Barta, Peter I.; Szabó, Rita; Bı́ró, József

doi:10.1016/j.comnet.2004.11.022

Cited by 5 publications

(3 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When the initial service curves are convex and piecewise affine with a finite number of pieces, the convolution comes to concatenating all the pieces of the different curves sorted by non-decreasing slopes (up to removing a few pieces at the end). This theorem stated in [5] has been used by various authors [6,8,17,21,22,25,27]. Unfortunately the proof presented in [5] is incomplete (Remark 2).…”

Section: Introductionmentioning

confidence: 98%

See 1 more Smart Citation

Computation of a (min,+) multi-dimensional convolution for end-to-end performance analysis.

Bouillard¹,

Jouhet²,

Thierry³

2008

Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools

View full text Add to dashboard Cite

Network Calculus is an attractive theory to derive deterministic bounds on end-to-end performance measures. Nevertheless bounding tightly and quickly the worst-case delay or backlog of a flow over a path with cross-traffic remains a challenging problem. This paper carries on with the study of configurations where a main flow encounters some cross-traffic flows which interfere over connected sub-paths. We also assume that no information is available about scheduling policies at the nodes (blind multiplexing). Such configurations were first analyzed in [25,27] where a "Pay Multiplexing Only Once" (PMOO) phenomenon was identified, and then in [6,7] where a (min, +) multi-dimensional operator was introduced to compute a minimum service curve for the whole path. Under usual assumptions (concave arrival curves and convex service curves), we prove some properties of this new operator and we show how to use it to derive bounds on delays and backlogs in polynomial time.We also discuss the simpler case when there is no crosstraffic. Then the analysis is known to boil down to the (min, +) convolution of all the service curves over the path. For convex and piecewise affine service curves, a specific theorem enables to compute efficiently the convolution. This theorem has been used by several authors [6,8,17,21,22,25,27], but they all refer to a proof which is unfortunately incomplete [5]. To set definitely this theorem, we provide three different proofs. We also investigate the complexity of computing performances bounds in this case.

show abstract

Section: Introductionmentioning

confidence: 98%

“…For convex and piecewise affine service curves, a specific theorem enables to compute efficiently the convolution. This theorem has been used by several authors [6,8,17,21,22,25,27], but they all refer to a proof which is unfortunately incomplete [5]. To set definitely this theorem, we provide three different proofs.…”

Section: Introductionmentioning

confidence: 99%

Computation of a (min,+) multi-dimensional convolution for end-to-end performance analysis.

Bouillard¹,

Jouhet²,

Thierry³

2008

Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools

View full text Add to dashboard Cite

show abstract

“…As one of the important indexes of network performance of network time delay, research is of great significance, the network communication system, network control system, remote medical treatment, network video transmission has a direct impact [2][3][4]. Besides the Ping method [5,6], there are some other methods which can be adopted for network delay measurement.…”

Section: Introductionmentioning

confidence: 99%

Research on the Distribution and Self-Similarity Characteristic of End-To-End Network Delay

Liu¹,

Xue²,

Zhao³

et al. 2015

IJFGCN

View full text Add to dashboard Cite

As an important indicator of evaluating network performance, network delay can reflect the transmission performance of the current path and also the service level provided by the opposite terminal host. In the paper, analysis is first conducted on the composition of network delay; besides, through Ping measuring method, Ping measuring network delay experiment is conducted on different destination hosts of local area network (LAN) and wide area network (WAN). Besides, the distribution features of network delay as time changes is analyzed, while the influence of data package (in terms of the size) on network delay will be explored in the paper. After the process, the definition, along with the distinguishing method of the self-similarity process is introduced, and selfsimilarity distinguishing is rendered on network delay through

show abstract

References

2018

Deterministic Network Calculus

View full text Add to dashboard Cite

Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline

Cited by 5 publications

References 40 publications

Computation of a (min,+) multi-dimensional convolution for end-to-end performance analysis.

Computation of a (min,+) multi-dimensional convolution for end-to-end performance analysis.

Research on the Distribution and Self-Similarity Characteristic of End-To-End Network Delay

References

Contact Info

Product

Resources

About