Assessment of novel regenerator assignment strategies in dynamic translucent elastic optical networks

Photonic Network Communications - The problem of regenerator assignment (RA) in translucent optical networks consists in segmenting a lightpath into several transparent segments, each of...     

Novel strategies for sparse regenerator placement in translucent optical networks

In this paper, we propose two strategies for sparse regenerator placement (RP) in translucent optical networks, named most used regenerator placement (MU-RP), and most simultaneous used regenerator placement (MSU-RP). Our proposals are compared to well known RP algorithms presented in literature for two different network topologies for different network loads, distribution of load along the networks and number of translucent nodes. MSU-RP presented remarkable results and outperformed all previous approaches in all cases, while MSU-RP obtained a slightly superior or similar performance when compared to previous approaches presented in the literature.     

Optimal resource allocation in multiservice CDMA networks

This paper addresses the problem of dynamic resource allocation in a multiservice direct-sequence code-division multiple-access (DS-CDMA) wireless network supporting real-time (RT) and nonreal-time (NRT) communication services. For RT users, a simple transmission power allocation strategy is assumed that maximizes the amount of capacity available to NRT users without violating quality of service requirements of RT users. For NRT users, a joint transmission power and spreading gain (transmission rate) allocation strategy, obtained via the solution of a constrained optimization problem, is provided. The solution maximizes the aggregate NRT throughput, subject to peak transmission power constraints and the capacity constraint imposed by RT users. The optimization problem is solved in a closed form, and the resulting resource allocation strategy is simple to implement as a hybrid CDMA/time-division multiple-access strategy. Numerical results are presented showing that the optimal resource allocation strategy can offer substantial performance gains over other conventional resource allocation strategies for DS-CDMA networks.     

Optimal resource allocation for wireless video over CDMA networks

We present a multiple-channel video transmission scheme in wireless CDMA networks over multipath fading channels. We map an embedded video bitstream, which is encoded into multiple independently decodable layers by 3D-ESCOT video coding technique, to multiple CDMA channels. One video source layer is transmitted over one CDMA channel. Each video source layer is protected by a product channel code structure. A product channel code is obtained by the combination of a row code based on rate compatible punctured convolutional code (RCPC) with cyclic redundancy check (CRC) error detection and a source-channel column code, i.e., systematic rate-compatible Reed-Solomon (RS) style erasure code. For a given budget on the available bandwidth and total transmit power, the transmitter determines the optimal power allocations and the optimal transmission rates among multiple CDMA channels, as well as the optimal product channel code rate allocation, i.e., the optimal unequal Reed-Solomon code source/parity rate allocations and the optimal RCPC rate protection for each channel. In formulating such an optimization problem, we make use of results on the large-system CDMA performance for various multiuser receivers in multipath fading channels. The channel is modeled as the concatenation of wireless BER channel and a wireline packet erasure channel with a fixed packet loss probability. By solving the optimization problem, we obtain the optimal power level allocation and the optimal transmission rate allocation over multiple CDMA channels. For each CDMA channel, we also employ a fast joint source-channel coding algorithm to obtain the optimal product channel code structure. Simulation results show that the proposed framework allows the video quality to degrade gracefully as the fading worsens or the bandwidth decreases, and it offers improved video quality at the receiver.     

Optimal resource allocation solutions for heterogeneous cognitive radio networks

Cognitive radio networks (CRN) are currently gaining immense recognition as the most-likely next-generation wireless communication paradigm, because of their enticing promise of mitigating the spectrum scarcity and/or underutilisation challenge. Indisputably, for this promise to ever materialise, CRN must of necessity devise appropriate mechanisms to judiciously allocate their rather scarce or limited resources (spectrum and others) among their numerous users. ‘Resource allocation (RA) in CRN', which essentially describes mechanisms that can effectively and optimally carry out such allocation, so as to achieve the utmost for the network, has therefore recently become an important research focus. However, in most research works on RA in CRN, a highly significant factor that describes a more realistic and practical consideration of CRN has been ignored (or only partially explored), i.e., the aspect of the heterogeneity of CRN. To address this important aspect, in this paper, RA models that incorporate the most essential concepts of heterogeneity, as applicable to CRN, are developed and the imports of such inclusion in the overall networking are investigated. Furthermore, to fully explore the relevance and implications of the various heterogeneous classifications to the RA formulations, weights are attached to the different classes and their effects on the network performance are studied. In solving the developed complex RA problems for heterogeneous CRN, a solution approach that examines and exploits the structure of the problem in achieving a less-complex reformulation, is extensively employed. This approach, as the results presented show, makes it possible to obtain optimal solutions to the rather difficult RA problems of heterogeneous CRN.     

Optimized BS assignment and resource allocation in cooperative OFDM networks

Cooperative transmission (CT) and orthogonal frequency division multiple (OFDM) are promising technologies for extending coverage and increasing throughput in broadband wireless access (BWA) networks. Therefore, we propose a novel BWA network architecture, that can set up inter-cell collaboration using physical layer cooperative transmissions among distributed wired access networks with a powerful coordination capability at the central office. However, conventional base station (BS) assignment and resource allocation schemes cannot be used directly because a user can be serviced by more than one BS with cooperative transmission technology. This study proposes a novel framework of BS assignment and resource allocation in a cooperative OFDM network. We provide three approaches of resource allocation for minimizing bandwidth usage, minimizing transmission power consumption, and balancing resource costs respectively. An optimized resource allocation scheme can be implemented by flexibly choosing one of these approaches based on network load. The simulation results show the efficiency of the proposed mathematical formulations and linearization approach of our scheme. The performance benefit of CT technology on the bandwidth saving is demonstrated by comparing the new BS assignment and resource allocation scheme with conventional non-cooperative transmission.     

Routing and wavelength assignment strategies in optical networks

We consider the routing and wavelength assignment (RWA) problem on wavelength division multiplexing (WDM) networks without wavelength conversion. When the physical network and required connections are given, RWA is the problem to select a suitable path and wavelength among the many possible choices for each connection such that no two paths using the same wavelength pass through the same link. In WDM optical networks, there is need to maximize the number of connections established and to minimize the blocking probability using limited resources. This paper presents efficient RWA strategies, which minimizes the blocking probability. Simulation results show that the performance of the proposed strategies is much better than the existing strategy.     

Joint resource allocation and base-station assignment for the downlink in CDMA networks

In this paper, we jointly consider the resource allocation and base-station assignment problems for the downlink in CDMA networks that could carry heterogeneous data services. We first study a joint power and rate allocation problem that attempts to maximize the expected throughput of the system. This problem is inherently difficult because it is in fact a nonconvex optimization problem. To solve this problem, we develop a distributed algorithm based on dynamic pricing. This algorithm provides a power and rate allocation that is asymptotically optimal in the number of mobiles. We also study the effect of various factors on the development of efficient resource allocation strategies. Finally, using the outcome of the power and rate allocation algorithm, we develop a pricing-based base-station assignment algorithm that results in an overall joint resource allocation and base-station assignment. In this algorithm, a base-station is assigned to each mobile taking into account the congestion level of the base-station as well as the transmission environment of the mobile.     

Resource allocation strategies for survivability in WDM optical networks

WDM optical networks are high speed networks and provide enormous capacity. Survivability is very important issue in these networks. Survivability requires resources for handling the failures. So, efficient resource allocation strategy is required for survivability. In this paper, we have presented two resource allocation strategies for survivability. These strategies reserve the resources for the primary lightpaths and backup lightpaths. Then extensive simulations are done on different networks to evaluate the performance in terms of blocking probability. The results show that the second strategy performs better than first strategy.     

Underwater optical wireless sensor networks using resource allocation

Telecommunication Systems - Optical wireless communications is an energy efficient and cost-effective solution for high speed and high secure wireless connections. In this paper, we propose an...     

GMPLS-controlled dynamic translucent optical networks

The evolution of optical technologies has paved the way to the migration from opaque optical networks (i.e., networks in which the optical signal is electronically regenerated at each node) to transparent (i.e., all-optical) networks. Translucent optical networks (i.e., optical networks with sparse opto-electronic regeneration) enable the exploitation of the benefits of both opaque and transparent networks while providing a suitable solution for dynamic connections. Translucent optical networks with dynamic connections can be controlled by the GMPLS protocol suite. This article discusses the enhancements that the GMPLS suite requires for the control of dynamic translucent optical networks with quality of transmission guarantees. Such enhancements concern QoT-awareness and regenerator-awareness and can be achieved by collecting and disseminating the information on QoT and regenerator availability, respectively, and by efficiently leveraging such information for traffic engineering purposes. More specifically, the article proposes two distributed approaches, based on the routing protocol and the signaling protocol, for disseminating regenerator information in the GMPLS control plane. Moreover, three strategies are introduced to efficiently and dynamically designate the regeneration node(s) along the connection route. Routing and signaling approaches are compared in terms of blocking probability, setup time, and control plane load during provisioning and restoration.     

Flexible resource allocation strategies for class-based QoS provisioning in mobile networks

Flexible resource-allocation (FRA) strategies have been proposed in the literature to mitigate the high blocking rate caused in high-speed mobile communication networks when resource aggregation is used to increase the data rate. In this paper, new FRA strategies that cope with scenarios with multiple service types and multiple priorities are proposed. These are called the FRA strategy with differentiated priorities and quality of service (FRAQoS) and the FRA strategy with prioritized levels (FRASPL). The main distinguishing feature of these strategies is their capacity to prioritize some service types over others. FRAQoS prioritizes the quality of service (QoS) of particular service types over others by introducing the concepts of prioritized call degradation and compensation. However, FRAQoS provides a limited ability to prioritize particular service types over the rest because any incoming call, irrespective of its service type and priority, may trigger resource reallocations to service it. The FRASPL overcomes this limitation by introducing a call-admission mechanism that, when necessary, rejects calls originated by low-priority service types. This enhances the protection to high-priority service types. By prioritizing some services over the others, FRASPL can trade off capacity against QoS. FRAQoS represents particular limiting cases of FRASPL. A mathematical model is developed to investigate the performance of FRAQoS and FRASPL. Then, they are compared with other FRA strategies in a scenario with multiple differentiated service types. Results show that the proposed strategies effectively prioritize service types, providing them with better QoS. This makes FRAQoS and FRASPL specially suitable for class-based QoS provisioning in mobile networks.     

Prioritized resource allocation for stressed networks

Overloads that occur during times of network stress result in blocked access to all users, independent of importance. These overloads can occur because of degraded resource availability or abnormally high demand. Public broadband networks must dynamically recognize some multimedia connections as having greater importance than others and allocate resources accordingly. A new approach to connection admission control is proposed that uses an upper limit policy to optimize the admission of connections based on the weighted sum of blocking across traffic classes. This results in a simple algorithm suitable for multimedia and packet networks. This work is also the first to demonstrate that the use of an upper limit policy is superior to traditional approaches of adding extra capacity or partitioning capacity, both in terms of the amount of resources required and sensitivity to load variations. An upper limit policy can also be deployed much faster when a large overload occurs from a disaster event     

Study of optical control plane for translucent WDM networks

In this article, we concentrate on the study of control plane and management approaches for translucent WDM networks. A hybrid optical control plane (OCP) is proposed, which needs the extensions of both routing and signaling protocol, to combine the best features of routing-based information updating and signaling-based data collection and path evaluation. Simulations are conducted to compare hybrid OCP with two existing control architectures: signaling-based OCP and routing-based OCP. Numerical results show that hybrid OCP exhibits a lower blocking probability than the other approaches, and also minimizes the stability and scalability problems under various traffic conditions.     

A general resource assignment scheme for successful transmission in optical burst switched networks

This work proposes a general resource assignment strategy for Optical Burst Switched networks to avoid burst losses. Given a set of communications and the associated paths defined by a routing, we propose a wavelength assignment scheme in which contentions can always be solved or avoided by delaying properly the transmission of some (perhaps all) data bursts. Two mechanisms are defined for this purpose. One is based on adding a suitable extra-offset time to each burst transmission (static approach). The other consists of adding the additional delay, only when contention occurs in an intermediate node of the network, by using a single fiber delay line (dynamic approach). In both cases, the additional delay is independent of the link lengths. Moreover, we resort to Linear Programming (LP) methods to compute the number of wavelengths needed to serve a given traffic matrix. Some examples show that the proposed method gives optimal or near-optimal solutions. This strategy works in either synchronous or asynchronous transmission environments. Moreover, the burst arriving and length distributions can be of general type.     

Dynamic resource allocation with service guarantees over large scale optical networks

The lack of effective contention resolution mechanisms in the optical domain presents dynamic optical switching architectures with a hard dilemma between high loss (when adopting one-way reservations) and high delay (when using two-way reservations). In this work we evaluate an alternative hierarchical network architecture, which achieves a satisfactory compromise by partitioning the network into a number of geographically limited domains operating in slot and frame synchronous mode where two-way reservations are effective.     

Robust resource allocation for NOMA-assisted heterogeneous networks

As a promising technology to improve spectrum efficiency and transmission coverage, Heterogeneous Network (HetNet) has attracted the attention of many scholars in recent years. Additionally, with the introduction of the Non-Orthogonal Multiple Access (NOMA) technology, the NOMA-assisted HetNet cannot only improve the system capacity but also allow more users to utilize the same frequency band resource, which makes the NOMA-assisted HetNet a hot topic. However, traditional resource allocation schemes assume that base stations can exactly estimate direct link gains and cross-tier link gains, which is impractical for practical HetNets due to the impact of channel delays and random perturbation. To further improve energy utilization and system robustness, in this paper, we investigate a robust resource allocation problem to maximize the total Energy Efficiency (EE) of Small-Cell Users (SCUs) in NOMA-assisted HetNets under imperfect channel state information. By considering bounded channel uncertainties, the robust resource optimization problem is formulated as a mixed-integer and nonlinear programming problem under the constraints of the cross-tier interference power of macrocell users, the maximum transmit power of small base station, the Resource Block (RB) assignment, and the quality of service requirement of each SCU. The original problem is converted into an equivalent convex optimization problem by using Dinkelbach's method and the successive convex approximation method. A robust Dinkelbach-based iteration algorithm is designed by jointly optimizing the transmit power and the RB allocation. Simulation results verify that the proposed algorithm has better EE and robustness than the existing algorithms.     

Distributed Dijkstra sparse placement routing algorithm for translucent optical networks

In this paper we study translucent optical networks as an alternative to fully transparent and fully opaque optical networks. In the former networks, a technique called sparse placement is used to overcome the lightpath blocking caused by the signal quality degradation, using much less regenerators, which must strategically be placed, in contrast to a fully opaque network. In this paper we propose a sparse placement algorithm based on two requirements. The first one is signal regeneration necessary to re-amplify, reshape, and retime the optical signals after some predefined transparent distance in order to successfully receive the signals at the destination node. The other is load balance of the traffic in the network aimed at efficient usage of the network capacity resources. We apply a distributed Dijkstra routing algorithm which dynamically changes weights of links during the process of locating regeneration capable nodes. We compare the performance of the proposed algorithm with commonly used sparse placement algorithms through simulation experiments. The benefits are such that load balancing of the network traffic is fully utilized, and with technological development it will be sufficient to equip up to 30% of nodes in the network with electronic regenerations in order to have the same performance as in an opaque network.

Optimal resource allocation and adaptive call admission control for voice/data integrated cellular networks

Resource allocation and call admission control (CAC) are key management functions in future cellular networks, in order to provide multimedia applications to mobiles users with quality of service (QoS) guarantees and efficient resource utilization. In this paper, we propose and analyze a priority based resource sharing scheme for voice/data integrated cellular networks. The unique features of the proposed scheme are that 1) the maximum resource utilization can be achieved, since all the leftover capacity after serving the high priority voice traffic can be utilized by the data traffic; 2) a Markovian model for the proposed scheme is established, which takes account of the complex interaction of voice and data traffic sharing the total resources; 3) optimal CAC parameters for both voice and data calls are determined, from the perspective of minimizing resource requirement and maximizing new call admission rate, respectively; 4) load adaption and bandwidth allocation adjustment policies are proposed for adaptive CAC to cope with traffic load variations in a wireless mobile environment. Numerical results demonstrate that the proposed CAC scheme is able to simultaneously provide satisfactory QoS to both voice and data users and maintain a relatively high resource utilization in a dynamic traffic load environment. The recent measurement-based modeling shows that the Internet data file size follows a lognormal distribution, instead of the exponential distribution used in our analysis. We use computer simulations to demonstrate that the impact of the lognormal distribution can be compensated for by conservatively applying the Markovian analysis results.     

Optimal power allocation with AF and SDF strategies in dual-hop cooperative MIMO networks

Dual-hop cooperative Multiple-Input Multiple-Output (MIMO) network with multi-relay cooperative communication is introduced. Power allocation problem with Amplify-and-Forward (AF) and Selective Decode-and-Forward (SDF) strategies in multi-node scenario are formulated and solved respectively. Optimal power allocation schemes that maximize system capacity with AF strategy are presented. In addition, optimal power allocation methods that minimize asymptotic Symbol Error Rate (SER) with SDF cooperative protocol in multi-node scenario are also proposed. Furthermore, performance comparisons are provided in terms of system capacity and approximate SER. Numerical and simulation results confirm our theoretical analysis. It is revealed that, maximum system capacity could be obtained when powers are allocated optimally with AF protocol, while minimization of system’s SER could also be achieved with optimum power allocation in SDF strategy. In multi-node scenario, those optimal power allocation algorithms are superior to conventional equal power allocation schemes.