优化EPON多服务的自适应动态带宽分配算法
183 浏览量
更新于2024-08-27
收藏 555KB PDF 举报
本文探讨了一种在以太网无源光网络（Ethernet Passive Optical Network, EPON）上支持多服务的自适应动态带宽分配（Adaptive Dynamic Bandwidth Allocation, DBA）算法。EPON作为一种光纤接入技术，通过无源光分路器将电信号转换为光信号，为用户提供高速宽带接入服务。传统的DBA策略可能难以满足不同业务对带宽的需求和提供公平的服务质量（Quality of Service, QoS），特别是对于实时性和延迟敏感的应用。
作者Xiaobin Li、Long Dan和Qiong Wu来自深圳大学信息工程学院，他们针对这一问题提出了一种创新的算法。该算法旨在实现对ONU（Optical Network Unit，光网络单元）间的公平性，确保每个ONU都能根据其实际需求动态地分配带宽，同时满足多服务场景下的QoS标准。文章强调了适应性公平性在DBA中的关键作用，这意味着算法能够根据网络流量变化实时调整带宽分配策略，避免资源浪费并优化服务质量。
该研究在2011年6月27日收到初步提交，并于同年11月19日获得接受，最终发表在2012年的《Optik - International Journal of Light Electron Optics》上，DOI为10.1016/j.ijleo.2011.11.051。文章共包含5页内容，可以在SciVerse ScienceDirect的Optik期刊主页上找到全文和目录列表。
关键词包括Ethernet Passive Optical Network (EPON)，Dynamic Bandwidth Allocation (DBA)，Quality of Service (QoS)以及Adaptive Fairness。这篇研究论文为EPON网络的运营商和系统设计者提供了宝贵的理论依据和实践指导，帮助优化网络性能，提高用户满意度，是深入了解和应用EPON技术的重要参考资料。
Please
cite
this
article
in
press
as:
X.
Li,
et
al.,
Adaptive
dynamic
bandwidth
allocation
algorithm
supporting
multi-services
over
Ethernet
passive
optical
networks,
Optik
-
Int.
J.
Light
Electron
Opt.
(2012),
doi:10.1016/j.ijleo.2011.11.051
ARTICLE IN PRESS
G Model
IJLEO-51981;
No.
of
Pages
5
Optik
xxx
(2012)
xxx–xxx
Contents
lists
available
at
SciVerse
ScienceDirect
Optik
jo
ur
n
al
homepage:
www.elsevier.de/ijleo
Adaptive
dynamic
bandwidth
allocation
algorithm
supporting
multi-services
over
Ethernet
passive
optical
networks
Xiaobin
Li
∗
,
Long
Dan,
Qiong
Wu
College
of
Information
Engineering,
Shenzhen
University,
Shenzhen,
Guangdong
518060,
China
a
r
t
i
c
l
e
i
n
f
o
Article
history:
Received
27
June
2011
Accepted
19
November
2011
Available
online
xxx
Keywords:
Ethernet
passive
optical
network
(EPON)
Dynamic
bandwidth
allocation
(DBA)
Quality
of
service
(QoS)
Adaptive
Fairness
a
b
s
t
r
a
c
t
In
order
to
ensure
fairness
of
each
optical
networks
unit
(ONU)
in
access
network
and
meet
quality
of
service
(QoS)
requirements
of
differentiated
service
such
as
voice,
video
and
data,
Ethernet
passive
optical
network
(EPON)
dynamic
bandwidth
allocation
(DBA)
algorithm
should
avoid
light
load
penalty,
choose
different
scheduling
scheme
according
to
light
loading
or
heavy
loading
circumstances,
adaptively
adjust
the
order
of
ONUs
at
the
case
heavy
loading
in
order
to
guarantee
QoS.
Aiming
at
this
problem,
an
adaptive
dynamic
bandwidth
allocation
algorithm
supporting
multi-services
is
presented.
The
algorithm
guarantees
QoS
through
dividing
service
into
voice,
video
and
data
putting
them
into
different
queues,
optical
line
terminal
(OLT)
collects
all
requests
of
different
services
from
different
ONUs,
divides
the
adopted
scheduling
scheme
according
to
loading,
adaptively
adjusts
the
order
of
ONUs
queue
based
on
minimum
delay
at
the
case
heavy
load.
Therefore,
it
can
really
guarantee
QoS.
Simulation
results
of
the
algorithm
show
that
the
algorithm
not
only
can
support
multi-service
and
avoid
light
load
penalty,
but
also
can
guarantee
the
fairness
of
each
ONUs
and
QoS.
It
has
a
better
performance
than
other
algorithms
particularly
at
the
case
of
heavy
loading.
©
2011
Elsevier
GmbH.
All
rights
reserved.
1.
Introduction
With
the
rapid
development
of
various
network
services,
users’
requirements
for
access
network
bandwidth
and
quality
of
service
(QoS)
are
increasing.
Compared
with
traditional
access
technolo-
gies,
Ethernet
passive
optical
network
(EPON)
as
the
combination
of
Ethernet
and
passive
optical
network
technology,
has
became
one
of
the
best
scheme
in
broadband
access
network
[1,2].
EPON
is
a
point
to
multipoint
network
and
typical
topology
is
shown
as
in
Fig.
1.
In
the
downstream
direction,
optical
line
ter-
minal
(OLT)
broadcasts
frames
to
ONUs
and
each
ONU
picks
up
frames
of
their
own.
In
the
upstream
direction,
ONUs
send
frames
through
the
optical
distribution
network
directly
to
the
OLT,
but
cannot
reach
the
other
ONUs.
This
is
similar
to
a
point
to
point
net-
work,
but
there
maybe
a
conflict
when
the
entire
ONUs
send
frames
at
the
same
time.
Therefore,
a
good
dynamic
bandwidth
alloca-
tion
(DBA)
algorithm
is
needed
to
avoid
the
conflict,
equally
and
efficiently
allocate
the
system
bandwidth
among
the
ONUs
[3–5].
In
recent
years,
many
DBA
algorithms
are
proposed.
They
mainly
can
be
divided
into
two
kinds:
no
multi-queue
support-
ing
[6–9],
multi-queue
supporting
[10–14].
In
order
to
support
multi-services,
most
algorithms
divided
services
into
voice,
video
and
data.
OLT
assigned
bandwidth
to
ONUs
according
to
the
∗
Corresponding
author.
Tel.:
+86
755
26535364;
fax:
+86
755
26536198.
E-mail
address:
lixbsz@126.com
(X.
Li).
traffic
request
of
each
ONU
in
accordance
with
the
order
of
ONUs.
But
these
algorithms
did
not
really
ensure
QoS
and
consider
the
fairness
among
ONUs.
They
also
failed
to
fully
consider
the
priori-
ties
of
different
service
quality
requirements
and
adaptively
adjust
scheduling
scheme
and
then
the
order
of
ONUs
at
the
case
heavy
loading.
If
the
ONUs
order
scheduling
is
fixed,
it
cannot
guarantee
the
fairness
of
each
ONU,
especially
the
fairness
on
light
load
ONU.
For
example,
in
a
certain
assigning
cycle,
the
ahead
ONU
are
over-
loaded
with
data
and
the
back
ONUs
are
light-loaded
with
voice.
Then
the
light-loaded
ONUs
can
only
wait
after
the
overloaded
ONU
to
send
data
which
accounted
for
most
of
the
bandwidth
before
it
can
send
its
own
voice
service.
This
has
caused
relatively
large
packet
delay
for
the
light-loaded
ONUs,
which
is
not
fair
to
the
ONUs
in
the
back
of
the
row.
If
we
can
adjust
the
order
of
ONUs
according
to
the
network
circumstance
at
that
time,
then
we
can
solve
this
problem.
Aiming
at
the
problem,
an
adaptive
DBA
algorithm
which
can
adaptively
adjust
the
sending
order
of
ONUs
according
to
the
network
circumstances
is
presented.
The
algorithm
can
avoid
the
light
load
penalty,
enhance
the
highest
priority
service
traffic
pre-
dicted
accuracy
and
ensure
the
fairness
and
the
service
quality
of
the
ONUs.
2.
Overview
of
multi-services
supporting
DBA
algorithm
The
DBA
algorithm
in
[6,7]
has
divided
services
into
voice,
video
and
data,
but
cannot
guarantee
the
QoS
of
different
services.
The
0030-4026/$
–
see
front
matter
©
2011
Elsevier
GmbH.
All
rights
reserved.
doi:10.1016/j.ijleo.2011.11.051
下载后可阅读完整内容，剩余4页未读，立即下载
2021-09-19 上传
2021-03-12 上传
2022-07-06 上传
2021-10-05 上传
2014-09-19 上传
点击了解资源详情
2024-11-07 上传
2024-11-07 上传
weixin_38678022
- 粉丝: 1
- 资源: 950
我的内容管理
展开
最新资源
- 构建基于Django和Stripe的SaaS应用教程
- Symfony2框架打造的RESTful问答系统icare-server
- 蓝桥杯Python试题解析与答案题库
- Go语言实现NWA到WAV文件格式转换工具
- 基于Django的医患管理系统应用
- Jenkins工作流插件开发指南：支持Workflow Python模块
- Java红酒网站项目源码解析与系统开源介绍
- Underworld Exporter资产定义文件详解
- Java版Crash Bandicoot资源库：逆向工程与源码分享
- Spring Boot Starter 自动IP计数功能实现指南
- 我的世界牛顿物理学模组深入解析
- STM32单片机工程创建详解与模板应用
- GDG堪萨斯城代码实验室：离子与火力基地示例应用
- Android Capstone项目：实现Potlatch服务器与OAuth2.0认证
- Cbit类：简化计算封装与异步任务处理
- Java8兼容的FullContact API Java客户端库介绍
