A new algorithm for aggregate flow-based end-to-end delay bound

Zhao Yia; Zhang Zhongquan

doi:10.13756/j.gtxyj.2012.03.018

您当前的位置：

首页 >

文章列表页 >

A new algorithm for aggregate flow-based end-to-end delay bound

- A new algorithm for aggregate flow-based end-to-end delay bound
- Study on Optical communication Issue 3, Pages: 23-25(2012)
- 作者机构：
  
  西安通信学院
- 作者简介：
- 基金信息：
- DOI：10.13756/j.gtxyj.2012.03.018
  CLC： TN929.1
- Published：2012，
扫描看全文
[1]赵一A,张中荃.一种基于聚合流的端到端统计时延界的新算法[J].光通信研究,2012(03):23-25+29.

Zhao Yia, Zhang Zhongquan. A new algorithm for aggregate flow-based end-to-end delay bound. [J]. (3):23-25(2012)
[1]赵一A,张中荃.一种基于聚合流的端到端统计时延界的新算法[J].光通信研究,2012(03):23-25+29. DOI： 10.13756/j.gtxyj.2012.03.018.

Zhao Yia, Zhang Zhongquan. A new algorithm for aggregate flow-based end-to-end delay bound. [J]. (3):23-25(2012) DOI： 10.13756/j.gtxyj.2012.03.018.

摘要

为分析融合网络中聚合业务的端到端时延性能

提出一种基于聚合流的融合网络端到端统计时延界的新算法。该算法利用MGF（矩母函数）重新表征了网络端到端时延界的MGF形式的概率模型。数值分析结果表明了该算法的有效性和优越性

该算法很大程度上提高了独立统计复用

对融合网络性能评价具有参考意义。

Abstract

In order to analyze the end-to-end delay performance of aggregate traffic in converged networks

this paper proposes a new algorithm for the end-to-end statistical delay bound of aggregate flow-based converged networks.Using the theorem of the Moment Generating Function（MGF）

this algorithm re-characterizes the MGF probabilistic model of network end-to-end delay bound.Numerical analysis results show that this algorithm is effective and can improve independent statistical multiplexing to a great extent

offering much value of reference for converged network performance evaluation.

关键词

聚合流业务融合网络统计网络演算矩母函数

Keywords

aggregate trafficconverged networkstatistical network calculusMGF

references

更多指标>

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Research on statistical network calculus-based bandwidth demand of dual leaky bucket models

Related Author

No data

Related Institution

No data

⁰