Quality Of Service Metrics Research Articles

A Constellation Design Methodology Based on QoS and User Demand in High-Altitude Platform Broadband Networks

An investigation into the constellation design methodology of high-altitude platform (HAP) broadband networks is presented. The quality of service (QoS) metrics and user demand model are established in the HAP broadband networks. Each HAP is seen as a mobile base station, and a methodology of mobile base station placement is proposed with QoS and user demand guarantee for the first time. The multiple HAP coverage is analyzed with link geometry based on the single HAP coverage model. Besides, a cost-efficient optimization design framework for the HAP constellation is established by optimizing the design vector to maximize the network capacity per cost under the constraints of QoS metrics. In addition, the optimization model and improved artificial immune algorithm based on immune review are designed, and performance of the proposed method is demonstrated through in-depth numerical simulations. Simulation results show that the proposed constellation design method can effectively solve the problem of the mobile base station layout in the HAP broadband networks.

An Intelligent Traffic Engineering Method over Software Defined Networks for Video Surveillance Systems Based on Artificial Bee Colony

In applications such as video surveillance systems, cameras transmit video data streams through network in which quality of received video should be assured. Traditional IP based networks cannot guarantee the required Quality of Service (QoS) for such applications. Nowadays, Software Defined Network (SDN) is a popular technology, which assists network management using computer programs. In this paper, a new SDN-based video surveillance system infrastructure is proposed to apply desire traffic engineering for practical video surveillance applications. To keep the quality of received videos adaptively, usually Constraint Shortest Path (CSP) problem is used which is a NP-complete problem. Hence, heuristic algorithms are suitable candidate for solving such problem. This paper models streaming video data on a surveillance system as a CSP problem, and proposes an artificial bee colony (ABC) algorithm to find optimal solution to manage the network adaptively and guarantee the required QoS. The simulation results show the effectiveness of the proposed method in terms of QoS metrics.

AN EFFICIENT MULTI-CONSTRAINED FEASIBLE PATH SELECTION FOR MANET

Quality-of-service (QoS) routing in an Ad-Hoc network is difficult because the network topology may change constantly and the available state information for routing is inherently imprecise. This paper proposes a method for multiconstrained feasible path selection for MANET. We introduce the composite function which allows OLSR to find the feasible path in case of multiple routes are available to reach the same destination. Combinations of additive and non additive QoS metrics are considered to find the best path. Our simulation results show that the QoS version of the OLSR do improve the Packet Delivery Ratio, Throughput, Normalized control overhead, End-to-End delay and Packet loss but with the increased time complexity.

Exponential Genetic Algorithm-Based Stable and Load-Aware QoS Routing Protocol for MANET

Abstract As the actual links in mobile ad hoc networks (MANETs) are dynamic, the feasible path generated may not exist during the transmission of multimedia data. There is a need for generating multiple paths for guaranteed transmission. The multi-path finding can be achieved through a genetic-based algorithm that faces the major challenge in quality-of-service (QoS)-aware routing. To enhance the QoS communication over the MANETs, an exponential genetic algorithm (GA)-based stable and load-aware QoS routing protocol (SLAQR) is proposed in this paper. This paper chiefly focuses on the enhancement of the GA-based routing algorithm by including exponential function in the searching process and modifying the fitness function, which incorporates QoS metrics like the node’s static resource capacity, dynamic resource availability, neighborhood quality, and link quality. The originality of the proposed protocol comes from the fact that it introduces multiple parameters into the route quality computation and integrates the exponential function into the GA. For experimental validation, the simulation of the proposed method is done and the results are compared with existing protocols such as GAQR (GA-Based QoS Routing), QMRB-AODV (QoS Mobile Routing Backbone Over Ad Hoc On-Demand Distance Vector Routing), and EISGA (Ensemble of Immigrant Strategies with Genetic Algorithm). From the outcome, we conclude that the delivery ratio, throughput, and delay of our proposed SLAQR approach have improved the GAQR approach by 58%, 56%, and 97%, respectively.

Cross-layer resource allocation based on equivalent bandwidth in OFDMA systems

A quality of service (QoS) guaranteed cross-layer resource allocation algorithm with physical layer, medium access control (MAC) layer and call admission control (CAC) considered simultaneously is proposed for the full IP orthogonal frequency division multiple access (OFDMA) communication system, which can ensure the quality of multimedia services in full IP networks. The algorithm converts the physical layer resources such as sub-carriers, transmission power, and the QoS metrics into equivalent bandwidth which can be distributed by the base station in all three layers. By this means, the QoS requirements in terms of bit error rate (BER), transmission delay and dropping probability can be guaranteed by the cross-layer optimal equivalent bandwidth allocation. The numerical results show that the proposed algorithm has higher spectrum efficiency compared to the existing systems.

End-to-End Link Reliable Energy Efficient Multipath Routing for Mobile Ad Hoc Networks

Among the many multipath routing protocols, the AOMDV is widely used in highly dynamic ad hoc networks because of its generic feature. Since the communicating nodes in AOMDV are prone to link failures and route breaks due to the selection of multiple routes between any source and destination pair based on minimal hop count which does not ensure end-to-end reliable data transmission. To overcome such problems, we propose a novel node disjoint multipath routing protocol called End-to-End Link Reliable Energy Efficient Multipath Routing (E2E-LREEMR) protocol by extending AOMDV. The E2E-LREEMR finds multiple link reliable energy efficient paths between any source and destination pair for data transmission using two metrics such as Path-Link Quality Estimator and Path-Node Energy Estimator. We evaluate the performance of E2E-LREEMR protocol using NS 2.34 with varying network flows under random way-point mobility model and compare it with AOMDV routing protocol in terms of Quality of Service metrics. When there is a hike in network flows, the E2E-LREEMR reduces 30.43 % of average end-to-end delay, 29.44 % of routing overhead, 32.65 % of packet loss ratio, 18.79 % of normalized routing overhead and 12.87 % of energy consumption. It also increases rather 10.26 % of packet delivery ratio and 6.96 % of throughput than AOMDV routing protocol.

QoS-Guaranteed User Scheduling and Pilot Assignment for Large-Scale MIMO-OFDM Systems

The combination of the large-scale multiple-input–multiple-output (MIMO) and orthogonal frequency-division multiplexing (OFDM) transmissions is a promising candidate for future wireless communication systems. We investigate a quality of service (QoS) guaranteed user-scheduling algorithm for large-scale MIMO-OFDM systems, where pilots are assigned to served users. In general, a wireless channel concentrates its energy on a specific region in the angle and delay domains. We suggest to reuse pilots based on this channel property in a macrocellular environment, thus reducing pilot overhead significantly. In the presence of contamination caused by the pilot reuse, we analyze the asymptotic behavior and design an interference cancelation (IC) precoder. For both the simple matched filter (MF) precoder and the sophisticated IC precoder, we derive achievable rates under pilot contamination, which are metrics for QoS. Further, according to the analysis under a special case, the number of QoS-guaranteed users proves to be maximized when an equispaced property in the angle domain is satisfied. The theoretical result facilitates a low-complexity user-scheduling algorithm. Numerical results confirm our analysis and proposed pilot scheme, and they show that the proposed scheduling algorithm can select out the maximum served users with guaranteed QoS.

An energy‐aware virtual machine scheduling method for service QoS enhancement in clouds over big data

SummaryBecause of the strong demands of physical resources of big data, it is an effective and efficient way to store and process big data in clouds, as cloud computing allows on‐demand resource provisioning. With the increasing requirements for the resources provisioned by cloud platforms, the Quality of Service (QoS) of cloud services for big data management is becoming significantly important. Big data has the character of sparseness, which leads to frequent data accessing and processing, and thereby causes huge amount of energy consumption. Energy cost plays a key role in determining the price of a service and should be treated as a first‐class citizen as other QoS metrics, because energy saving services can achieve cheaper service prices and environmentally friendly solutions. However, it is still a challenge to efficiently schedule Virtual Machines (VMs) for service QoS enhancement in an energy‐aware manner. In this paper, we propose an energy‐aware dynamic VM scheduling method for QoS enhancement in clouds over big data to address the above challenge. Specifically, the method consists of two main VM migration phases where computation tasks are migrated to servers with lower energy consumption or higher performance to reduce service prices and execution time. Extensive experimental evaluation demonstrates the effectiveness and efficiency of our method. Copyright © 2016 John Wiley & Sons, Ltd.

A Novel Mechanism for Delivering IPTV Traffic in Ethernet Passive Optical Networks

<p><strong>Abstract</strong> </p><p>IPTV offers digital television services over Internet Protocol (IP) for the ubscribers at a lower cost. Despite all the attractive IPTV services, it also requires high-speed access networks with the functions of multicasting, Quality-of-Services (QoS) guarantee and so on. In the access networks, Ethernet Passive Optical Network (EPON) is regarded as one of the best technology to meet the higher bandwidth demands applications such as IPTV. There are two common mechanisms used for delivering IPTV to the users in the EPON system such as, dedicated stream and multicast stream. The dedicated stream is not scalable to a large number of clients because of the limited bandwidth and resource consumption at the server side. Conversely, although multicast could be used as a scalable solution for media streaming, but providing such services in the EPON is still challenging due to some limitations in the EPON system. In this paper, we propose a new mechanism that is a Single Copy Broadcast (SCB) with Priority Queue (PQ) mechanism that can accommodate large number of clients IPTV streams without adding extra bandwidth and resources at the Optical Line Terminal (OLT). Simulation results have shown that our proposed mechanism can improve the QoS metrics and system performance in terms of bandwidth consumption and power consumption.</p><p>Keywords— IPTV, QoS, EPON, Unicast, Multicast, Single Copy Broadcast</p>

Wireless Neighborhood Area Networks With QoS Support for Demand Response in Smart Grid

In order to support various innovative demand response programs, smart grid needs a wireless communication network with quality-of-service (QoS) support. This paper studies the issue of providing QoS in terms of packet delay, packet error probability, and outage probability to a large number of sensors and smart meters in a neighborhood area network of a densely populated urban area. We assume the network is based on the IEEE 802.15.4g Standard. Given that bandwidth is limited, we propose to divide smart meters into groups and each group will take a turn to access a shared wireless channel in a time-division-multiplexing manner. Within each allocated time duration, a group of smart meters will compete for channel access using a simple slotted Aloha protocol. We have developed an analytical model to quantify the QoS metrics. Through the analytical model, we can determine the minimum concentrator density that is required to support a given smart meter density. We have verified the analytical model through simulations. The results show that we need less than ten concentrators per km $^{2}$ to support a node density of 500 units per km $^{2}$ , while making sure that packet delay does not exceed 1.0 s, packet error probability is below 0.005 and outage probability is lower than 0.01.

A Trust Model Based Routing Protocol For MANET

In mobile ad hoc networks (MANETs), the provision of quality of service (QoS) guarantees is much more challenging than in wire line networks, mainly due to node mobility, multi hop communications, contention for channel access, and a lack of central coordination. The difficulties in the provision of such guarantees have limited the usefulness of MANETs. In the last decade, much research attention has focused on providing QoS assurances in MANET protocols. In this paper we have analysed different types of routing protocols and QoS metrics in MANETS. Trust based AODV (TAODV) routing protocol modify the effect of AODV routing protocol. In TAODV is preferred to achieve best result in terms of end-to-end delay, energy packet delivery ratio and throughput.

QoS Aware Routing and Admission Control in Shadow-Fading

Shadow-Fading model, it's difficult to get Quality of service (QoS) because of the massive scaling fading like node mobility, a scarcity of centralized co-ordination, fading radio signals, distributed channel access, and also the unreliable nature of the wireless channel. To achieve this objective a protocol QoS-aware routing (QAR) and an admission control (AC) has been projected that has QoS guarantees within the face of the higher than mentioned difficulties long-faced. Providing QoS in MANETs, overcoming these problems by victimization QoS aware routing and admission control mechanism that are needed to make sure high levels of QoS, rising bandwidth, throughput and minimizing packet loss rate and end to end de-lay QoS metrics. This paper presents, utilizing a practical shadow fading channel, of the performance of many progressive amalgamated QAR-AC protocols that are designed for providing throughput guarantees to applications. This protocol has been enforced with a mechanism of getting backup routes and re-routing once shadowing-induced link failures for active sessions. It's found that proposes optimizations supported interactions between routing, and admission control layers which provide important performance enhancements dependability of assured throughput services.

Dominant handover algorithms for vehicular Radio-over-Fiber networks at 60 GHz: A performance evaluation study

In mobile picocellular network topologies a critical issue is the handover procedure in conjunction with the provided quality of service, due to the limited overlapping areas between adjacent cells. In vehicular picocellular networks handovers are more frequent and render quality of service metrics–such as packet loss rate, delay and jitter–even more critical, since the afore-mentioned limitation is combined with the high velocities of mobile end-users.The paper focuses on presenting the dominant handover algorithms in vehicular Radio-over-Fiber (RoF) networks at 60 GHz, i.e., the Traditional Handover Algorithm (THO), the Virtual Cellular Zone (VCZ), the Moving Extended Cell (MEC) and the Moving Extended N-Cells (MENC), respectively. Furthermore, we present a performance evaluation study on the provided quality of service for all the afore-mentioned handover algorithms. Specifically, for all four handover algorithms the corresponding theoretical mathematical models regarding packet losses are analyzed. Moreover, a simulation study is realized, in order to verify the theoretical results and to present algorithms’ effect on additional quality of service indicators, i.e., delay and jitter. The presented results of our performance evaluation study could be a valuable tool to network operators that plan to provide bandwidth-voracious services by deploying vehicular RoF network at 60 GHz.

Scalable classification of QoS for real-time interactive applications from IP traffic measurements

Measurement of network Quality of Service (QoS) has attracted considerable research effort over the last two decades. The recent trend towards Internet Service Providers (ISP's) offering application-specific QoS is creating possibilities for more sophisticated QoS metrics to be offered by ISP's in service level agreements. This in turn could be used for the purposes of improved network optimization and billing according to application specific QoS guarantees. We report a scalable near real-time approach using passively logged IP traffic data for classification of application latency and packet loss across a range of real-time interactive applications. We run six experiments involving Minecraft, Quake 3 Urban Terror, VLC video streaming and the commercial Wirofon VOIP application. We use a mixture of laboratory and real-world deployments, with run times ranging from hours to days, and observe a combination of real and simulated ISP latency and packet loss events. Our binary classification (i.e. classes 'OK' or 'lag') 10-fold cross validation F1 scores are between 0.80 and 0.93 depending on the application type. Our multi-class classification (i.e. classes representing discrete packet loss or latency ranges) 10-fold cross validation F1 scores for Minecraft are 0.89 for latency and 0.90 for packet loss. With new business models between ISP's and application developers being actively considered this work represents a significant contribution to the debate by providing scientific evidence relating to a novel approach to scalable QoS measurement

Big Data for Autonomic Intercontinental Overlays

This paper uses big data and machine learning for the real-time management of Internet scale quality-of-service (QoS) route optimisation with an overlay network. Based on the collection of data sampled every 2 min over a large number of source-destinations pairs, we show that intercontinental Internet protocol (IP) paths are far from optimal with respect to QoS metrics such as end-to-end round-trip delay. We, therefore, develop a machine learning-based scheme that exploits large scale data collected from communicating node pairs in a multihop overlay network that uses IP between the overlay nodes, and selects paths that provide substantially better QoS than IP. Inspired from cognitive packet network protocol, it uses random neural networks with reinforcement learning based on the massive data that is collected, to select intermediate overlay hops. The routing scheme is illustrated on a 20-node intercontinental overlay network that collects some 2 × 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">6</sup> measurements per week, and makes scalable distributed routing decisions. Experimental results show that this approach improves QoS significantly and efficiently.

Towards SDN based queuing delay estimation

As one of QoS (Quality of Service) metrics, delay is critical important to delay sensitive applications, such as interactive video, network game and online surgery. In this paper, we exploit SDN (Software Defined Networking) advantages to solve delay QoS problem. Our work mainly focuses on SDN based queuing delay estimation with real traffic and end-to-end delay control. First, we propose a queuing estimation model and extended it for end-to-end delay of the whole path. It is proved to be feasible and accurate with experimental results in SDN environment. Second, in order to demonstrate the use of our proposed model, we also implement an end-to-end delay control application in SDN. It fulfills specific delay QoS requirements by dynamically switching flows to a suitable queue based on estimation results and delay requirements.

Automated QoS-oriented cloud resource optimization using containers

Optimizing the deployment of software in a cloud environment is one approach for maximizing system Quality-of-Service (QoS) and minimizing total cost. A traditional challenge to this optimization is the large amount of benchmarking required to optimize even simplistic cloud systems. This paper introduces $$\hbox {C}^2$$C2RAM, an new approach to enable rapid, optimized deployment of software onto a cloud environment by substantially reducing the number of benchmarks required. $$\hbox {C}^2$$C2RAM continues to perform some benchmarking, and therefore its predictions of application QoS metrics, such as throughput and latency, are very accurate. Our results show a maximum difference of 1.06 % between $$\hbox {C}^2$$C2RAM predicted QoS and empirically measured QoS. Moreover, $$\hbox {C}^2$$C2RAM can be provided with QoS requirements for each software in the system, and will ensure that each requirement is met before presenting a deployment plan.

Secrecy performance of MIMO Nakagami‐m wiretap channels with optimal TAS and different antenna schemes

AbstractTransmit antenna selection (TAS) in wiretap channels has arisen as a simple promising scheme to improve physical layer security. However, up to now, TAS schemes have aimed at maximising the instantaneous signal‐to‐noise ratio of the legitimate receiver, which by its essence is a sub‐optimal strategy from a secrecy point of view. In this paper, unlike previous works, we propose a novel TAS scheme for multiple‐input multiple‐output wiretap channels by exploiting full channel state information. The proposed scheme achieves higher secrecy performance by selecting an antenna that maximises the secrecy rate. In our analysis, we assume that the receiver (Rx) and the eavesdropper employ either selection combining (SC) or maximal‐ratio combining (MRC) to combine the received signals, and this results in four different receiver combining arrangements. By considering Nakagami‐m fading, secrecy performance is analysed. Specifically, closed‐form expressions for the secrecy outage probability are derived, which can be used as a quality of service metric. Moreover, an asymptotic analysis is carried out and the respective diversity/array gains are obtained. The ergodic secrecy rate is also investigated for the case of multiple‐input single‐output wiretap channels. Insightful discussions are attained from our analysis. For instance, it is shown that the performance gain of MRC over SC at the Rx does not depend on the number of antennas and combining scheme at the eavesdropper. More interestingly, we observe that such a performance gain is independent of the TAS scheme used at the transmitter (Tx). On the other hand, it is shown that the secrecy gap between SC and MRC at the eavesdropper is independent of the number of antennas at the Tx, but it depends on the number of antennas at the Rx. Finally, it is demonstrated that the diversity gain is the same for all antenna configurations. Copyright © 2016 John Wiley &amp; Sons, Ltd.

SALMA: An Efficient State-Based Hybrid Routing Protocol for Mobile Nodes in Wireless Sensor Networks

With the rapid development in mobile Wireless Sensor Networks (WSNs), it has become very essential to focus on the efficiency in performance of small sensing nodes operating in WSNs. While designing a routing protocol for mobile sensor nodes, the quality parameters like end-to-end delays and routing overhead are always considered. Moreover, the nodes in wirelessly connected mobile networks consume considerable power on routing more than other functionalities. Any modification in a standard routing protocol can also affect routing overhead, end-to-end delays, and energy consumption of nodes. In this paper a new hybrid routing protocol, named as State-Aware Link Maintenance Approach (SALMA), is introduced which is based on Dynamic Source Routing (DSR) and Optimized Link State Routing (OLSR) protocols. The work also focuses on the activeness of nodes in the network operations and defines three states of nodes, that is, white, gray, and black. The work concludes that the proposed protocol gives improvements in some quality of service metrics like lower delay than DSR, lower routing overhead than OLSR, and lesser energy consumption by the network nodes.

MARS: Multiple Access Radio Scheduling for a Multi-homed Mobile Device in Soft-RAN

In order to improve the Quality-of-Service (QoS) of latency sensitive applications in next-generation cellular networks, multi-path is adopted to transmit packet stream in real-time to achieve high-quality video transmission in heterogeneous wireless networks. However, multi-path also introduces two important challenges: out-of-order issue and reordering delay. In this paper, we propose a new architecture based on Software Defined Network (SDN) for flow aggregation and flow splitting, and then design a Multiple Access Radio Scheduling (MARS) scheme based on relative Round-Trip Time (RTT) measurement. The QoS metrics including end-to-end delay, throughput and the packet out-of-order problem at the receiver have been investigated using the extensive simulation experiments. The performance results show that this SDN architecture coupled with the proposed MARS scheme can reduce the end-to-end delay and the reordering delay time caused by packet out-of-order as well as achieve a better throughput than the existing SMOS and Round-Robin algorithms.