Dynamic Bandwidth Allocation Algorithm for Multimedia Services over Ethernet PONs

Ethernet passive optical networks (PONs) are an emerging access network technology that provides a low‐cost method of deploying optical access lines between a carrier's central office and a customer site. In this paper, we propose a new algorithm of dynamic bandwidth allocation for multimedia services over Ethernet PONs. To implement the suggested dynamic bandwidth allocation algorithm, we present control message formats that handle classified bandwidths in a multi‐point control protocol of Ethernet PONs.     

Ethernet PONs: a survey of dynamic bandwidth allocation (DBA) algorithms

Optical networks are poised to dominate the access network space in coming years. Ethernet passive optical networks, which leverage the ubiquity of Ethernet at subscriber locations, seem destined for success in the optical access network. In this article we first provide a brief introduction to Ethernet passive optical networks, followed by a discussion of the problem of dynamic bandwidth allocation. We then introduce a framework for classifying dynamic bandwidth allocation schemes and provide a comprehensive survey of the dynamic bandwidth allocation methods proposed to date. We conclude with a side by side comparison of the schemes based on their most prominent characteristics, and outline future developments of dynamic bandwidth allocation schemes.     

Hierarchical Dynamic Bandwidth Allocation Algorithm for Multimedia Services over Ethernet PONs

In this paper, we propose a new dynamic bandwidth allocation (DBA) algorithm for multimedia services over Ethernet PONs (passive optical networks). The proposed algorithm is composed of a low‐level scheduler in the optical network unit (ONU) and a high‐level scheduler in the optical line terminal (OLT). The hierarchical DBA algorithm can provide expansibility and efficient resource allocation in an Ethernet PON system in which the packet scheduler is separated from the queues. In the proposed DBA algorithm, the OLT allocates bandwidth to the ONUs in proportion to the weight associated with their class and queue length, while the ONU preferentially allocates its bandwidth to queues with a static priority order. The proposed algorithm provides an efficient resource utilization by reducing the unused remaining bandwidth caused by the variable length of the packets. We also define the service classes and present control message formats conforming to the multi‐point control protocol (MPCP) over an Ethernet PON. In order to evaluate the performance, we designed an Ethernet PON system on the basis of IEEE 802.3ah “Ethernet in the first mile” (EFM) using OPNET and carried out simulations. The results are analyzed in terms of the channel utilization, queuing delay, and ratio of the unused remaining bandwidth.     

Dynamic capacity allocation for quality-of-service support in IP-based satellite networks

In broadband satellite access networks, the efficient management of the return channel transmission capacity is key in reducing the service cost while satisfying the QoS requirements of IP-based multimedia applications. In this article a dynamic capacity allocation scheme based on combined free/demand assignment multiple access is proposed, allowing the return channel capacity to be efficiently shared among many user terminals. Simulation results indicate that the proposed scheme provides adequate DiffServ IP QoS support while maintaining high satellite bandwidth utility and reduced DCA signaling overhead.     

EPON中一种动态带宽分配算法

以太无源光网络(EPON)被认为是下一代宽带接入的最有效的解决方案。文章提出了一种新的基于EOPN提供多种服务的动态带宽分配算法。为了能够应用这种算法还给出了协助带宽分配多点控制协议(MPCP)的控制消息的格式。     

Dynamic bandwidth allocation for interactive applications

The transmission of stored video across an ATM network is considered for interactive applications with bounded reaction times. The performance of the services renegotiated VBR (RVBR) and renegotiated CBR (RCBR) is investigated for this class of applications by trace-driven simulations. The goal is to determine the most efficient service for interactive applications. Here we present three basic results. First, for delay sensitive applications smoothing the video stream in advance is much more efficient than adding smoothing buffers to the network switches. Second, services with renegotiation (RCBR, RVBR) are better suited for interactive applications than the static services CBR and VBR. Third, the RVBR service with a deterministic call admission control scheme is the best choice for interactive applications that require small reaction times.     

GPON中的动态带宽分配

首先介绍了吉比特无源光网络(GPON)的复用结构和所承载的业务,随后就GPON的关键技术之一——动态带宽分配作了详细论述,分别从带宽分配的功能、对象和过程这几个方面作了介绍,最后比较了GPON和宽带无源光网络(BPON)在动态带宽分配方面的不同。     

Priority-based dynamic bandwidth allocation in Ethernet Passive Optical Networks

In this article, new Dynamic Bandwidth Allocation (DBA) algorithms which give high priority to some ONUs corresponding to important agencies are studied in order to manage emergency cases causing severe network traffic. In order to deal with such cases, the network state is divided into two states, namely the normal and the emergency states. We apply the Weighted Round Robin (WRR)-based algorithm to the normal state, and three priority-based DBA algorithms are applied to the emergency state. These algorithms are different from each other according to the mode of protecting non-priority ONUs from starving. Each algorithm is analyzed in terms of utilization of the uplink bandwidth and the average packet delay. Simulation and theoretical results show that the proposed algorithms are working properly at the emergency state and can satisfy more stringent QoS requirements than WRR algorithms.

Dynamic bandwidth allocation using loss-load curves

Loss-load curves are a feedback mechanism for rate-based congestion control in packet-switched networks. The novel feature of loss-load curves is that they provide a direct mathematical relationship between offered load and the level of packet loss within the network. With this feedback information, traffic sources can dynamically compete for and share the available bandwidth on a network. Sources can use loss-load curve information to maximize raw throughput, to optimize file transfer response time, or to control end-to-end packet loss within the network. The focus of this paper is on the mathematical underpinnings of the loss-load model. The paper presents three key theoretical results for the loss-load model, and then discusses the advantages and disadvantages of the loss-load approach to dynamic bandwidth allocation. Formal proofs of the theoretical results are given     

A survey of dynamic bandwidth allocation algorithms for Ethernet Passive Optical Networks

Ethernet Passive Optical Network (EPON) has been widely considered as a promising technology for implementing the FTTx solutions to the “last mile” bandwidth bottleneck problem. Bandwidth allocation is one of the critical issues in the design of EPON systems. In an EPON system, multiple optical network units (ONUs) share a common upstream channel for data transmission. To efficiently utilize the limited bandwidth of the upstream channel, an EPON system must dynamically allocate the upstream bandwidth among multiple ONUs based on the instantaneous bandwidth demands and quality of service requirements of end users. This paper introduces the fundamental concepts on EPONs, discusses the major issues related to bandwidth allocation in EPON systems, and presents a survey of the state-of-the-art dynamic bandwidth allocation (DBA) algorithms for EPONs.     

Ethernet passive optical network architectures and dynamic bandwidth allocation algorithms

We compile and classify the research work conducted for Ethernet passive optical networks. We examine PON architectures and dynamic bandwidth allocation algorithms. Our classifications provide meaningful and insightful presentations of the prior work on EPONs. The main branches of our classification of DBA are: grant sizing, grant scheduling, and optical network unit queue scheduling. We further examine the topics of QoS support, as well as fair bandwidth allocation. The presentation allows those interested in advancing EPON research to quickly understand what already was investigated and what requires further investigation. We summarize results where possible and explicitly point to future avenues of research.     

Dynamic bandwidth allocation with fair scheduling for WCDMA systems

Dynamic bandwidth allocation (DBA) will play an important role in future broadband wireless networks, including the 3G and 4G WCDMA systems. A code-division generalized processor sharing (CDGPS) fair scheduling DBA scheme is proposed for WCDMA systems. The scheme exploits the capability of the WCDMA physical layer, reduces the computational complexity in the link layer, and allows channel rates to be dynamically and fairly scheduled in response to the variation of traffic rates. Deterministic delay bounds for heterogeneous packet traffic are derived. Simulation results show that the proposed CDGPS scheme is effective in supporting differentiated QoS, while achieving efficient utilization of radio resources.     

EPON中支持多业务接入的动态带宽分配算法研究

以太网无源光网络(EPON)被视为下一代宽带接入网络(最后一公里问题)的最有吸引力的解决方案.EPON的一个主要特征是终端用户间共享上行信道,使用媒介接入控制方法来为不同流量类型提供多种服务.根据对已有的EPON上行带宽分配方案进行研究分析,并结合目前用户的多业务接入实际情况,提出了一种全面多业务接入的动态带宽分配的算法.     

Dynamic bandwidth allocation algorithm utilizing full band

A kind of Dynamic Full Bandwidth Utilized （DFBU） allocation algorithm is introduced. This algorithm allows a single link to use bandwidth far beyond its fair share bandwidth in a multi-service packet transporting system. Three important parameters as the bound on maximum and minimum bandwidth, the maximum packet delay and the minimum band width utilization are discussed and analyzed. Results of experiments show that the DFBU-algorithm is capable of making a single link in the system to use all the spare bandwidth （up to full-bandwidth） while the performance of fairness and QoS requirement is still guaranteed.     

Generalized quality-of-service routing with resource allocation

We present a general framework for the problem of quality-of-service (QoS) routing with resource allocation for data networks. The framework represents the QoS parameters as functions rather than static metrics. The formulation incorporates the hardware/software implementation and its relation to the allocated resources into a single framework. The proposed formulation allows intelligent adaptation of QoS parameters and allocated resources during a path search, rather than decoupling the path search process from resource allocation. We present a dynamic programming algorithm that, under certain conditions, finds an optimal path between a source and destination node and computes the amount of resources needed at each node so that the end-to-end QoS requirements are satisfied. We present jitter and data droppage analyzes of various rate-based service disciplines and use the dynamic programming algorithm to solve the problem of QoS routing with resource allocation for networks that employ these service disciplines.     

End-to-end bandwidth allocation scheme for voice traffic support over MANETs

Multimedia and real-time applications require bandwidth guarantees, which can be achieved by resource reservation. However, bandwidth reservation in ad-hoc networks is a very challenging task due to the instability of radio channels, node mobility and lack of coordination between mobile nodes. Most proposed reservation protocols focus on point-to-point reservations, and only a few work has been done to propose an efficient end-to-end reservation scheme. In this paper, we propose a reservation scheme called End-to-end reservation scheme for voice and data traffic support (EERV). The basic component of our protocol is a handshake mechanism which has the role to establish point-to-point reservations, and to ensure consistency of reservations between neighbor nodes. Both data and voice sources are allowed to establish reservations with priority given to voice sources. This reservation scheme is extended to support the reservation and release of resources along a path in cooperation with the routing layer. Our reservation scheme is based on DSR, a well-known reactive routing protocol. Mobility of nodes and node failure cause frequent reservation breakages resulting in significant performance degradation. In order to resolve this issue we propose a reservation loss detection and reservation recovery mechanisms. We achieved intensive simulations to evaluate the performance of our protocol. Simulation results show the effectiveness of this protocol.     

Grant-sizing-differentiated bandwidth allocation algorithm for the coexistence of ONUs with and without wavelength tunability in WDM/TDM PONs

Adopting the pay-as-you-grow approach to upgrade passive optical network (PON) facilities by WDM technology insures the smoothness of the upgrade, and also results in the coexistence of wavelength-fixed/tunable optical network units (ONUs) in WDM/TDM PONs. Dynamic bandwidth allocation (DBA) is the key to support such coexistence of heterogeneous ONUs. Thus, DBA is also the key to support the smooth evolution of PONs. To more fairly coordinate the bandwidth allocation among the coexisting heterogeneous ONUs, a differentiated grant sizing (DGS) scheme is proposed. In DGS, not only the fairness between the wavelength-fixed/tunable ONUs but also the fairness between the lightly/heavily loaded ONUs is taken into account. To further carry out load balancing among wavelengths, a grant scheduling scheme is also proposed to cooperate with the grant sizing scheme. In the grant scheduling scheme, a measure of the ONUs’ flexibility is given, and then the least flexible job first rule (LFJF) is adopted for joint wavelength and time-slot assignment. Finally, to demonstrate the effectiveness of the proposed algorithm, a series of comparative analyses is conducted based on simulation experiments.     

混合TDM/WDM EPON中动态带宽分配算法

针对TDM EPON向WDM EPON升级过程中各个光网络单元(ONU)支持波长数不尽相同的特点,提出一种基于波长间负载均衡的动态带宽分配算法(LB-DBA).该算法在分配带宽时考虑波长信道的带宽约束,同时分两步确定授权给ONU的发送波长和发送时间,有利于波长信道间的负载均衡.仿真结果表明,LB-DBA可以避免已有算法在混合TDM/WDM EPON中可能出现的授权周期长度增加和资源利用率低等问题,有效改善网络性能.     

Dynamic reconfiguration policies for reconfigurable coded-WDM PONs

This article studies the issues arising when reconfiguring coded-WDM networks to provide protection against eavesdropping. Although the ability to reconfigure coded-WDM PONs dynamically has been recognized as an effective means of improving the security of OCDMA networks, this article provides the first in-depth study of the tradeoffs involved in carrying out this reconfiguration process. The article commences by showing that the degree of confidentiality and the traffic loss are two important, but conflicting, objectives in the design of reconfiguration policies. The reconfiguration problem is then formulated as a Markovian decision process (MDP). The results obtained from MDP theory are applied to establish optimal reconfiguration policies for coded-WDM networks with various system parameters. Finally, the advantages of the optimal reconfiguration policies over a class of threshold-based policies are illustrated through simulation results.