Search

A solid foundation for behavior portrait construction in the fight against telecom fraud is the goal of this research. The study explores the integration of communication AI and Big Data technologies, focusing on the perspective of artificial intelligence. By using insights obtained from a telecom fraud detection model that relies on users' behavior variations expressed through time-varying signatures, the goal of this study is to enhance fraud prevention strategies in the telecom industry. Through the examination of call detail records and customer profile information, the TeleGuard AI Fraud Prevention Framework (TGAI-FPF) aims to recognize suspicious trends and variations that are potentially suggestive of fraudulent actions. The purpose of the model is to generate behavior portraits that are capable of capturing the distinctive aspects of fraudulent conduct in telecom networks. This will be accomplished through the utilization of advanced analytics and machine learning algorithms. The study highlights the significance of leveraging big data analytics and artificial intelligence technologies to efficiently detect and thwart fraudulent activity in the telecom industry. The results of this study should fortify the defenses of telecom networks against growing fraudulent schemes and help in the development of preventative measures to combat fraud. This is the anticipated manner in which the results will add. [ABSTRACT FROM AUTHOR]

This paper considers a Geo/G/1 queueing system within a discrete-time framework. The model seamlessly integrates state-dependent policies, incorporating both single working vacation and multiple vacations, thereby reflecting the dynamic nature of telecommunication environments. The matrix analytic method is utilized to analyze essential system performance indices, such as long-run probabilities of the distinct server states and the expected queue size of the system, offering insights into the nuanced behavior of Geo/G/1 queueing systems within the discrete-time framework. The results are expected to offer valuable insights for enhancing the performance of telecommunication networks. These insights cover various aspects, including single working vacations, multiple vacations, and state-dependent policies. Consequently, they are poised to establish a solid foundation for improving system efficiency and adapting to dynamic operational conditions. [ABSTRACT FROM AUTHOR]

The frequency assignment problem in a telecommunication network refers to the task of assigning frequencies to transmitters to minimize or eliminate interference and to optimize at least one other parameter. The literature on this task is vast and examines many parameter optimization objectives. Numerous schemes, models, and methods have been proposed. In this article, we present an extensive survey of the published studies on the frequency assignment problem in the context of a wide range of applications. Different types of optimization objectives, models and solution methods are presented in a systematic way.

Rapid growth in the volume of transmitted information has lead to the emergence of new wireless networking technologies with variable heterogeneous topologies. With limited radio frequency resources, optimal routing problems arise, both at the network design stage and during its operation. We propose an algorithm based on a minimum loss intensity (greedy-gradient algorithm) to search for optimal routes of information transmission in telecommunication networks. The relevance of the developed algorithm is determined by its practical use in data-transmitting modeling systems. The proposed algorithm satisfies several requirements, such as the speed of the calculations performed, the fulfillment of the conditions for its convergence, and its independence on the selected loss probability function, as well as on the network topology. The idea of the algorithm is a step-by-step recalculation of metrics based on derivatives of the loss intensity function with simultaneous redistribution of information flows along the routes determined by the Floyd algorithm. The comparative efficiency of the proposed algorithm is demonstrated by computational experiments on various network topologies (up to 100 nodes) with various traffic intensities. [ABSTRACT FROM AUTHOR]

The capacitated dispersion problem, which is a variant of the maximum diversity problem, aims to determine a set of elements within a network. These elements could symbolize, for instance, facilities in a supply chain or transmission nodes in a telecommunication network. While each element typically has a bounded service capacity, in this research, we introduce a twist. The capacity of each node might be influenced by a random Bernoulli component, thereby rendering the possibility of a node having zero capacity, which is contingent upon a black box mechanism that accounts for environmental variables. Recognizing the inherent complexity and the NP-hard nature of the capacitated dispersion problem, heuristic algorithms have become indispensable for handling larger instances. In this paper, we introduce a novel approach by hybridizing a heuristic algorithm with reinforcement learning to address this intricate problem variant. [ABSTRACT FROM AUTHOR]

In this article we introduce a preprocessing technique to solve the Segment Routing Traffic Engineering Problem optimally using significantly fewer computational resources than previously introduced methods. Segment routing is a recently developed interior gateway routing protocol to be used on top of existing protocols that introduces more flexibility in traffic engineering. In practice, segment routing allows to deviate traffic from its original path by specifying a list of intermediate nodes or links, called segments, to visit before going to its destination. The issue we tackle in this article is that the number of segment paths scales exponentially with the maximum number of segments allowed leading to scalability issues in mathematical formulations. This article introduces the notion of dominated segment paths, these are paths that can be eliminated from the solution space when searching for an optimal solution. We propose a dynamic programming algorithm eliminating dominated paths for any number of segments. Numerical results show that respectively 50%, 90%, and 97% of paths are dominated when considering up to 2, 3, and 4 segments on benchmark network topologies. [ABSTRACT FROM AUTHOR]

Abstract This paper is concerned with tele‐presence and tele‐operation of autonomous vehicles over the Additive White Gaussian Noise (AWGN) channel. This wireless communication channel is subject to transmission noise and transmission power constraint. An encoder, decoder and controller are proposed by implementing a novel linearization method for linearizing the nonlinear dynamic systems at operating points. For the linearized systems, the encoder, decoder and controller are implemented that were previously proposed for output tracking as well as stability of linear dynamic systems. Two novel linearization methods are proposed and their satisfactory performances are proved for output tracking as well as stability of nonlinear dynamic system. The first method is based on the fixed linearization rate and the second one is based on the variable (optimal) linearization rate. The decoder that is based on the second method is in fact the extended Kalman filter with the optimal linearization rate. The performances of these two methods are compared with each other and the other proposed methods by implementing them to the problems of the tele‐presence and tele‐operation of autonomous vehicles over the AWGN channel. Their satisfactory performances are illustrated. It is illustrated that the second method has higher computational complexity with slightly better performance and is applicable to a larger class of reference trajectories.

Abstract This paper introduces the short packet transmission in non‐orthogonal multiple access (NOMA)‐based unmanned aerial vehicle (UAV) assisted relay communication system. Short packet transmission has considerable potential to decrease the transmission latency of UAV communication, and NOMA can effectively enhance the spectrum efficiency and fairness. To improve the reliability of the system, an effective packet error rate (PER) minimization problem within short packet transmission is proposed by jointly optimizing the packet length, UAV placement, and power allocation under the reliability requirement and total power constraints. To address the intricate PER minimization problem, the optimization problem is firstly decomposed into three sub‐problems, and the corresponding monotonicity and convexity are analyzed, respectively. Then, an overall iterative optimization algorithm for PER minimization based on alternating direction method of multipliers algorithm and optimal solution algorithm is formulated by solving the three sub‐problems in an iterative manner. Simulation results validate the effectiveness and convergence of the proposed NOMA scheme and overall iterative optimization algorithm, respectively.

Abstract Owing to the advantages of low cost, flexibility, and the transmission characteristics of air–ground (AG) channels, using the unmanned aerial vehicle (UAV) as mobile relay to assist wireless communication has received significant interest recently. A green non‐orthogonal multiple access (NOMA)‐based multi‐UAV‐enabled relaying system with different rate requirements is proposed here. To improve energy efficiency (EE) of the UAV relays, an optimization problem for user grouping, UAV trajectory design and resource allocation under the constraints of information causality constraint, UAVs' maximum service capacity, maximum transmit power constraint, and different communication rate requirements of the mobile users (MUs) is formulated. According to the grouping results, the UAVs' trajectory and power allocation by Dinkelbach method, successive convex approximation, and condensation algorithm are alternately optimized. To solve this highly coupled non‐linear mixed integer programming problem, a graph‐based grouping algorithm is proposed to reduce the relative distance between the UAV relay and the MU. Simulation results show that the proposed optimization algorithm can effectively improve the EE performance of this NOMA‐based multi‐UAV‐enabled relaying system.

With the continuous escalation of telecommunication fraud modes, telecommunication fraud is becoming more and more concealed and disguised. Existing Graph Neural Networks (GNNs)-based fraud detection methods directly aggregate the neighbor features of target nodes as their own updated features, which preserves the commonality of neighbor features but ignores the differences with target nodes. This makes it difficult to effectively distinguish fraudulent users from normal users. To address this issue, a new model named Feature Difference-aware Graph Neural Network (FDAGNN) is proposed for detecting telecommunication fraud. FDAGNN first calculates the feature differences between target nodes and their neighbors, then adopts GAT method to aggregate these feature differences, and finally uses GRU approach to fuse the original features of target nodes and the aggregated feature differences as the updated features of target nodes. Extensive experiments on two real-world telecom datasets demonstrate that FDAGNN outperforms seven baseline methods in the majority of metrics, with a maximum improvement of about 5%. [ABSTRACT FROM AUTHOR]

This paper is concerned with tele‐presence and tele‐operation of autonomous vehicles over the Additive White Gaussian Noise (AWGN) channel. This wireless communication channel is subject to transmission noise and transmission power constraint. An encoder, decoder and controller are proposed by implementing a novel linearization method for linearizing the nonlinear dynamic systems at operating points. For the linearized systems, the encoder, decoder and controller are implemented that were previously proposed for output tracking as well as stability of linear dynamic systems. Two novel linearization methods are proposed and their satisfactory performances are proved for output tracking as well as stability of nonlinear dynamic system. The first method is based on the fixed linearization rate and the second one is based on the variable (optimal) linearization rate. The decoder that is based on the second method is in fact the extended Kalman filter with the optimal linearization rate. The performances of these two methods are compared with each other and the other proposed methods by implementing them to the problems of the tele‐presence and tele‐operation of autonomous vehicles over the AWGN channel. Their satisfactory performances are illustrated. It is illustrated that the second method has higher computational complexity with slightly better performance and is applicable to a larger class of reference trajectories. [ABSTRACT FROM AUTHOR]

This paper introduces the short packet transmission in non‐orthogonal multiple access (NOMA)‐based unmanned aerial vehicle (UAV) assisted relay communication system. Short packet transmission has considerable potential to decrease the transmission latency of UAV communication, and NOMA can effectively enhance the spectrum efficiency and fairness. To improve the reliability of the system, an effective packet error rate (PER) minimization problem within short packet transmission is proposed by jointly optimizing the packet length, UAV placement, and power allocation under the reliability requirement and total power constraints. To address the intricate PER minimization problem, the optimization problem is firstly decomposed into three sub‐problems, and the corresponding monotonicity and convexity are analyzed, respectively. Then, an overall iterative optimization algorithm for PER minimization based on alternating direction method of multipliers algorithm and optimal solution algorithm is formulated by solving the three sub‐problems in an iterative manner. Simulation results validate the effectiveness and convergence of the proposed NOMA scheme and overall iterative optimization algorithm, respectively. [ABSTRACT FROM AUTHOR]

In telecommunication networks, full connectivity resilience to multiple link failures is too costly as it requires a network topology with too many redundant links. Alternatively, the connectivity resilience of a telecommunications network can be improved by resorting to available third‐party networks for temporary additional connectivity until the failing links are restored. In this approach, some nodes of the network must be selected in advance to act as gateway nodes to the third‐party networks when a multiple link failure event occurs. For a given network topology and a cost associated with each node to turn it into a gateway node to each of the third‐party networks, the aim is to select the gateway nodes providing maximum connectivity resilience at minimum cost. The Gateway Node Selection is defined as a bi‐objective optimization problem such that its Pareto‐optimal solutions represent different trade‐offs between cost and connectivity resilience. In this work, the connectivity resilience is modeled by the Critical Link Detection optimization problem. An exact optimization algorithm is proposed, based on a row generation algorithm and on set cover cuts. The computational results demonstrate the effectiveness of the proposed algorithm on four well‐known telecommunication network topologies. [ABSTRACT FROM AUTHOR]

The problem of decision-making regarding the selection of the optimal composition of telecommunication network components is very urgent. The subject of the research in the article is a multi-criteria approach to the selection of telecommunication network components. This approach is related to the evaluation of possible options based on a set of indicators. The set of such indicators is determined by the specifics of a telecommunication network. One of the most dominant devices in telecommunication (mobile) systems is speech codecs. When choosing the appropriate codec configuration, there is a need to make a decision considering a set of contradicting criteria. The use of MCDM (Multiple Criteria Decision Making) methods when making decisions is a promising approach to solving such problems. The current article increases the efficiency of the multi-criteria approach to decision-making in the process of selecting telecommunication network components, in particular, a speech codec. The following methods were used: MARCOS (Measurement Alternatives and Ranking according to COmpromise Solution), entropy, CRITIC (Criteria Importance Through Inter-criteria Correlation) and BWM (Best–Worst method). The following results were obtained. Determining the weight of the criteria by which alternatives are evaluated is one of the key problems that arise when making multi-criteria decisions. Objective methods of entropy, CRITIC, and subjective BWM methods were used to find weighting factors of criteria. Different methods of determining the weights of the criteria give different values. The use of the combined BWM-CRITIC method is proposed, which balances the subjective opinions of experts and assessments made solely based on the decision matrix data. The values of the correlation coefficients showed a close relationship between the weights of the criteria determined by different methods. However, the strongest connection with other methods was shown by the combined BWM-CRITIC method. The MARCOS method was used to rank the alternatives and select the best alternative. A ranking of the set of speech codecs is obtained, which allows for determining the best alternative Conclusion. A comprehensive approach to the telecommunication network component selection is proposed, namely the multi-criteria BWM-CRITIC-MARCOS model, based on a combination of MCDM methods. The integration of methods into the proposed model provides a systematic approach to the assessment and selection of telecommunication network components.

Owing to the advantages of low cost, flexibility, and the transmission characteristics of air–ground (AG) channels, using the unmanned aerial vehicle (UAV) as mobile relay to assist wireless communication has received significant interest recently. A green non‐orthogonal multiple access (NOMA)‐based multi‐UAV‐enabled relaying system with different rate requirements is proposed here. To improve energy efficiency (EE) of the UAV relays, an optimization problem for user grouping, UAV trajectory design and resource allocation under the constraints of information causality constraint, UAVs' maximum service capacity, maximum transmit power constraint, and different communication rate requirements of the mobile users (MUs) is formulated. According to the grouping results, the UAVs' trajectory and power allocation by Dinkelbach method, successive convex approximation, and condensation algorithm are alternately optimized. To solve this highly coupled non‐linear mixed integer programming problem, a graph‐based grouping algorithm is proposed to reduce the relative distance between the UAV relay and the MU. Simulation results show that the proposed optimization algorithm can effectively improve the EE performance of this NOMA‐based multi‐UAV‐enabled relaying system. [ABSTRACT FROM AUTHOR]

Purpose: The purpose of this work is to draw future research directions on how to ease adoption of continuous delivery (CD) for business-to-business (b2b) critical infrastructure products. CD is a recognized software lifecycle management practice reducing go-to-market time, strengthening customer feedback loop, and improving product quality. Telecommunication networks, considered critical infrastructure, are sensitive to changes in delivery models. Design/methodology/approach: Literature review was performed by combining bibliometric analysis and the own model gauging telecom software vendors’ interest in shaping CD practices across the industry. Findings: The research is skewed toward engineering practices excellence. Little is spent on the customer challenges. Transformation slowdowns are attributed to product teams. Research limitations/implications: Some software vendors, especially smaller ones, may prefer not to publish the outcomes before validating them with the customers. This work looked at publicly available materials therefore not capturing the picture of internal corporate experimentation on continuous delivery. Practical implications: Scientists should seek access to customer perspective. Sales, services, and business managers may be invaluable proxies of such information. Originality/value: This work nudges the community to shift focus from R&D excellence to change management at customer interface, and to deal with CD model industrialization aspects. [ABSTRACT FROM AUTHOR]

The environmental protection and renewable energy sources are the priority of all investments around the world. The environmental monitoring systems are equipped with various sensors, devices, networks and software to collect, process, monitor and display data on the environmental parameters. In that sense, this paper discusses the automation of river water quality monitoring in the area of the "Čukaru Peki" copper mine in Serbia. Until now, the water quality in the area is being monitored by taking and analyzing the water samples in the competent laboratory. The automation would improve the quality of monitoring multiple times. At the same time, the significantly cheaper ("low cost") devices can be used. These devices are cheaper and their quality is for a specific application completely at the level of those offered on the market as commercial pnes. The problem is briefly considered in terms of costs and benefits.

The fifth‐generation (5G) technology is seen to be a solution for developing countries to improve their quality of services in terms of transportation, education, health, agriculture, and other fields, thereby holding the promises of economic transformation by improving productivity and the quality of life. The paper considers some of the challenges that face operators, investors, and providers when planning to introduce 5G technology to developing countries. The main focus of this paper is the 5G transport network, in particular, the backhaul network. The 5G transport network architectural options and scenarios are discussed based on several standards and previous studies, the problems of existing infrastructures of developing countries are investigated, and new proposed technologies that may help to address those challenges are considered. [ABSTRACT FROM AUTHOR]

The paper presents the analysis and diagnosis of cables for data transmission in telecommunications. Among these data transmission cables, the paper presents the optical cable and the UTP cable. For these cables, following the analysis and diagnosis, the defects that appeared were fixed. At the same time, the services provided through the repaired cables were also checked. [ABSTRACT FROM AUTHOR]

Rapid growth in the volume of transmitted information has lead to the emergence of new wireless networking technologies with variable heterogeneous topologies. With limited radio frequency resources, optimal routing problems arise, both at the network design stage and during its operation. We propose an algorithm based on a minimum loss intensity (greedy-gradient algorithm) to search for optimal routes of information transmission in telecommunication networks. The relevance of the developed algorithm is determined by its practical use in data-transmitting modeling systems. The proposed algorithm satisfies several requirements, such as the speed of the calculations performed, the fulfillment of the conditions for its convergence, and its independence on the selected loss probability function, as well as on the network topology. The idea of the algorithm is a step-by-step recalculation of metrics based on derivatives of the loss intensity function with simultaneous redistribution of information flows along the routes determined by the Floyd algorithm. The comparative efficiency of the proposed algorithm is demonstrated by computational experiments on various network topologies (up to 100 nodes) with various traffic intensities.

The capacitated dispersion problem, which is a variant of the maximum diversity problem, aims to determine a set of elements within a network. These elements could symbolize, for instance, facilities in a supply chain or transmission nodes in a telecommunication network. While each element typically has a bounded service capacity, in this research, we introduce a twist. The capacity of each node might be influenced by a random Bernoulli component, thereby rendering the possibility of a node having zero capacity, which is contingent upon a black box mechanism that accounts for environmental variables. Recognizing the inherent complexity and the NP-hard nature of the capacitated dispersion problem, heuristic algorithms have become indispensable for handling larger instances. In this paper, we introduce a novel approach by hybridizing a heuristic algorithm with reinforcement learning to address this intricate problem variant.

Modern telecommunication networks are comprised of a countless number of nodes exchanging data among them. In particular, multimedia traffic – composed of audio, video, and images – represents a challenging scenario requiring link optimisation techniques. The hub-and-spoke topology is frequently used to design more effective telecommunication networks. This work considers a hub-and-spoke network in which a large number of nodes are exchanging real-time multimedia data, and where the quantity of data sent from one node to another is a random variable. Given a fixed number of hubs, p , the goal is to select the best location for these p hubs in order to minimise the total expected cost of transmission. This scenario is modelled as an uncapacitated single-allocation p -hub median problem under uncertainty conditions. Additionally, with the purpose of considering the effect of transmission delays on the video signal, service quality thresholds are assigned to every potential hub in the network. Since real-life networks tend to be large in size, we propose a simheuristic algorithm to cope with this stochastic and large-scale optimisation problem. A series of computational experiments illustrate these concepts and allow for testing the performance of our simheuristic approach. Finally, a statistical analysis of the obtained results is provided. [ABSTRACT FROM AUTHOR]

The capacitated dispersion problem is a variant of the maximum diversity problem in which a set of elements in a network must be determined. These elements might represent, for instance, facilities in a logistics network or transmission devices in a telecommunication network. Usually, it is considered that each element is limited in its servicing capacity. Hence, given a set of possible locations, the capacitated dispersion problem consists of selecting a subset that maximizes the minimum distance between any pair of elements while reaching an aggregated servicing capacity. Since this servicing capacity is a highly usual constraint in real-world problems, the capacitated dispersion problem is often a more realistic approach than is the traditional maximum diversity problem. Given that the capacitated dispersion problem is an NP-hard problem, whenever large-sized instances are considered, we need to use heuristic-based algorithms to obtain high-quality solutions in reasonable computational times. Accordingly, this work proposes a multi-start biased-randomized algorithm to efficiently solve the capacitated dispersion problem. A series of computational experiments is conducted employing small-, medium-, and large-sized instances. Our results are compared with the best-known solutions reported in the literature, some of which have been proven to be optimal. Our proposed approach is proven to be highly competitive, as it achieves either optimal or near-optimal solutions and outperforms the non-optimal best-known solutions in many cases. Finally, a sensitive analysis considering different levels of the minimum aggregate capacity is performed as well to complete our study. [ABSTRACT FROM AUTHOR]

This article aims to narrate the birth and evolution of the Integrated Services Digital Network (ISDN) in Spain with an essentially descriptive methodology, from an interdisciplinary perspective and from varied sources. The study aims to investigate the forms of the transition from a conceptual or engineering phase to the market in a standard of Internet access and, at the same time, in the different patterns of technological innovation and the factors that motivate them. It tries to verify if the own nature of the techniques, the degree of diffusion of the previous technologies, the technological level -digitalization- and the structure of market of the telecommunications — continued existence of the monopoly of the historical operator National Telephone Company of Spain — had a significant impact on the inequality of penetration with respect to other countries. The research authorizes to conclude that a very heterogeneous combination of factors caused that leading countries in the diffusion of a technology did not achieve that leading role in the diffusion of other technologies.

Purpose – The main purpose of the present study was to improve and develop previously proposed models for Iran telecommunication networks. It should be noted that the six-dimensional (6D) sustainability model used in this study will be a useful and comprehensive model for industries. Since, the new dimension of IT along with the five well-known economic, social, environmental, technical and institutional aspects of organizations is considered to have great impacts on supply chain sustainability; the proposed framework can be practical. Design/methodology/approach – According to the related literature review, there are two research streams in supply chain management. The first stream is exploratory research, seeking out conceptual discussions in this area. The second one is associated with mathematical models and techniques, aiming to set decision-making rules in this regard (Agrell et al., 2004). In this study, evaluation was performed using the FMEA method as an analytical technique based on the principle of pre-occurrence prevention to identify potential failure factors in sensitive systems (Mohammadfam and Kianfari, 2008). Findings – After identifying the risks and causes of the incidence and effects and consequences of risks, preventive and risk control measures and advisory strategies were presented. Customers with 45.76% share in critical risks are threatening to maintain supply chain in these companies. During this study, it was found that 33.9% of the main source of supply chain critical risks was customers, constituting 45.76% of such risks, accompanied by organization, having a 38.88% share of critical risk generation. The study findings also revealed that 33.9% of critical risks were mainly (equally) related to economic and technical aspects of supply chain sustainability in telecommunication networks. Moreover, as a newly-introduced sixth dimension, IT represented 10.17% of critical risks threatening supply chain sustainability in such networks. Critical risks are mainly related to the economic and technical aspects (equally) with the sustainability of the telecommunication networks supply chain. Also, as a new finding and the sixth dimension, 10.17% of the critical risks that threaten the sustainability of the telecommunication networks supply chain have the information technology dimension. Originality/value – The internet and fixed and mobile data services are provided by several private companies in Iran, which are relatively similar in terms of their supply chains. In order to manage the sustainability of Iran's telecommunication supply chain, telecommunication networks affiliated to Iran Telecommunication Company (ITC), operating in the field of data and internet services and fixed telephone were selected in 31 provinces. The intended networks were also providing an important part of the country's needs including Mobile Telecommunication Company of Iran, a subsidiary of Iran's telecommunication networks, as one of the top companies in this industry. Accordingly, all the networks studied in this study needed to be identified with regard to communication sustainability risks, since they provide management solutions to each other by segregating risks. In this study, 68 managers and 72 experts participated in different work teams of telecommunication networks.

While the telegraph reached the territory of the state of Goiás (Brazil) in 1890, the first records of the installation of telephones in the state refer to the year 1914. Unlike the telegraph network, with guidance initiated by military geostrategy, the first telephone circuits emerged through much more spontaneous and punctual initiatives. The on-screen study addresses the genesis of telecommunications networks in Goiás based on the emergence of telegraph and telephone in the late nineteenth and early 20th centuries, respectively. The methodological procedures were based on meticulous work of collecting secondary data in historical documents, official publications, such as statistical yearbooks and reports on IBGE telephone companies, Telebrás Management Reports and information contained in journals published between 1842 and 1940. The results reveal the economic and geostrategic determinations that led the internalization of telecommunications networks towards the corners of Central Brazil, within the scope of the establishment of these reticular devices as indispensable elements to the system of control, appropriation, and integration of Brazilian regional diversity. [ABSTRACT FROM AUTHOR]

The article is dedicated to the analysis of the varied motivations of both internal and external players involved, regarding the involvement of Huawei in the 5G network deployment in the EU. The author emphasizes a complexity of balancing the interests of all stakeholders and considering possible negative consequences by the political elites in EU countries. A number of factors emerged during the fight against the coronavirus pandemic, which may affect future decisions of the EU countries, are highlighted. The author raises a question about the possibility of a constructive dialogue on sensitive topics, including the issue under consideration, in the context of ongoing information warfare. It is suggested that large EU countries will follow the path of «compromise solutions», minimizing possible security risks and at the same time not excluding Huawei from the list of possible suppliers.

TCP provides the principal framework for the Internet traffic control. Following the protocol development, however, the communicating parties have not benefitted from the potential of multiple interfaces, now commonly installed at the end-point devices. In order to grasp new opportunities, a multipath version of TCP—multipath TCP (MPTCP)—has recently been introduced. It permits the simultaneous use of a few, diverse interfaces for enhancing the user experience. This article provides a discrete-time model of the data exchange process in the MPTCP framework and new flow control algorithms. The algorithms, applicable to the paths with nonhomogenous properties with respect to delays, loss rate, etc., are designed following the rules of discrete sliding-mode control (DSMC). As a result, direct implementation in discrete networking context and robust transmission system performance are guaranteed in uncertain operating conditions. It is formally demonstrated that a finite data queue length in the end-point buffers and a feasible (non-negative and bounded) input signal are ensured despite input and output perturbations affecting the control process. It is also shown that the classical DSMC design approach results in decreased performance for unanticipated surge in the intensity of network-related perturbations. A second, improved algorithm, with a well-chosen sliding variable, eliminates this drawback. [ABSTRACT FROM AUTHOR]

In the article the method of construction of data transmission routes is developed by choosing metrics of data parameters taking into account the specific features of the use of special purpose networks. The novelty of the method is the introduction of the hierarchy of the decision making process on the construction of a data transmission route in order to provide a given quality of service for certain types of traffic under different conditions of the functioning of telecommunication networks using the hybrid structure of the method construction. The method allows you to build routes of a given quality, reduce the volume of service traffic, increase the throughput of the information direction while reducing the complexity of constructing the method. The purpose of this article is to analyze the use of hybrid route construction in telecommunication networks. The authors consider the approach to using the method in telecommunication networks of special purpose, which will increase the efficiency of construction of data transmission paths of the nodal control system in telecommunication networks of military designation. The use of these methods makes students think independently, seek information, find the right answers to questions that arise. At the end, formulated directions for further research on implementation of the ks-method

The capacitated dispersion problem is a variant of the maximum diversity problem in which a set of elements in a network must be determined. These elements might represent, for instance, facilities in a logistics network or transmission devices in a telecommunication network. Usually, it is considered that each element is limited in its servicing capacity. Hence, given a set of possible locations, the capacitated dispersion problem consists of selecting a subset that maximizes the minimum distance between any pair of elements while reaching an aggregated servicing capacity. Since this servicing capacity is a highly usual constraint in real-world problems, the capacitated dispersion problem is often a more realistic approach than is the traditional maximum diversity problem. Given that the capacitated dispersion problem is an NP-hard problem, whenever large-sized instances are considered, we need to use heuristic-based algorithms to obtain high-quality solutions in reasonable computational times. Accordingly, this work proposes a multi-start biased-randomized algorithm to efficiently solve the capacitated dispersion problem. A series of computational experiments is conducted employing small-, medium-, and large-sized instances. Our results are compared with the best-known solutions reported in the literature, some of which have been proven to be optimal. Our proposed approach is proven to be highly competitive, as it achieves either optimal or near-optimal solutions and outperforms the non-optimal best-known solutions in many cases. Finally, a sensitive analysis considering different levels of the minimum aggregate capacity is performed as well to complete our study.

Cyber‐Physical Systems (CPS) and Internet‐of‐Things (IoT) plus energy are the enabling technology of modern power systems also known as the Smart Grid (SG). A SG may consist of thousands of interconnected components communicating and exchanging data across layers that stretch beyond technical capabilities, for instance, markets and customer interactions. Cyber‐physical security is a major source of concern due to the high reliance of the SG on Information and Communication Technologies (ICT) and their widespread use. Addressing security requires developing modeling and simulation tools that approximate and replicate adversarial behavior in the SG. These tools have in fact two simulators, one handling continuous power flows and another for capturing the discrete behavior when communicating across CPS or IoT components. The technique of composing two models of computation in a global simulation of these coupled systems is called co‐simulation. Although there are many frameworks and tools for co‐simulation, the set of features for modeling cyber‐physical security incidents in the SG lacks thorough understanding. We present a systematic review of features and tools for co‐simulating these concerns in CPS. We also highlight and discuss research gaps with respect to the most used tools in industry and academia and comment on their relevant features. [ABSTRACT FROM AUTHOR]

The rapid growth of digital services has led to a widespread deployment of opto‐electronics that furnish the Internet as an efficient communication backbone. The electroabsorption‐modulated laser (EML) is a representative example of a monolithic integrated electro‐optic converter that has early become a commodity: it has been widely adopted in telecommunication networks in virtue of its cost‐ and energy‐efficient light generation and modulation. This study reviews the state‐of‐the‐art of EML applications. Despite its simplicity, the EML addresses numerous use cases that require either the transmission or the reception of optical signals, such as equaliser‐free high‐bandwidth intensity modulation/direct‐detection links at low signal drive, analogue signal transmission with high signal integrity, spectral sculpting for dispersion‐tolerant transmission and vector modulation. Full‐duplex transceiver functionality in lieu of a pair of dedicated half‐duplex sub‐systems is eventually attained by combining transmission and reception. This strategy of significantly reducing the cost for a bidirectional communication engine will be discussed for coherent digital data and analogue radio‐over‐fibre transmission and optical ranging. The maturity of EMLs as coherent transceivers will be evidenced by a small penalty for realising full‐duplex transmission and the accomplishment of homodyne detection, which obviates digital signal processing for the purpose of signal recovery. [ABSTRACT FROM AUTHOR]

5G networks will provide opportunities for the creation of new services, for new business models, and for new players to enter the mobile market. The networks will support efficient and cost-effective launch of a multitude of services, tailored for different vertical markets having varying service and security requirements, and involving a large number of actors. Key technology concepts are network slicing and network softwarization, including network function virtualization and software-defined networking. The presented security architecture builds upon concepts from the 3G and 4G security architectures but extends and enhances them to cover the new 5G environment. It comprises a toolbox for security relevant modeling of the systems, a set of security design principles, and a set of security functions and mechanisms to implement the security controls needed to achieve stated security objectives. In a smart city use case setting, we illustrate its utility; we examine the high-level security aspects stemming from the deployment of a large number of IoT devices and network softwarization.

This paper studies a telecommunication network design problem. In this network, users must be connected to capacitated hubs. Then, hubs that concentrate users must be connected to each other and possibly to other hubs with no users. The connections in the network must lead to a tree topology. Hence, connection between hubs can be considered as looking for forming a Steiner tree. This problem is modeled as a bi-objective mathematical programming problem. One objective function minimizes user's latency with respect to the information packages flowing through the capacitated hubs, and the other objective function aims the minimization of the total network's connection cost. To approximate the Pareto front of this bi-objective problem, a co-evolutionary algorithm is developed. In the proposed algorithm, two populations are considered. Each population is associated with one objective function. The co-evolutionary operator consists of an information exchange between both populations that occurs after the genetic operators have been applied. As a result of this co-evolutionary operator, the non-dominated solutions are identified. Computational experimentation shows that the approximated Pareto fronts are representative despite their non-convexity, and they contain a sufficient number of non-dominated solutions over the tested instances. Also, the kth distance among non-dominated solutions is relatively small, which indicates that the approximated Pareto fronts are dense. Furthermore, the required computational time is very small for a problem with the characteristics herein considered. [ABSTRACT FROM AUTHOR]

Copyright of Science-Based Technologies is the property of National Aviation University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)