Saturation throughput analysis of multi‐rate IEEE 802.11 wireless networks

IEEE 802.11 protocol supports adaptive rate mechanism, which selects the transmission rate according to the condition of the wireless channel, to enhance the system performance. Thus, research of multi‐rate IEEE 802.11 medium access control (MAC) performance has become one of the hot research topics. In this paper, we study the performance of multi‐rate IEEE 802.11 MAC over a Gaussian channel. An accurate analytical model is presented to compute the system saturation throughput. We validate our model in both single‐rate and multi‐rate networks through various simulations. The results show that our model is accurate and channel error has a significant impact on system performance. In addition, our numerical results show that the performance of single‐rate IEEE 802.11 DCF with basic access method is better than that with RTS/CTS mechanism in a high‐rate and high‐load network and vice versa. In a multi‐rate network, the performance of IEEE 802.11 DCF with RTS/CTS mechanism is better than that with basic access method in a congested and error‐prone wireless environment. Copyright © 2008 John Wiley & Sons, Ltd.     

Link Capacity Sharing between Guaranteed- and Best Effort Services on an ATM Transmission Link under GoS Constraints

While link allocation policies in multi-rate circuit switched loss models have drawn much attention in recent years, it is still an open question how to share the link capacity between service classes in a fair manner. In particular, when an ATM link is offered calls from service classes with/without strict QoS guarantees one is interested in link capacity sharing policies that maximize throughput and keep the per-class blocking probabilities under some GoS constraints. In this paper we propose a model and associated computational technique for an ATM transmission link to which CBR/VBR and ABR classes offer calls. We also propose a simple link allocation rule which takes into account blocking probability constraints for the CBR/VBR calls and a throughput constraint for the ABR calls and attempts to minimize the blocking probability of ABR calls. Numerical examples demonstrate the effectiveness of the policy and of the applied computational technique.     

Analysis of multi‐user detection of multi‐rate transmissions in multi‐cellular CDMA

In this paper, we address the issue of multi‐user receiver design in realistic multi‐cellular and multi‐rate CDMA systems based on performance analysis. We consider the multi‐user detection (MUD) technique, denoted interference subspace rejection (ISR), because it offers a wide range of canonic suppression modes that range in performance and complexity between interference cancellers and linear receivers. To further broaden our study, we propose a modified ISR scheme called hybrid ISR to cope better with multi‐rate transmissions. The performance analysis, which is based on the Gaussian assumption (GA) and validated by simulations, takes into account data estimation errors, carrier frequency mismatch, imperfect power control, identification errors of time‐varying multipath Rayleigh channels and intercell interference. This analysis enables us to optimize the selection of the MUD mode for multi‐rate transmissions in different operating conditions. The effectiveness of interference cancellation is indeed investigated under different mobile speeds, numbers of receiving antennas, near‐far situations, channel estimation errors, and out‐cell to in‐cell interference ratios. This investigation suggests that the out‐of‐cell interference, the residual in‐cell interference, the noise enhancement as well as low mobility favor the simplest MUD modes as they offer the best performance/complexity tradeoffs. Copyright © 2008 John Wiley & Sons, Ltd.     

Bandwidth‐satisfied routing in multi‐rate MANETs by cross‐layer approach

Previous quality‐of‐service (QoS) routing protocols in mobile ad hoc networks (MANETs) determined bandwidth‐satisfied routes for QoS applications. Since the multi‐rate enhancements have been implemented in MANETs, QoS routing protocols should be adapted to exploit them fully. However, existing works suffer from one bandwidth‐violation problem, named the hidden route problem (HRP), which may arise when a new flow is permitted and only the bandwidth consumption of the hosts in the neighborhood of the route is computed. Without considering the bandwidth consumption to ongoing flows is the reason the problem is introduced. This work proposes a routing protocol that can avoid HRP for data rate selection and bandwidth‐satisfied route determination with an efficient cross‐layer design based on the integration of PHY and MAC layers into the network layer. To use bandwidth efficiently, we aim to select the combination of data rates and a route with minimal bandwidth consumption to the network, instead of the strategy adopted in the most previous works by selecting the combination with the shortest total transmission time. Using bandwidth efficiently can increase the number of flows supported by a network. Copyright 2010 John Wiley & Sons, Ltd.     

Flow‐level performance analysis of a multi‐rate system supporting stream and elastic services

We consider a multi‐rate system where stream and elastic flows receive service. Both the stream and the elastic classes are associated with peak rate limitation. In contrast to the constant bit rate stream flows, the elastic flows tolerate bandwidth compression while in service. Because of the occasional bandwidth compression, the holding time of elastic flows depends on their perceived throughput. Although this model is Markovian under quite non‐restrictive assumptions, the model's state space grows exponentially with the number of traffic classes. The model is not quasi‐reversible, and therefore, it cannot be evaluated by efficient recursive formulae. We propose a method whereby the original state space is mapped to a two‐dimensional one, independently of the number of the stream and the elastic traffic classes. The special structure of the two‐dimensional model allows us to develop an efficient method that approximates the average throughputs of elastic flows. The state space reduction together with the proposed approximation provides a powerful tool for the performance analysis of this model as it allows the approximation of the average throughputs of elastic flows reasonably accurately in large models as well. Copyright © 2012 John Wiley & Sons, Ltd.     

Goodput and throughput comparison of single‐hop and multi‐hop routing for IEEE 802.11 DCF‐based wireless networks under hidden terminal existence

We investigate how multi‐hop routing affects the goodput and throughput performances of IEEE 802.11 distributed coordination function‐based wireless networks compared with direct transmission (single hopping), when medium access control dynamics such as carrier sensing, collisions, retransmissions, and exponential backoff are taken into account under hidden terminal presence. We propose a semi‐Markov chain‐based goodput and throughput model for IEEE 802.11‐based wireless networks, which works accurately with both multi‐hopping and single hopping for different network topologies and over a large range of traffic loads. Results show that, under light traffic, there is little benefit of parallel transmissions and both single‐hop and multi‐hop routing achieve the same end‐to‐end goodput. Under moderate traffic, concurrent transmissions are favorable as multi‐hopping improves the goodput up to 730% with respect to single hopping for dense networks. At heavy traffic, multi‐hopping becomes unstable because of increased packet collisions and network congestion, and single‐hopping achieves higher network layer goodput compared with multi‐hop routing. As for the link layer throughput is concerned, multi‐hopping increases throughput 75 times for large networks, whereas single hopping may become advantageous for small networks. The results point out that the end‐to‐end goodput can be improved by adaptively switching between single hopping and multi‐hopping according to the traffic load and topology. Copyright © 2015 John Wiley & Sons, Ltd.     

On blocking time in multi‐class optical burst switching nodes

Recently, there has been an increasing research interest being directed to optical burst switching (OBS) networks because of its mature electronic processing capability and high‐capacity optical transport capability. The blocking time for an OBS node, representing the time duration in which a certain channel is occupied by some class of bursts, plays an important role in characterizing the performance of an OBS network. In this paper, we analyze this important metric for an OBS node with a horizonal and a single channel theoretically and numerically. On the basis of that, the burst arrivals are assumed to follow the Poisson process and the burst lengths have a phase‐type distribution, we are able to formulate a working mechanism of an OBS node into a multilayer stochastic fluid model. Using a level crossing arguments method, we are able to obtain the Laplace–Stieltjes transforms of the blocking time, from which n ‐order moments and the probability density functions of the blocking time can be further derived. We provide a numerical example to illustrate the theoretical analyses, and we further discuss the effects of the offset time and the arrival density on the blocking time through this numerical example. Copyright © 2016 John Wiley & Sons, Ltd.     

The intelligent multi‐domain service function chain deployment: Architecture,challenges and solutions

Network function virtualization (NFV) technology achieves flexible service deployment by replacing the middleboxes with virtual network functions (VNFs). In NFV, a set of VNFs are chained in a given order, called service function chain (SFC), and accordingly, data flow is steered to traverse all the VNFs in order to offer a service. With a large number of network devices and end users being connected into Internet, there is a growing demand for large‐scale multi‐domain networks to dynamically deploy the SFC across multiple network domains, in order to support efficient service provisioning. To this end, in this paper, we first investigate the state of the art of multi‐domain SFC deployment, and then propose an intelligent multi‐domain SFC deployment (IMSD) architecture by leveraging software‐defined networking (SDN), NFV, and deep learning technologies. Furthermore, we discuss the potential challenges to realize the IMSD and provide some promising solutions.     

Multi‐carrier platform for wireless communications. Part 1: High‐performance,high‐throughput TDMA and DS‐CDMA via multi‐carrier implementations

Multi‐carrier technologies in general, and OFDM and MC‐CDMA in particular, are quickly becoming an integral part of the wireless landscape. In this first of a two‐part survey, the authors present the innovative transmit/receive multi‐carrier implementation of TDMA and DS‐CDMA systems. Specifically, at the transmit side, the pulse shape (in TDMA) and the chip shape (in DS‐CDMA) corresponds to a linear combining of in‐phase harmonics (called a CI signal). At the receiver side, traditional time‐domain processing (equalization in TDMA and RAKE reception in DS‐CDMA) is replaced by innovative frequency based processing. Here, receivers decompose pulse (or chip) shapes into carrier subcomponents and recombine these in a manner achieving both high frequency diversity gain and low MAI. The resulting system outperforms traditional TDMA and DS‐CDMA systems by 10–14 dB at typical BERs, and, by application of pseudo‐orthogonal pulse shapes (chip shapes), is able to double system throughput while maintaining performance gains of up to 8 dB. Copyright © 2002 John Wiley & Sons, Ltd.     

Performance modeling and optimization of multiple‐objective cross‐layer design in multi‐flow ad‐hoc networks

In ad‐hoc wireless networks, to achieve good performance, multiple parameters need to be optimized jointly. However, existing literature lacks a design framework that investigates the synchronic impact of several parameters on overall system performance. Among several design parameters, energy conservation, end‐to‐end delay minimization, and improved throughput are considered most important for efficient operation of these networks. In this paper, we propose a novel scheme for multiple‐objective cross‐layer optimization capable of optimizing all these performance objectives simultaneously for reliable, energy‐efficient, and timely transmission of continuous media information across the network. The three global criteria considered for optimization are incorporated in a single programming problem via linear scalarization. Besides, we employ standard convex optimization method and Lagrangian technique to solve the proposed problem to seek optimality. Extensive simulation results are generated accounting for several topologies with multiple concurrent flows in the network. These results are used to validate the analytical results and demonstrate the efficiency of the proposed optimization model. Efficiency of the model is verified by finding the set of Pareto‐optimal solutions plotted in three‐dimensional objective space. These solution points constituting the Pareto front are used as the best possible balance points among maximum throughput, maximum residual energy, and least network delay. Finally, to emphasize the effectiveness and supremacy of our proposed multiple‐objective cross‐layer design scheme, we compare it with the conventional multiple‐objective genetic algorithm. Simulation results demonstrate that our method provides significant performance gain over the genetic algorithm approach in terms of the above specified three objectives.     

Bounded‐delay and loss‐free guarantees for real‐time video in integrated services packet networks

In this paper, we analyse upper bounds on the end‐to‐end delay and the required buffer size at the leaky bucket and packet switches within the network in the context of the deterministic bandwidth allocation method in integrated services packet networks. Based on that formulation, we then propose a CAC method suitable to ISPN to guarantee the bounded end‐to‐end delay and loss‐free packet transmissions. As an example application, the GOP–CBR MPEG‐2 is considered. In that case, we also show tighter bounds by slightly modifying the coding method of GOP–CBR MPEG‐2. Using the actual traced data of GOP–CBR MPEG‐2, we discuss the applicabilities of our analytical results and proposed CAC by comparing with simulation. Numerical results show that the loose upper bounds can also achieve more utilization even in the context of deterministic bandwidth allocation compared with the peak bandwidth allocation strategy. Copyright © 2000 John Wiley & Sons, Ltd.     

An energy‐efficient task‐scheduling algorithm based on a multi‐criteria decision‐making method in cloud computing

The massive growth of cloud computing has led to huge amounts of energy consumption and carbon emissions by a large number of servers. One of the major aspects of cloud computing is its scheduling of many task requests submitted by users. Minimizing energy consumption while ensuring the user's QoS preferences is very important to achieving profit maximization for the cloud service providers and ensuring the user's service level agreement (SLA). Therefore, in addition to implementing user's tasks, cloud data centers should meet the different criteria in applying the cloud resources by considering the multiple requirements of different users. Mapping of user requests to cloud resources for processing in a distributed environment is a well‐known NP‐hard problem. To resolve this problem, this paper proposes an energy‐efficient task‐scheduling algorithm based on best‐worst (BWM) and the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) methodology. The main objective of this paper is to determine which cloud scheduling solution is more important to select. First, a decision‐making group identify the evaluation criteria. After that, a BWM process is applied to assign the importance weights for each criterion, because the selected criteria have varied importance. Then, TOPSIS uses these weighted criteria as inputs to evaluate and measure the performance of each alternative. The performance of the proposed and existing algorithms is evaluated using several benchmarks in the CloudSim toolkit and statistical testing through ANOVA, where the evaluation metrics include the makespan, energy consumption, and resource utilization.     

Rate adaptive resource allocation in orthogonal frequency division multiple access system using multi‐objective immune algorithm

Rate adaptive downlink resource allocation in orthogonal frequency division multiple access system is a constraint optimization problem, which is to maximize the minimum data rate of the user subject to constraint that total power cannot exceed a given value. How to handle the constraint is a key issue for constrained optimization problem. Different with the available schemes on constraint handling, the proposed algorithm converts the constraint into an objective. Then, the resource allocation is combined into a multi‐objective optimization problem. An improved multi‐objective optimization algorithm based on artificial immune system is proposed to solve it. The simulation results show that, compared with previous schemes, the proposed algorithm performs remarkable improvement in sum capacity. Copyright © 2013 John Wiley & Sons, Ltd.     

E‐CLEMA: A cross‐layer design for improved quality of service in mobile WiMAX networks

In this paper, an efficient cross‐layer design that performs joint adaptation of the physical (PHY) and application layers of a mobile WiMAX network is proposed. The design takes into account channel state and performance information from the PHY and medium access control (MAC) layers, respectively. It uses a decision algorithm to evaluate this information, specify unfavorable conditions regarding low channel quality and increased congestion, and take measures by coordinating modulation order, transmission power, and media encoding rate, toward improved overall quality of service (QoS) offered to the user. Extensive simulation results show that the proposed design achieves considerably reduced packet loss and power consumption, combined with increased throughput as compared to a typical mobile WiMAX system. Copyright © 2008 John Wiley & Sons, Ltd.     

Effects of ultra‐high flux and intensity distribution in multi‐junction solar cells

We report results of high‐flux experiments on tandem solar cells, with a real‐sun probe predicated on mini‐dish fiber‐optic concentrators. Experimental results and their interpretation focus on: (a) a striking insensitivity of cell efficiency to flux map; (b) the predictability of the flux values at which cell efficiency peaks; and (c) performance of the same cell architecture at markedly smaller cell area. Copyright © 2006 John Wiley & Sons, Ltd.     

Power allocation and call admission control in multi‐class traffic DS‐CDMA systems with imperfect power control

We deal with power allocation (PA) and call admission control (CAC) under imperfect power control (IPC) in the reverse link of direct sequence‐code division multiple access systems for supporting multi‐class traffic. First, we briefly review the optimum PA scheme under perfect power control (PPC) and the CAC scheme subject to an outage constraint on the total composite received power. Then, we analyze the outage degradation due to the power control error when the optimum reference power levels under PPC are used. In order to mitigate the outage degradation, we would modify the reference power levels by incorporating a call dropping strategy and an outage‐lowering strategy into the optimum PA scheme under PPC. Also, we derive a constraint inequality to determine the reverse link capacity under IPC. Finally, through numerical analyses, we compute the modified reference power levels under IPC and evaluate the reverse link capacity under IPC. Copyright © 2006 John Wiley & Sons, Ltd.     

Household energy use patterns and social organisation for optimal energy management in a multi‐user solar energy system

Multi‐user systems (MUS) for electrification of rural villages have specific advantages compared with individual systems (SHS). However, as MUS serve multiple consumers, shared energy use presents a challenging problem to the communities. Despite the increased performance of MUS over SHS, they still produce a limited amount of available energy, and users cannot consume as much electricity as they wish without considering the needs of the other users. This means that energy distribution among village residents has to be organised and energy consumption has to be controlled. There are different ways to achieve energy distribution. One possibility is to leave it to the users themselves to organise rational energy use according to their needs and daily routines. For the development of a self‐managed scheme, knowledge is required not only of the users' total energy consumption, but also of their individual energy use patterns. With knowledge of the community's energy consumption habits, rules for adequate energy use can be developed more accurately. The present study describes community energy management in a Cuban village using a central photovoltaic installation. Applying different methods, data were collected in order to identify individual energy use patterns and to investigate how villagers distribute energy and what rules of use are in effect. We wanted to find out whether their energy management leads to well‐adapted energy use patterns and reasonable system performance. The results show that the village residents have developed rules and agreements for coordination of their energy use that have led to good adaptation to the dynamics of energy production. Copyright © 2006 John Wiley & Sons, Ltd.     

Towards understanding consumption in multi‐user solar energy systems: the cases of villages in Argentina and Cuba

Research on the electrification of remote villages by means of decentralized renewable energy systems increasingly requires consideration of the characteristics of the user communities. Particularly for communities with multi‐user systems (MUS), in order to achieve optimal design and sizing of the system and efficient energy distribution among users, it is important to consider the social characteristics of the community in addition to technical and economic aspects. The solar energy supply is always limited, and distribution of the energy among the users is mainly a matter of coordinating who can use how much at what time, which is influenced by various factors. What we need first of all is knowledge of the actual power needs of each household over a period of time. With the aim of determining typical patterns of energy consumption in households with similar characteristics, the present preliminary research study uncovers the factors that determine energy consumption in five solar power villages in Cuba and Argentina. Correlation and regression analysis of data from surveys and energy consumption measurements showed that type and number of electrical appliances are the most important, but not sufficient, factors for explaining differences in household energy consumption. Demographic factors, occupations, daily routine and other social factors also have an impact on the development of a household's energy consumption. Copyright © 2004 John Wiley & Sons, Ltd.     

Modelling and analysis of routing and resource allocation techniques in multi‐service networks

In this paper a novel call level model based on the extension of the classical Erlang multi‐rate model for broadband integrated services networks is proposed. We use the model to study routing strategies in multi‐service networks where service classes with/without QoS guarantees coexist. Examples for such networks include ATM and IP‐based integrated networks. In ATM, the CBR and VBR service classes provide QoS guarantees, while the ABR and UBR service classes are of the best effort type. In IP, traditional TCP/IP traffic is of the best effort type, while new protocols like the RSVP or the differentiated services with central resource handling attempt to support QoS parameters. The coexistence of guaranteed and best effort traffic gives rise to new challenging problems since for a given elastic (best effort) connection the bottleneck link determines the available bandwidth and thereby puts constraints on the bandwidth at the other links along the connection's path. Since the available bandwidth fluctuates in time following the load on the links, routing and link allocation in this environment together with blocking probability calculations and fairness issues need to be studied. By means of our proposed model we are able to conduct a survey of various routing and link allocation techniques as well as to develop a modified shortest path routing algorithm which, according to the numerical examples, performs well in this environment. Copyright © 1999 John Wiley & Sons, Ltd.     

Survivability using traffic balancing and backup resource reservation in multi‐domain optical networks

Survivability in the geographically distributed backbone multi‐domain optical networks (MDONs) is critical because of issues related to its size, usage of resources, and domain management policies of the comprising domains. In MDONs, the emerging scheduled traffic is increasingly multivendor, multimedia, and periodic. It is high during the office (working) hours and low during the non‐office (non‐working) hours in a day. A connection failure during the office hours may result in huge amount of information being lost. Towards providing an acceptable level of service even when a connection fails, we first provide traffic balancing (TB) based solutions where the intra/inter‐domain traffic is slided (S1‐TB), shifted (S2‐TB), or slided as well as shifted (S3‐TB) based on the service level agreement between the client and domain service provider. Of the above solutions, the solution based on sliding as well as shifting (S3‐TB) performs best, and hence for further improvement in S3‐TB, we incorporate backup multiplexing with advance backup resource reservation (BRR) and evaluate the performance of the strategy and report results. The performance evaluation of the above strategies is compared with the existing extended path shared protection (EPSP) by a simulator developed in MATLAB and tested on three‐domain and five‐domain standard network topologies, on the metrics of blocking probability, network resource utilization ratio, network capacity utilized by backup route, wavelength link used per backup lightpath, and a newly introduced metric, network resource utilization index. As compared with the existing strategy EPSP, the S3‐TB and S3‐TB with BRR showed improved performance on all the metrics.