Energy-efficient and low blocking probability differentiated quality of protection scheme for dynamic elastic optical networks

2013 ◽  
Author(s):  
Jorge Lopez Vizcaino ◽  
Paola Soto ◽  
Yabin Ye ◽  
Felipe Jimenez ◽  
Peter M. Krummrich
Keyword(s):  
Optical Networks ◽  
Energy Efficient ◽  
Blocking Probability ◽  
Protection Scheme ◽  
Quality Of Protection

scholarly journals Preface to the December 2015 issue

2015 ◽  
Author(s):  
Héctor Cancela
Keyword(s):  
Distributed Computing ◽  
Computer Science ◽  
Optical Networks ◽  
Mobile Devices ◽  
Wdm Networks ◽  
Domain Name ◽  
Historical Climate ◽  
Quality Of Protection ◽  
Security Models

We are glad to present the last issue of 2015, completing Volume 18 of the CLEI Electronic Journal. This issue is comprised by the following regular papers.The first paper, “Quality of Protection on WDM networks: A Recovery Probability based approach”, by M. D. Rodas-Brítez and D. P. Pinto-Roa, features a proposal of a new quality of protection (QoP) paradigm for Wavelength Division Multiplexing optical networks. The new approach is flexible, allowing the network administrator to define and select a set of protection levels, based on recovery probabilities which measure the degree of conflict among primary lightpaths sharing backup lightpaths. To show the interest of the approach, a Genetic Algorithm is used to design a routing strategy by multi-objectiveoptimization, minimizing the number of blocked requests, the number of services without protection, the total differences between the requested QoP and the assigned QoP, and the network cost.The second paper, “Towards Scalability for Federated Identity Systems for Cloud-Based Environments”, by A.A. Pereira, J. B. M. Sobral and C. M. Westphall, addresses scalability issues in identity management for cloud computing environments. The authors propose an adapted sticky-session mechanism, as an alternative approach to the more common distributed memory approach, and discuss the implications in therms of computational resources, throughput and overall efficiency. The following work, “Formal Analysis of Security Models for Mobile Devices, Virtualization Platforms, and Domain Name Systems”, by G. Betarte and C. Luna,tackles security models for security-critical applications in three areas: mobile devices, virtualization platforms, and domain name systems. The authors develop formalizations using the Calculus of Inductive Constructions, to study different usual variants of security models in these platforms and their properties.The last paper of this issue is “Digi-Clima Grid: image processing and distributed computing for recovering historical climate data”, by authors S. Nesmachnow, G. Usera and F. Brasileiro. This paper reports an experience of implementing semi-automatic techniques for digitalizing and recovering historical climate records applying parallel computing techniques over distributed computing infrastructures, which was applied to Uruguayan historical climate data.As we complete now the eighteenth year of continued existence of CLEIej, we thank the regional community for its continued support, and we encourage researchers working in computer science and its applications to consider submitting their work to CLEIej, as the the leading electronic, open access journal in Computer Science in Latin America.

scholarly journals Spectrum Availability Aware Routing and Resource Allocation for Point-to-Multipoint Services in Mixed-Grid Optical Networks

2021 ◽  
Author(s):  
Feng Wang ◽  
Qingcheng Zhu ◽  
Xiaolong Li ◽  
Jiaming Gu ◽  
Zhenhua Yan ◽  
...  
Keyword(s):  
Resource Allocation ◽  
Quality Of Service ◽  
Optical Networks ◽  
Evaluation Method ◽  
Blocking Probability ◽  
Channel Spacing ◽  
Bandwidth Request ◽  
Fixed Grid ◽  
Simulation Results

Mixed-grid optical networks are in a migration state where fixed-grid and flex-grid optical networks coexist. To carry point-to-multipoint (P2MP) services in mixed-grid optical networks, routing and resource allocation (RRA) problems need to be solved. Once the RRA fails, services will be blocked and then influence quality of service. The minimized spectrum for satisfying the bandwidth request of services is called as a frequency block (FB). For a service, the total number of available FBs embodies the spectrum availability on a link. Because the fixed-grid and flex-grid links have different channel spacing, spectrum availability on fixed-grid and flex-grid links needs different evaluation method. We propose a RRA algorithm in mixed-grid optical networks for P2MP services by being aware of spectrum availability. The spectrum availability is evaluated according to fixed-grid and flex-grid constraints. Our proposed algorithm achieves the lower blocking probability (BP) than that of benchmark RRA algorithms according to simulation results.

New Dimensions for Survivable Service Provisioning in Optical Backbone and Access Networks

2011 ◽  
pp. 227-252
Author(s):  
Paolo Monti ◽  
Lena Wosinska ◽  
Cicek Cavdar ◽  
Andrea Fumagalli ◽  
Jiajia Chen
Keyword(s):  
Optical Networks ◽  
Service Providers ◽  
Blocking Probability ◽  
Access Networks ◽  
Service Provisioning ◽  
Protection Scheme ◽  
Path Protection ◽  
Trade Offs ◽  
Set Up ◽  
Shared Path Protection

<div>Originally, networks were engineered to provide only one type of service, i.e. either voice or data, so only one level of resiliency was requested. This trend has changed, and today’s approach in service provisioning is quite different. A Service Level Agreement (SLA) stipulated between users and service providers (or network operators) regulates a series of specific requirements, e.g., connection set-up times and connection availability that has to be met in order to avoid monetary fines. In recent years this has caused a paradigm shift on how to provision these services. From a “one-solution-fits-all” scenario, we witness now a more diversified set of approaches where trade-offs among different network parameters (e.g., level of protection vs. cost and/or level of protection vs. blocking probability) play an important role.</div><div>This chapter aims at presenting a series of network resilient methods that are specifically tailored for a dynamic provisioning with such differentiated requirements. Both optical backbone and access networks are considered. In the chapter a number of provisioning scenarios - each one focusing on a specific Quality of Service (QoS) parameter - are considered. First the effect of delay tolerance, defined as the amount of time a connection request can wait before being set up, on blocking probability is investigated when Shared Path Protection is required. Then the problem of how to assign “just-enough” resources to meet each connection availability requirement is described, and a possible solution via a Shared Path Protection Scheme with Differentiated Reliability is presented. Finally a possible trade off between deployment cost and level of reliability performance in Passive Optical Networks (PONs) is investigated.&nbsp;The presented results highlight the importance of carefully considering each connection’s QoS parameters while devising a resilient provisioning strategy. By doing so the benefits in terms of cost saving and blocking probability improvement becomes relevant, allowing network operators and service providers to maintain satisfied customers at reasonable capital and operational expenditure levels</div>

scholarly journals Differentiated quality-of-protection provisioning with probabilistic-shared risk link group in survivable flexi-grid optical networks

2014 ◽  
Vol 53 (6) ◽  
pp. 066111
Author(s):  
Yongli Zhao ◽  
Jinyan Liu ◽  
Jie Zhang ◽  
Bowen Chen ◽  
Chen Ma ◽  
...  
Keyword(s):  
Optical Networks ◽  
Link Group ◽  
Quality Of Protection ◽  
Shared Risk

A Dynamic Resilience Approach for WDM Optical Networks

2017 ◽  
Vol 38 (4) ◽  
Author(s):  
Amit Kumar Garg
Keyword(s):  
Optical Networks ◽  
Blocking Probability ◽  
Quality Of Services ◽  
Optical Fibres ◽  
Wdm Optical Networks ◽  
Network Resource ◽  
Communication Services ◽  
Single Link ◽  
Simulation Results

AbstractOptical fibres have been developed as a transmission medium to carry traffic in order to provide various services in telecommunications platform. Failure of this fibre caused loss of data which can interrupt communication services. This paper has been focused only on survivable schemes in order to guarantee both protection and restoration in WDM optical networks. In this paper, a dynamic resilience approach has been proposed whose objective is to route the flows in a way which minimizes the total amount of bandwidth used for working and protection paths. In the proposed approach, path-based protection is utilized because it yields lower overhead and is also suitable for global optimization where, in case of a single link failure, all the flows utilizing the failed link are re-routed to a pre-computed set of paths. The simulation results demonstrate that proposed approach is much more efficient as it provides better quality of services (QoS) in terms of network resource utilization, blocking probability etc. as compared to conventional protection and restoration schemes. The proposed approach seems to offer an attractive combination of features, with both ring like speed and mesh-like efficiency.

scholarly journals Spectrum Fragmentation-Aware Strategies for Deadline-Driven Dynamic Multicast Scheduling Problem in EON

2017 ◽  
Vol 22 (1) ◽  
pp. 5-12
Author(s):  
Marcin Markowski
Keyword(s):  
Optical Networks ◽  
Multicast Routing ◽  
Blocking Probability ◽  
Spectrum Utilization ◽  
Elastic Network ◽  
The Third ◽  
Dynamic Multicast ◽  
Routing And Spectrum Assignment ◽  
Multicast Scheduling

Abstract Since the spectrum fragmentation is an important issue for the dynamic demands allocation in the Elastic Optical Networks, minimization of it improves the spectrum utilization and decreases the blocking probability. In the paper, the dynamic deadline-driven multicast routing and spectrum assignment problem in the elastic network is considered. Three spectrum fragmentation-aware algorithms were proposed and evaluated. Two of proposed algorithms use the well-known fragmentation metrics, while the third one utilizes a new original fragmentation increase estimator. The results of the experiments validating the quality of proposed methods and algorithms were reported and analyzed.

Energy-Efficient Routing and Spectrum Assignment Algorithm with Physical-Layer Impairments Constraint in Flexible Optical Networks

2017 ◽  
Vol 38 (4) ◽  
Author(s):  
Jijun Zhao ◽  
Nawa Zhang ◽  
Danping Ren ◽  
Jinhua Hu
Keyword(s):  
Energy Efficiency ◽  
Optical Networks ◽  
Energy Efficient ◽  
Blocking Probability ◽  
Physical Layer ◽  
Energy Efficient Routing ◽  
Spectrum Assignment ◽  
Physical Layer Impairments ◽  
Routing And Spectrum Assignment ◽  
The Impact

AbstractThe recently proposed flexible optical network can provide more efficient accommodation of multiple data rates than the current wavelength-routed optical networks. Meanwhile, the energy efficiency has also been a hot topic because of the serious energy consumption problem. In this paper, the energy efficiency problem of flexible optical networks with physical-layer impairments constraint is studied. We propose a combined impairment-aware and energy-efficient routing and spectrum assignment (RSA) algorithm based on the link availability, in which the impact of power consumption minimization on signal quality is considered. By applying the proposed algorithm, the connection requests are established on a subset of network topology, reducing the number of transitions from sleep to active state. The simulation results demonstrate that our proposed algorithm can improve the energy efficiency and spectrum resources utilization with the acceptable blocking probability and average delay.

Reduction of Blocking Probability in Generalized Multi-Protocol Label Switched Optical Networks

2019 ◽  
Vol 0 (0) ◽  
Author(s):  
Monika Dhawan ◽  
Simranjit Singh ◽  
Amit Wason
Keyword(s):  
Mathematical Model ◽  
Quality Of Service ◽  
Optical Networks ◽  
Blocking Probability ◽  
Optical Network ◽  
Traffic Intensity ◽  
Call Blocking ◽  
Proposed Model ◽  
Mode Of Operation

AbstractThe blocking probability is studied for improving the quality of service of the network. The call blocking model for mode of operation to determine the types of applications suitable for Generalized Multi-Protocol Label Switched (GMPLS) networks is proposed. The performance of optical network depends upon various parameters such as number of channels, number of sources, traffic intensity which directly affect the blocking probability of the network. A mathematical model of an optical network for blocking probability of cleared calls and holding calls is developed. In the proposed model, blocking probability of the network gets reduced with a large number of servers. The proposed models decrease the blocking probability of the network to a level of 10–40. In addition, the blocking performance for held calls is also analyzed to compare the amount of traffic intensity that can be handled and completed properly with that of the cleared calls probability. The blocking probability is less for cleared calls than that for held calls as more traffic intensity can be handled in case of cleared calls but the chances for call completion increases in case of held calls.

Sign in / Sign up

Export Citation Format

Share Document