An AWG-based WDM-PON architecture employing WDM/TDMA transmission for upstream traffic with dynamic bandwidth allocation

In this article, we examine a candidate architecture for wavelength-division multiplexed passive optical networks (WDM-PONs) employing multiple stages of arrayed-waveguide gratings (AWGs). The network architecture provides efficient bandwidth utilization by using WDM for downstream transmission and by combining WDM with time-division multiple access (TDMA) for upstream transmission. In such WDM-PONs, collisions may occur among upstream data packets transmitted simultaneously from different optical networking units (ONUs) sharing the same wavelength. The proposed MAC protocol avoids such collisions using a request/permit-based multipoint control protocol, and employs a dynamic TDMA-based bandwidth allocation scheme for upstream traffic, called minimum-guaranteed maximum request first (MG-MRF), ensuring a reasonable fairness among the ONUs. The entire MAC protocol is simulated using OPNET and its performance is evaluated in terms of queuing delay and bandwidth utilization under uniform as well as non-uniform traffic distributions. The simulation results demonstrate that the proposed bandwidth allocation scheme (MG-MRF) is able to provide high bandwidth utilization with a moderately low delay in presence of non-uniform traffic demands from ONUs.     

Enhanced Dynamic Bandwidth Allocation Algorithm in Ethernet Passive Optical Networks

As broadband access is evolving from digital subscriber lines to optical access networks, Ethernet passive optical networks (EPONs) are considered a promising solution for next generation broadband access. The point‐to‐multipoint topology of EPONs requires a time‐division multiple access MAC protocol for upstream transmission. In this paper, we propose a new enhanced dynamic bandwidth allocation algorithm with fairness called EFDBA for multiple services over EPONs. The proposed algorithm is composed of a fairness counter controller and a fairness system buffer in the optical line terminal. The EFDBA algorithm with fairness can provide increased capability and efficient resource allocation in an EPON system. In the proposed EFDBA algorithm, the optical line termination allocates bandwidth to the optical network units in proportion to the fairness weighting counter number associated with their class and queue length. The proposed algorithm provides efficient resource utilization by reducing the unused remaining bandwidth made by idle state optical network units.     

On the performance and fairness of dynamic channel allocation in wireless mesh networks

Channel assignment in multichannel multiradio wireless mesh networks is a powerful resource management tool to exploit available multiple channels. Channels can be allocated either statically on the basis of long‐term steady state behavior of traffic or dynamically according to actual traffic demands. It is a common belief that dynamic schemes provide better performance; however, these two broad classes of channel allocation schemes have not been compared in detail. In this paper, we quantify the achievable performance gain and fairness improvement through an optimal dynamic channel allocation scheme. We develop optimal algorithms for a dynamic and three static schemes using mixed integer linear programming and compare them in the context of QoS provisioning, where network performance is measured in terms of acceptance rate of QoS sensitive traffic demands. Our extensive simulations show that static schemes should optimize channel allocation for long‐term traffic pattern and maintain max–min fairness to achieve acceptable performances. Although the dynamic and max–min fair static schemes accomplish the same fairness, the dynamic channel allocation outperforms the static scheme about 10% in most cases. In heavily overloaded regimes, especially when network resources are scarce, both have comparable performances, and the max–min fair scheme is preferred because it incurs less overhead. Copyright © 2011 John Wiley & Sons, Ltd.     

一种新的基于GPON的动态带宽分配算法

为了实现吉比特无源光网络(GPON)带宽分配的公平性,降低网络的丢包率及传输延时,文章研究了GPON系统传输汇聚层的帧结构及动态带宽分配的实现方法,提出了一种新的动态带宽分配(DBA)算法--基于QoS的二层动态带宽分配算法.基本思路是根据不同等级业务的带宽需求,在PON层和ONU层分别进行带宽的合理分配.理论分析和仿真试验证明,这种算法可以提高带宽的利用率,保证不同业务的不同时延要求,并且对不同用户和不同等级的业务都具有很好的公平性.     

弹性分组环中的公平算法浅析

弹性分组环（RPR,Resilient Packet Ring）作为下一代高速城域网的核心技术,具有高的带宽利用率、空间再利用和公平性等优良的特性。但要动态地获得这些特性,必须设计合理的带宽分配算法。文章指出了目前所采用的公平算法中存在的一些问题,探讨了一种更新的带宽分配算法;分布式虚拟时间调度（DVSR,Distributed Virtual-time Scheduling in Rings）算法。     

Efficient support for client/server applications over heterogeneousATM networks

We present a new network design problem that is applicable for designing virtual paths (VPs) in an asynchronous transfer mode (ATM) network to efficiently support client/server applications. We present several alternatives for the solution, compare their properties, and focus on a novel “greedy” solution, which we prove to optimize certain important criteria (namely, the network overhead for a request/response and the utilization of bandwidth and routing table resources). We also present simulation results that demonstrate the performance and scalability of our solution. In addition, we propose a new efficient bandwidth allocation scheme which is tailored for client/server applications over ATM networks     

Segment‐aware dynamic routing for DASH flows over software‐defined networks

Most of the video streaming applications running over the Internet send video data over HTTP and provide an architecture for video clients to adapt video quality during streaming. In HTTP adaptive streaming, a raw video is encoded at various qualities, each encoded video file is divided into small segments, and the clients may change the segment quality by sending requests for segments having different qualities over time. MPEG has standardized dynamic adaptive streaming over HTTP (MPEG‐DASH) due to this tendency. In this work, we focus on DASH over software‐defined networks (SDN), and we dynamically reroute DASH flows by considering the current network capacity, available bandwidth of the paths, and bitrate of the segments in order to provide high quality of experience (QoE) and fairness among DASH clients. Simulations performed under various network conditions show that the proposed study provides higher QoE and fairness compared with the max‐flow routing approach.     

Resource efficiency improved approach for shared path protection in EONs

For improving the resource efficiency of dynamic shared path protection in elastic optical networks, a survivable RSA (SRSA)-based heuristic algorithm is proposed in the paper. In SRSA, an adaptive adjustment link cost function is devised to effectively select working and protection paths. The cost function sufficiently considers available spectrum resources and the length of light paths for both working and protection paths. In order to achieve high resource efficiency, a spectrum allocation strategy named minimal cost stable set is proposed to allocate spectrum for protection paths with respect to the resource efficiency in the link cost function. And the graph coloring algorithm is introduced to select the shared protection path with the highest resource efficiency for the request. Compared with the shared path protection and dynamic load balancing shared path protection, simulation results show that the proposed SRSA decreases bandwidth blocking probability and achieves high resource efficiency.     

Rain granularity effects on bandwidth demand for faded DVB‐RCS systems

Broadband satellite communication networks, operating at Ka band and above, play a vital role in today's worldwide telecommunication infrastructure. The problem, however, is that rain can be the most dominant impairment factor for radio propagation above 10 GHz. This paper studies bandwidth and time slot allocation problem for rain faded DVB‐RCS satellite networks. We investigate how using finer rain granularity can improve bandwidth utilization in DVB‐RCS return links. The paper presents a mathematical model to calculate the bandwidth on demand. We formulate the radio resource allocation as an optimization problem and propose a novel algorithm for dynamic carrier bandwidth and time slots allocation, which works with constant bit rate type of traffic. We provide theoretical analysis for the time slot allocation problem and show that the proposed algorithm achieves optimal results. The algorithm is evaluated using a MATLAB simulation with historical rain data for the UK. Copyright © 2014 John Wiley & Sons, Ltd.     

网状WDM网中双链路失效的共享路径保护设计

该文研究了WDM网状网中双链路失效问题,在假定所有链路共享风险链路组(Share Risk Link Group, SRLG)分离的条件下,提出了一种动态共享路径保护(Dynamic Shared-Path Protection,DSPP)算法。DSPP能根据网络状态动态调整链路代价,为每条业务请求选择一条最小代价的工作路由和两条最小代价且SRLG分离的保护路由。仿真表明,DSPP不仅能完全保护双链路失效,并且能在资源利用率、阻塞率和保护切换时间之间进行性能折衷。     

EONs中一种混合路径专有保护算法

为了降低带宽阻塞率,节约频谱资源,在动态业务到达的弹性光网络(EONs)场景下,不同业务请求的路径状况可能不同,因此不能确定单路径专有保护与带宽分割多路径专有保护的优劣.文章结合单路径专有保护和带宽分割多路径专有保护提出了一种混合路径专有保护(HDPP)算法.该算法利用路径的单位频谱效率和路径跳数计算了k条链路不相关候...     

Adaptive subcarrier-distribution algorithm for routing and spectrum allocation in OFDM-based elastic optical networks

In this paper, we have proposed the adaptive subcarriers-distribution routing and spectrum allocation (ASD-RSA) algorithm, which is the first elastic optical network routing and spectrum allocation algorithm based on distributed subcarriers. It allocates lightpaths to request adaptively and proved to achieve much lower bandwidth blocking probability than traditional routing and spectrum allocation algorithms based on centralized subcarriers with integer linear programming and dynamic simulation methods. Additionally, the ASD-RSA algorithm performs the best with three alternate routing paths; this character will decrease the calculating amount of both alternate routing path searching and spectrum allocation immensely in large networks.     

Multi‐constrained Shortest Disjoint Paths for Reliable QoS Routing

Finding link‐disjoint or node‐disjoint paths under multiple constraints is an effective way to improve network QoS ability, reliability, and so on. However, existing algorithms for such scheme cannot ensure a feasible solution for arbitrary networks. We propose design principles of an algorithm to fill this gap, which we arrive at by analyzing the properties of optimal solutions for the multi‐constrained link‐disjoint path pair problem. Based on this, we propose the link‐disjoint optimal multi‐constrained paths algorithm (LIDOMPA), to find the shortest link‐disjoint path pair for any network. Three concepts, namely, the candidate optimal solution, the contractive constraint vector, and structure‐aware non‐dominance, are introduced to reduce its search space without loss of exactness. Extensive simulations show that LIDOMPA outperforms existing schemes and achieves acceptable complexity. Moreover, LIDOMPA is extended to the node‐disjoint optimal multi‐constrained paths algorithm (NODOMPA) for the multi‐constrained node‐disjoint path pair problem.     

SDN‐based fault‐tolerant on‐demand and in‐advance bandwidth reservation in data center interconnects

Geographically distributed data centers are interconnected through provisioned dedicated WAN links, realized by circuit/wavelength–switching that support large‐scale data transfer between data centers. These dedicated WAN links are typically shared by multiple services through on‐demand and in‐advance resource reservations, resulting in varying bandwidth availability in future time periods. Such an inter‐data center network provides a dynamic and virtualized environment when augmented with cloud infrastructure supporting end‐host migration. In such an environment, dynamically provisioned network resources are recognized as extremely useful capabilities for many types of network services. However, the existing approaches to in‐advance reservation services provide limited reservation capabilities, eg, limited connections over links returned by the traceroute over traditional IP‐based networks. Moreover, most existing approaches do not address fault tolerance in the event of node or link failures and do not handle end‐host migrations; thus, they do not provide a reliability guarantee for in‐advance reservation frameworks. In this paper, we propose using multiple paths to increase bandwidth usage in the WAN links between data centers when a single path does not provide the requested bandwidth. Emulation‐based evaluations of the proposed path computation show a higher reservation acceptance rate compared to state‐of‐art reservation frameworks, and such computed paths can be configured with a limited number of static forwarding rules on switches. Our prototype provides the RESTful Web service interface for link‐fail and end‐host migration event management and reroutes paths for all the affected reservations.     

A spectrum-efficient algorithm based on traffic splitting and merging transmission for anycast in inter-datacenter elastic optical networks

Anycast is attracting much attention due to the need of scalable and cost-effective data delivery in inter-datacenter elastic optical networks. However, spectrum fragmentation degrades network’s performance and decreases probability of successful anycast delivery significantly. When the idle spectrum block in elastic optical network is not enough to transmit the anycast request, spectrum splitting with multi-path transmitting the anycast is an effective approach to improve the spectrum fragmentation utilization. For improving spectrum utilization and reducing time delay between multiple paths, we propose a spectrum-efficient algorithm based on traffic splitting and merging (Anycast_SA_TSM) transmission to avoid spectrum fragmentation and delay between multiple paths. In order to minimize the time delay between multiple paths, we design a modified scheme to select the multiple paths with minimal time delay to transmit the anycast. During the spectrum allocation phase, a new spectrum block allocation scheme, the exact fit or fragmentation minimal, is put forward. Moreover, when an appropriate size of spectrum block is found for the split anycast request, merging split sub-requests to a single path is activated for minimizing the additional guard bands and improving the spectrum efficiency. Comparing with other two anycast algorithms, simulation results show that the proposed algorithm can get minimal time delay between split multiple paths, the minimal bandwidth blocking probability and the highest spectrum utilization.     

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.     

Non-SPF routing algorithm based on ordered semi-group preference algebra

Layer 2 network technology is extending beyond its traditional local area implementation and finding wider acceptance in provider's metropolitan area networks and large-scale cloud data center networks. This is mainly due to its plug-and-play capability and native mobility support. Many efforts have been put to increase the bisection bandwidth in layer 2 network, which has been constrained by the spanning tree protocol (STP) that layer 2 network uses for preventing looping. The recent trend is to incorporate layer 3's routing approach into layer 2 network so that multiple paths can be used for forwarding traffic between any source-destination (S-D) node pair. Equal cost multipath (ECMP) is one such example. However, ECMP may still be limited in generating multiple paths due to its shortest path (lowest cost) requirement. In this paper, we consider a non-shortest-path routing approach, called equal preference multipath (EPMP) based on ordered semi group theory, which can generate more paths than ECMP. In EPMP routing, all the paths with different traditionally-defined costs, such as hops, bandwidth, etc., can be determined equally now and thus they become equal candidate paths. By the comparative tests with ECMP, EPMP routing not only generates more paths, provides 15% higher bisection bandwidth, but also identifies bottleneck links in a hierarchical network when different traffic patterns are applied. EPMP is more flexible in controlling the number and length of multipath generation. Simulation results indicate the effectiveness of the proposed algorithm. It is a good reference for non-blocking running of big datacenter networks.     

On the fairness of return channel capacity allocation in DVB‐RCS‐based satellite networks

Broadband satellite access (BSA) systems can form an alternative path for the provision of Internet access in areas with poor network infrastructure. The DVB‐RCS standard introduced the specifications of an interaction channel for two‐way BSA networks. In this study, a new dynamic scheduling strategy for the interaction channel of GEO satellite networks is proposed, evaluated and compared with a typical Round Robin scheme. The main idea of the proposed strategy is to change, prior to each allocation, the sequence according to which bandwidth is assigned to the satellite terminals. The new sequence is fully specified by a set of fairness indices, each one related to a unique terminal and updated after each allocation. Along with the examined scheduling strategies, two capacity request calculation techniques found in the literature are also evaluated and compared through a series of simulations. Copyright © 2010 John Wiley & Sons, Ltd.     

DQDB networks with and without bandwidth balancing

It is explained why long distributed queue dual bus (DQDB) networks without bandwidth balancing can have fairness problems when several nodes are performing large file transfers. The problems arise because the network control information is subject to propagation delays that are much longer than the transmission time of a data segment. Bandwidth balancing is then presented as a simple solution. By constraining each node to take only a certain fraction of the transmission opportunities offered to it by the basic DQDB protocol, bandwidth balancing gradually achieves a fair allocation of bandwidth among simultaneous file transfers. Two ways to extend this procedure effectively to multipriority traffic are proposed     

Achieving fast and bandwidth-efficient shared-path protection

Dynamic provisioning of restorable bandwidth guaranteed paths is a challenge in the design of broad-band transport networks, especially next-generation optical networks. A common approach is called (failure-independent) path protection, whereby for every mission-critical active path to be established, a link (or node) disjoint backup path (BP) is also established. To optimize network resource utilization, shared path protection should be adopted, which often allows a new BP to share the bandwidth allocated to some existing BPs. However, it usually leads the backup paths to use too many links, with zero cost in term of additional backup bandwidth, along its route. It will violate the restoration time guarantee. In this paper, we propose novel integer linear programming (ILP) formulations by introducing two parameters (/spl epsi/ and /spl mu/) in both the sharing with complete information (SCI) scheme and the distributed partial information management (DPIM) scheme. Our results show that the proposed ILP formulations can not only improve the network resource utilization effectively, but also keep the BPs as short as possible.