没有合适的资源?快使用搜索试试~ 我知道了~
首页多类OBS节点的有限时间阻塞概率的Erlang近似
多类OBS节点的有限时间阻塞概率的Erlang近似
0 下载量 93 浏览量
更新于2024-08-26
收藏 692KB PDF 举报
本文主要探讨了多类光纤网络通信系统(PhotonNetwCommun, 2015)中光学突发交换(OBS)节点的阻塞时间分析。在OBS网络中,阻塞时间是一个关键的性能指标,它表示给定类别突发流占用通道的时间长度,这对于性能评估和流量管理至关重要。作者针对单通道的多类OBS节点进行了研究,这种节点通过为不同类别设置不同的突发延迟时间来区分流量。 研究假设突发流量以泊松过程的方式到达,且突发的长度遵循相位类型分布。作者利用多层随机流体模型(Multi-layer stochastic fluid model)这一理论工具,成功地获得了给定类别突发在OBS节点中有限时间概率的Erlangian近似。Erlangian近似是一种经典的概率模型,它将复杂的服务过程简化为一系列独立的 Erlang 分组服务过程,适用于处理具有多个服务阶段的情况。 为了实现这个Erlangian近似,论文提出了一个明确的算法和步骤,使得理论计算更加实用。算法详细描述了如何通过统计方法和数学推导,将复杂的突发流行为转换为易于理解和计算的Erlang分布参数。这不仅有助于网络设计者预测节点的性能,也有助于优化网络资源分配和流量调度策略。 作者通过数值结果展示了Erlangian近似在实际应用中的有效性,这些结果对比了理论分析与实际观测,为评估多类OBS节点的阻塞性能提供了有力的工具。这项研究对于理解和改进光纤网络的突发交换服务性能,特别是在高负载、多类并发场景下,具有重要的理论价值和实践意义。
资源详情
资源推荐
Photon Netw Commun (2015) 30:167–177 169
Fig. 1 The component (δ, L)
represents the burst, where the
first element δ is the offset time,
while the second element L is
the length of the burst. There are
three classes of burst associated
with offset time 2, 4 and 6. The
first plot shows a sample
channel horizon path. The
second plot shows the
transformed MLSFM. τ
δ
2
7
and
τ
δ
1
5
are corresponding to the
blocking time B
1
(7) and B
2
(5)
the channel is occupied for this incoming burst-v (v ≤ k,
since H (t) = H (t−) + L
k
+ δ
k
>δ
k
>δ
v
). We are inter-
ested the following important question that, when some class
of burst is blocked, how long is it before t he channel is avail-
able again for this class of incoming burst?
We assume that at time t , H (t ) = w>δ
k
and at
this time epoch BCP-k (burst-k) arrives, it is easy to see
that BCP-k (burst-k) is blocked, we refer to this time inter-
val from the time epoch at which BCP-k (burst-k)arrives
to the time epoch after which the channel is available
again for the potential burst-k as the blocking time of
burst-k. It is easy to see that the blocking time of burst-
k is dependent on the level of the channel horizon H(t),
and we denote the blocking time of burst-k by B
k
(w)
given the level of horizon is w at the time epoch that
the burst-k arrives. As depicted in Fig. 1, the blocking
time B
k
(w) is also the time duration from the time epoch
that the burst-k arrives and is blocked to the time epoch
that the channel horizon first hits the level δ
k
from the
above.
2.1 The multi-layer stochastic fluid model for an OBS
node
We first introduce some necessary notations. For a matrix A,
we let A
ij
be the block matrix of A, and denote its (i, j)th
element by [A]
ij
. We also write I
n
and e
n
as the unit matrix
and unit column vector with dimension n, when not causing
ambiguity, we write I and e for short. We let 0 be a zero
matrix with an appropriate dimension.
Stochastic fluid models (SFMs) have been studied exten-
sively for a few decades, and they have been particularly
promising tools for studying telecommunication networks
[10–13], insurance theoretical models [14–17], and for appli-
cations in some other areas [18–20]. SFM is an input–output
system of fluid with a finite (or infinite) buffer, which consists
of the level process and the background process. The level
process has a continuous domain and it indicates the amount
of workload (or fluid) in the system, while the background
process is a homogeneous Markov process on the finite state
space. The s tate space of the background process determines
the rate of net flow of workload into the system, which is
called fluid rate. In the basic version of SFM, the fluid rates
are independent of the fluid level, however, in a more general
set of Markov fluid models, the fluid rates is a determinis-
tic piecewise-constant function of the fluid level, then this
process is referred to as multi-layer stochastic fluid model,
or in short MLSFM. Other authors also call it feedback sto-
chastic fluid model (FSFM) in [21] or feedback Markov fluid
queue (FMFQ) in [5,7].
It is well known that time-dependent performance metrics
of fluid queueing systems play a crucial role in identifying the
Quality of Service (QoS) requirements guaranteed for users,
e.g. [12,15–17,22,23]. In the present paper, the value of our
technique to approximate the blocking time of multi-class
OBS nodes is that a stochastic transformation method is pro-
123
剩余10页未读,继续阅读
weixin_38725450
- 粉丝: 1
- 资源: 913
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
最新资源
- 李兴华Java基础教程:从入门到精通
- U盘与硬盘启动安装教程:从菜鸟到专家
- C++面试宝典:动态内存管理与继承解析
- C++ STL源码深度解析:专家级剖析与关键技术
- C/C++调用DOS命令实战指南
- 神经网络补偿的多传感器航迹融合技术
- GIS中的大地坐标系与椭球体解析
- 海思Hi3515 H.264编解码处理器用户手册
- Oracle基础练习题与解答
- 谷歌地球3D建筑筛选新流程详解
- CFO与CIO携手:数据管理与企业增值的战略
- Eclipse IDE基础教程:从入门到精通
- Shell脚本专家宝典:全面学习与资源指南
- Tomcat安装指南:附带JDK配置步骤
- NA3003A电子水准仪数据格式解析与转换研究
- 自动化专业英语词汇精华:必备术语集锦
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功