Multiservice Networks Research Articles

Алгоритм оптимальной маршрутизации в мультисервисных телекоммуникационных сетях

Алгоритм оптимальной маршрутизации в мультисервисных телекоммуникационных сетях

Reliable and Multicast Energy Efficiency Harvesting through IoT

A smart city is acondition where a pervasive, multi-service network is occupied to affordpeoplebetter-qualityactive conditions as well as better public safety. Innovative communication technologies are needed to scope this goal. In specific, awell-organized and reliable broadcast network the stage a crucial role in as long as continue, ubiquitous, and reliable interconnections among users, smart devices, and applications. As aimportance, wireless networking appears as the main enabling announcement technology despite the necessity to face severe experimentations to satisfy the wants arising from a smart environment, such as explosive data volume, heterogeneous data traffic, and maintenance of quality of service restraints. Astimulating approach for meeting the developing data demand due to smart city applications is to adopt suitable methodologies to improve the usage of all potential spectrum resources. Towards this goal, a very promising solution is characterized by the Cognitive Radio technology that enables context-aware competence in order to pursue an efficient use of the accessibleannouncement resources according to the neighboring environment conditions. This thesis provides a review of the features, challenges, and solutions of a smart city message architecture, based on the Cognitive Radio technology, by focusing on two new network paradigms—namely, Heterogeneous Network and Machines-to-Machines communications—that are of differentattention to professionallyprovision smart city applications and services.

МЕТОД И АЛГОРИТМЫ ОБНАРУЖЕНИЯ АНОМАЛИИ В ТРАФИКЕ МУЛЬТИСЕРВИСНЫХ СЕТЕЙ СВЯЗИ, ОСНОВАННЫЕ НА НЕЧЕТКОМ ЛОГИЧЕСКОМ ВЫВОДЕ

Introduction: The major requirement imposed to the systems of detection and prevention of malicious invasions into modern telecommunication infrastructures is the ability to find anomalies and invasion threats in real time. The complexity of this problem is in many respects caused by the incompleteness, discrepancy and diversity of the a priori knowledge about the distribution laws peculiar to the traffic of multiservice communication networks, as well as by the changing nature of malicious actions which make computer systems unsafe. Purpose: Increasing the speed and reliability of network traffic anomaly detection when the analyzed information is incomplete and highly heterogeneous. Results: A hybrid method and adaptive algorithms have been proposed for real-time anomaly detection in multiservice communication network traffic. The hybrid method unites the mechanism of non-identificational adaptation to the changing traffic parameters with the fuzzy logical inference used for regulating the algorithm parameters and for analyzing the output data. The adaptive algorithms are focused on combined implementation of modified stochastic approximation and pseudogradient search procedures. An experimental assessment has shown that the functional characteristics of the algorithms are close to the potentially achievable ones. Practical relevance: The developed method and algorithms can be implemented on available hardwaresoftware platforms on the basis of intellectual agent technology. Sharing them with already existing methods and algorithms of invasion detection can considerably increase the efficiency of information security systems in multiservice communication networks.

A Review on Bandwidth Utilization for Bursty Traffic in Asynchronous Transfer Mode Networks

ATM (Asynchronous Transfer Mode) network is connection-oriented high speed multiservice network. Now a days ATM networks are used as backbone networks in Telecom industry. ATM network supports different service classes, include ABR (Available Bit Rate), rt-VBR (real time Variable Bit Rate), nrt-VBR (non real time Variable Bit Rate), CBR (Constant Bit Rate), UBR (Unspecified Bit Rate), and GBR (Guaranteed Bit Rate)to handle multiple services like data, voice, video and so on. But burtsy traffic handled by ABR, rt-VBR, nrt-VBR, GBR service classes, but all have their own limitations. This paper presents an overview of different Traffic shaping, Congestion Control mechanisms to handle bursty traffic in ATM networks.

Empowering 5G network softwarization through information centric networking

Fifth‐generation (5G) systems are designed as flexible and programmable multiservice networking and computing infrastructures, with improved throughput, latency, and reliability performance. In this paper, we discuss our view about the role of Information‐Centric Networking (ICN) in 5G systems and present some architectural perspectives for the ICN‐5G deployment. The proposed architecture relies on a hybrid approach, which makes the best of the centralized software‐defined networking and the distributed ICN delivery mechanism to effectively suit the mobility of users, contents, and virtualized network/service functions. Its viability is showcased in a representative use case against a legacy non‐ICN approach.

Bit Error Rate (BER) QoS Attribute in Solving Wireless Pricing Scheme on Single Link Multi Service Network

Pricing schemes were set up on multi service network of wireless internet pricing scheme to proposed models applying Bit Error Rate QoS attribute due to requirements for ISP to maximize revenue and provide high quality of service to end users.The model was deigned by improving the original model together with added parameters and variables to the model of multi- service network by setting the base price (α) and premium quality (β) as variables and parameters. LINGO 11.0 were applied to help finding the solution. The results show that the improved models yield maximum revenue for ISP by applying the improved model by setting up a variable α and β as constant as well as by increasing the cost of all the changes in QoS. The QoS attriute BER is proven to achieve the ISP’s goal to maximize the revenue.

Construction of the Mathematical Model of Pricing for Telecommunication Services with Allowance for Congestion in Networks

This paper considers a model of dynamic pricing in the telecommunications market incomplete competition and taking into account overloads in multiservice networks. The model consists in the use of mathematical modeling methods, game theory and queueing theory. It is assumed that telecommunication companies agree on the rules of incoming and outgoing traffic charging in pairs, and this charging is built as a function of the tariffs that companies offer their subscribers for service. Companies are limited the agreement on mutual rules of reciprocal proportional charging for access traffic at first, which subsequently determine the tariffs for the multiservice network users. The reciprocity of the rules means that companies are subject to the same rules for the entire time interval during which the agreement is in force. Taking into account imperfect competition in the telecommunications market and using profit optimization method for each company the equilibrium tariffs and the volume of services are found with subject to congestion in multi-service networks.

Multi-Service Resource Allocation in Future Network With Wireless Virtualization

Future network is envisioned to be a multi-service network which can support various types of terminal devices with diverse quality of service requirements. As one of the key technologies, wireless virtualization establishes different virtual networks dependent on different application scenarios and user requirements through flexibly slicing and sharing wireless resources in future networks. In this paper, we first propose a service-centric wireless virtualization model to slice network according to service types. In this model, how to share and slice wireless resource is one of the fundamental issues to be addressed. Therefore, we formulate and solve a multi-service resource allocation problem to realize spectrum virtualization. Different from the existing strategies, we decouple the multi-service resource allocation problem in the proposed virtualization model to make it easier to solve. Specifically, it is solved in two stages: inter-slice resource allocation and intra-slice resource scheduling. In the first stage, we formulate the inter-slice resource allocation as a discrete optimization problem and propose a heuristic algorithm to get sub-optimal solution of this NP-hard problem. In the second stage, we modify several existing scheduling algorithms suitable for scheduling users of several specific services. Numerical results show the superiority of the proposed scheduling algorithms over the existing ones when applied to schedule specific services. Moreover, proposed resource allocation scheme is verified to meet the properties of virtualization and solves the multi-service resource allocation problem well.

Method of multiservice infrastructure decomposition with network resource slicing for IoT

A new approach to the construction of a multiservice infrastructure with virtualization of network devices is proposed. Multiservice network with a virtualization is a network in which on one or several devices the virtualization mode is used. Virtualization of a network device involves the creation of two or more virtual network machines that serve as a switch or router with individual streaming services. The method of multiservice infrastructure decomposition of a network device with virtualization these resources is developed. This method ensure efficient allocation between different network streams and will allow to improve the quality of service of real-time streams with the provision of guaranteed QoS level of services that are sensitive to losses and delays. The additional novelty of our proposed approach is the additional IoT (Internet of Things) slice overlaying the traditional multiservice network.

Modelling of Multiservice Networks with Separated Resources and Overflow of Adaptive Traffic

The article proposes a new method of determining traffic characteristics of multiservice overflow systems that carry adaptive traffic. When the total offered load in primary resources exceeds a certain value, this type of traffic is admitted for service with lower bitrate. A particular attention is given in the article to a method for a determination of the parameters of traffic that overflows to secondary resources as well as to the way adaptive traffic is serviced. The method takes into consideration three possible types of traffic: Erlang, Engset, and Pascal traffic. It is based on a generalization of Hayward’s concept and its application to model systems with adaptive traffic with threshold compression. The method can be used for optimal dimensioning of logical networks (slices) in modern mobile systems due to possibility of analytical determination of grade of service parameters (blocking probability, carried traffic, and network load). To verify the accuracy of the proposed model the results of analytical calculations, obtained on the basis of the proposed model, are then compared with the results of simulation experiments for a number of selected structures of overflow systems that service adaptive traffic. The results of the study demonstrate high accuracy of the proposed theoretical model.

Adaptive algorithm reallocation of network resources in a network that supports NFV tech-nology

The work is devoted to solving the problem of dynamic reallocation of network resources in multiservice networks with the NFV support to ensure an adequate quality of service. This objective is achieved through development of the adaptive network resource reallocation algorithm, the main criterion of which serves to minimize the final cost. Based on the results of mathematical modeling, an experiment was performed that allowed estimating the gain from using the developed algorithm.

Bottom-up framework for cost allocation to services in telecommunication networks

Communications service providers (CSP) supply information, transport and passive infrastructure services that rely on the deployment of multiservice networks. To attain service cost reductions, the planning and design of those networks is essential, so that the total cost of the network ownership (TCO) is minimized. In this paper, we propose a bottom-up calculation framework for the allocation of the TCO cost components (i.e. capital and operational expenditures) to the services supplied by a CSP. For this, the framework is formulated within the context of the network life-cycle. Our method provides the level of abstraction required for the calculation of the three basic service cost contributors, namely, direct, shared and common costs. Moreover, it outlines the role of network planning in the design of an efficient network infrastucture, and in the calculation of the TCO. Based on this, we show how the stand alone, fully allocated and long-run incremental costs of a service can be calculated. Besides the determination of service cost drivers, the framework is useful to evaluate the cost-efficiency of competing technologies. To illustrate this, we study the allocation of the infrastructure costs for a CSP offering transport services with an optical network. By designing the infrastructure with fixed-grid and flex-grid technologies, it is shown that in both cases the main service cost driver is determined by the transponders installed. The results show that fixed-grid fits well for the provisioning of high speed constant bit-rate transport services, whereas flex-grid is a good candidate for transport services with bursty traffic patterns.

Network Slicing in 5G: Survey and Challenges

5G is envisioned to be a multi-service network supporting a wide range of verticals with a diverse set of performance and service requirements. Slicing a single physical network into multiple isolated logical networks has emerged as a key to realizing this vision. This article is meant to act as a survey, the first to the authors� knowledge, on this topic of prime interest. We begin by reviewing the state of the art in 5G network slicing and present a framework for bringing together and discussing existing work in a holistic manner. Using this framework, we evaluate the maturity of current proposals and identify a number of open research questions.

A control framework to develop smart grid communications: possible pointers from multiservice network research

This paper addresses the challenge of developing an architecture for the smart grid with the particular focus to support smart grid communication. It considers the smart grid system in general to identify the relationship between the power distribution and communication networks, and then focuses mainly on smart grid communication requirements. It observes the similarity between the quality of service (QoS) requirements for smart grid communications and those identified in multiservice networking. It reviews the principles of open communication and introduces architectures for open communication that have been enhanced to meet the requirements of multiservice. It discusses previous research into multiservice with a review into recent work focused on meeting the multiservice requirements of smart grid communications. Based on these, the paper presents key specific pointers toward defining a contextual control framework for the data transport system of the smart grid.

Multipath Routing Mathematical Model to Solve the Traffic Engineering in Multi-Protocol Label Switching Network

Multipath Protocol Label Switching (MPLS) is a routing mechanism (technology) used in modern telecommunication networks, which is built as a multi-service network with a certain Quality of Service (QoS). To maintain the required QoS in such complicated networks, the Traffic Engineering (TE) should be equipped with optimum traffic management, routing mechanism, and switching operations, which are what this paper tackles, where the TE is identified as the optimal distribution of flows in the existing network. In this paper, an effective multipath routing mathematical model is developed based on several previous mechanisms to ensure the guaranteed desired QoS and loading balance according to the Telecommunication Network Systems (TCS) resources, to achieve the optimum TE, and hence improving the network usage efficiency. Moreover, the obtained mathematical optimization algorithm results are provided through the relative equations. Indeed the developed routing mathematical model in this paper is suitable for the dynamic distribution of information flows, which is the main improvement in the TE achieved in this work.

A control framework to develop smart grid communications: possible pointers from multiservice network research

A control framework to develop smart grid communications: possible pointers from multiservice network research

A network-wide exact optimization approach for multiobjective routing with path protection in multiservice multiprotocol label switching networks

ABSTRACTA multiobjective routing model for multiprotocol label switching networks with multiple service types and path protection is presented in this article. The routing problem is formulated as a biobjective integer program, where the considered objectives are formulated according to a network-wide optimization approach, i.e. the objective functions of the route optimization problem depend explicitly on all traffic flows in the network. A disjoint path pair is considered for each traffic trunk, which guarantees protection to the associated connection. A link-path formulation is proposed for the problem, in which a set of possible pairs of paths is devised in advance for each traffic trunk. An exact method (based on the classical constraint method for solving multiobjective problems) is developed for solving the formulated problem. An extensive experimental study, with results on network performance measures in various randomly generated networks, is also presented and discussed.

Delay Aware and Users Categorizing-Based Call Admission Control for Multi-Services LTE-A Networks

In this paper, we introduce the user’s privileges and traffic maximum delay tolerance as additional dimensions in the call admission control processes to efficiently control the utilization of LTE-A network resources. Based on this idea, we propose an efficient call admission control scheme named “Delay Aware and User Categorizing-based CAC with Adaptive Resource Reservation”, where the user priority is adjusted dynamically based on the current network conditions and the users’ categorizations and traffic delay tolerances, to increase the network’s resource utilization and at the same time to maximize the operators’ revenue. In this proposed scheme, the users are classified into Golden users and Silver users, and the type of service per user is classified as real-time (RT) and non-real-time (NRT) services. We compare the performance of the proposed scheme with the corresponding results of previous schemes, referred to as the adaptive resource reservation-based Call Admission Control (ARR-CAC), where user categorization and delay were not taken into consideration in the call admission control process. Simulation results indicate the superiority of the proposed scheme because it is able to achieve a better balance between system utilization, users’ privileges provided by network operators and QoS provisioning compared to the ARR-CAC scheme.

A QoE-based jointly subcarrier and power allocation for multiuser multiservice networks

Quality of experience (QoE) is widely applied to reflect users satisfaction of the network service, which exactly conforms to the user-centric concept in 5G. In this paper, we propose a QoE-based subcarrier and power allocation algorithm for the downlink transmission of a multiuser multiservice system. For the subcarrier allocation algorithm, the rate proportional fairness factor is defined to ensure the fairness between users. Based on different QoE models of three services, i.e., file down (FD), video streaming and voice over internet protocol (VOIP), a multi-objective optimization method is exploited to allocate the power resource by minimizing the total power consumption and maximizing the mean opinion score (MOS) value of users simultaneously. Simulation results indicate that the proposed algorithm has less power consumption and higher QoE performance than the traditional proportional fairness (PF) algorithm. In addition, the proposed algorithm can achieve nearly the same fairness performance as the PF algorithm. Moreover, when the number of subcarriers becomes larger, the power assumption will be less but with little influence on both the QoE and fairness performances.

Optimal Node Allocation in Multiservice WSNs Based on Correlated Strategy

A distributed game theoretic framework based on correlated strategies is proposed to maximize the lifetime of dense homogeneous multiservice wireless sensor networks (MS-WSNs), that support multiple services continually and ubiquitously over the WSN deployment. The MS-WSN operation is dealt with as a game played by the multimode nodes. A correlated strategies approach is proposed to lead the MS-WSN close to its theoretical optimal state with respect to the network lifetime. The computationally efficient correlated strategy proposed to implement service selection by the multimode WSN nodes is distributed, based solely on local information exchange. Indicative simulation results concerning the application of the proposed scheme on top of $k$ -hop clustering reveal that the proposed correlated strategies based framework leads the MS-WSN operation close to its theoretical optimal at no significant exchange of overhead messages.