The effectiveness of cybersecurity research for SCADA systems depends on access to high-quality network traffic data, yet such data remains scarce due to proprietary restrictions and security concerns. Synthetic data generated by machine learning models, particularly Generative Adversarial Networks (GANs), presents a promising alternative. This study provides a preliminary evaluation of GAN-based approaches for SCADA network traffic synthesis using the IEEE ITACHA DNP3 Smart Grid dataset. We compare a general-purpose GAN (CTGAN) with a network-traffic-specific GAN (NetShare) based on fidelity and statistical consistency. Initial results indicate that CTGAN generates statistically diverse synthetic data, while NetShare suffers from excessive duplication, limiting its applicability. These findings offer an early structured roadmap for selecting and refining generative models for SCADA data synthesis, supporting future research in smart grid security.

Digital marketplaces were created recently to accelerate the delivery of applications and services to customers. Their appealing feature is to activate and dynamize the demand, supply, and development of digital goods, applications, or services. By being an intermediary between producer and consumer, the primary business model for a marketplace is to charge the producer with a commission on the amount paid by the consumer. However, most of the time, the commission is dictated by the marketplace facilitator itself and creates an imbalance in value distribution, where producer and consumer sides suffer monetarily. In order to eliminate the need for a centralized entity between the producer and consumer, a blockchain-based decentralized digital marketplace concept was introduced. It provides marketplace actors with the tools to perform business transactions in a trusted manner and without the need for an intermediary. In this work, we provide a survey on Telecommunication Services Marketplaces (TSMs) which employ blockchain technology as the main trust enabling entity in order to avoid any intermediaries. We provide an overview of scientific and industrial proposals on the blockchain-based online digital marketplaces at large, and TSMs in particular. We consider in this study the notion oftelecommunication servicesas any service enabling the capability for information transfer and, increasingly, information processing provided to a group of users by a telecommunications system. We discuss the main standardization activities around the concepts of TSMs and provide particular use-cases for the TSM business transactions such as SLA settlement. Also, we provide insights into the main foundational services provided by the TSM, as well as a survey of the scientific and industrial proposals for such services. Finally, a prospect for future developments is given.

The use of data is essential for the capabilities of Data-driven Artificial intelligence (AI), Deep Learning and Big Data analysis techniques. This data usage, however, raises intrinsically the concerns on data privacy. In addition, supporting collaborative development of AI applications across organisations has become a major need in AI system design. Digital Rights Management (DRM) is required to protect intellectual property in such collaboration. As a consequence of DRM, privacy threats and privacy-enforcing mechanisms will interact with each other.

The Internet video sharing services have been gaining importance and increasing their share in the multimedia market. In order to compete effectively and provide broadcast television with a comparable level of quality, the Internet video should fulfil stringent quality of service (QoS) constraints. However, as the Internet video is based on packet transmission, it is influenced by delays, transmission errors, data losses and bandwidth limitations which can have a devastating influence on the perceived quality of the multimedia content. There are many works which describe the impact of network impairments on the Internet video. Nevertheless, little is known about how network conditions influence the video streamed by the currently popular services such as YouTube, where video is transmitted over reliable TCP/HTTP protocols. Therefore using a network simulator, we conducted an experimental evaluation of the HTTP based video transmission analysing how the network impairments mentioned above influence the streamed video. The experiments were validated against a network emulator supplied with real network traces. As a result of this work, we can state that the buffering strategies implemented by a video player are in many cases able to mitigate unfavourable network conditions what allow to play the streamed video smoothly. The results may serve Internet Service Providers so that they could tune their network characteristics in order to match the demand from HTTP video.

Recent developments in network science will facilitate the Internet as we know it today to integrate existing and upcoming technologies into a heterogeneous and highly dynamic resource pool. This enables the design of new applications and services which will form the Future Internet (FI). From this, many interesting prospects and unknown flexibility in terms of resource usage arise. In order to achieve this flexibility and make it usable for Service Providers (SPs) a key concept of the FI will be Virtual Networks (VNs) embedded into this resource pool. Furthermore, Federation which includes a closer interaction, resource sharing, and information exchange between providers will be an enabler for this freedom of design. This allows the operation of heterogeneous and divergent services on the same physical infrastructure substrate. It is clear to see that all these upcoming possibilities offer new areas of research. In this work we structure the parameters required to describe resources and services accurately. Furthermore, we summarize research questions that need to be resolved in order to make the FI a story of success.

The complexity of today's computer networks requires highly trained professionals to verify the end-to-end connectivity between two communication partners. The concept of autonomic networks has been proposed in an effort to make such networks easier to manage. In this context, we present a plug-and-play mechanism to check the connectivity between two end points of the network. It will significantly decrease the amount of mundane work, which is usually involved in such a task. The main goals of our work are to autonomically set-up the measurement environment, to capture the current conditions between the two communication partners and to visualize the results in an easy-to-interpret way.

The performance of peer-to-peer (P2P) content distribution networks depends highly on the coordination of the peers. Sophisticated cooperation strategies, such as the multiple source download, are the foundation for efficient file exchange. The detailed performance of the strategies are determined by the peer characteristics and the peer behaviour, such as the number of parallel upload connections, the selfishness, or the altruistic re-distribution of data. The purpose of this work is to evaluate and investigate different cooperation strategies for multiple source download and select the best one for a scenario for even leeching peers, i.e. peers which depart as soon as they have finished their download. The question arises whether the cooperation strategy can smoothen the overall performance degradation caused by a selfish peer behaviour. As performance indicator the evolution of the numbers of copies of a chunk and the experienced download times of files is applied. The considered scenarios comprise best-case (altruistic peers) and worst-case scenarios (selfish peers). We further propose a new cooperation strategy to improve the file transfer even when mainly selfish peers are present, the CygPriM (cyclic priority masking) strategy. The strategy allows an efficient P2P based content distribution using ordered chunk delivery with only local information available at a peer

Vertical handovers (VHO) are expected to be a key feature in Beyond 3G (B3G) networks. This paper presents a CAN-based P2P overlay network for supporting vertical handover in B3G networks. The P2P overlay is used to quickly locate attachment points (APs) for mobile entities and to retrieve rapidly the configuration and coverage information of these APs. The advantage of the P2P-based solution is its distributed nature, its scalability, and its self-organizing capability. We show by means of simulation the efficiency and the scalability of our approach in comparison to a standard CAN implementation

Vertical handovers (VHO) are expected to be a key feature in beyond 3G (B3G) networks. This paper presents and evaluates a Pastry-based P2P overlay network for supporting vertical handover in B3G networks. The P2P overlay is used to quickly locate attachment points (APs) for mobile entities and to retrieve rapidly the configuration and coverage information of these APs. The advantage of the P2P-based solution is its distributed nature, its scalability, and its self-organizing capability. The performance of the P2P-based VHO support architecture is evaluated in terms of the search time for APs, the scalability of the algorithm, and for homogenous and heterogeneous network layouts. In addition, the solution is compared with the conventional client-server approach

Peer-to-peer (P2P) file-sharing has become a major application in the Internet with respect to traffic volume which is even surpassing Web usage. This characteristic makes P2P commercially attractive to network operators interested in increased traffic. In parallel, the demand for wireless services has caused wireless networks to grow enormously. We assume that P2P file-sharing will be mapped onto mobile environments by its users. This results in a mobile P2P file-sharing service, which we denote as mobile P2P. In this paper, we examine the feasibility of the eDonkey file-sharing service in GPRS networks, detect problems of the interaction between P2P and the mobile network, and find solutions to overcome them. Furthermore, this paper measures and analyzes the characteristics of mobile P2P and gives first empirical performance values. Summarizing, the goal is the analysis of feasibility for an Internet-based file-sharing application in a mobile network and to provide first measurements from two real-world networks.

We propose an application-level active networking-based architecture using modular "active proxylets" for managing peer-to-peer (p2p) services. The approach combines application-level and network-level performance control.

This paper presents a demand-based engineering method for designing radio networks of cellular mobile communication systems. The proposed procedure is based on a forward-engineering method, the integrated approach to cellular network planning and is facilitated by the application of a new discrete population model for the traffic description, the demand node concept. The use of the concept enables the formulation of the transmitter locating task as a maximal coverage location problem (MCLP), which is well known in economics for modeling and solving facility location problems. For the network optimization task, we introduced the set cover base station positioning algorithm (SCBPA), which is based on a greedy heuristic for solving the MCLP problem. Furthermore, we present the planning tool prototype ICEPT (Integrated Cellular network Planning Tool), which is based on these ideas and show a first result from a real world planning case.

This paper presents a new method for the estimation and characterization of the expected teletraffic in mobile communication networks. The method considers the teletraffic from the network viewpoint. The traffic estimation is based on the geographic traffic model, which obeys the geographical and demographical factors for the demand for mobile communication services. For the spatial teletraffic characterization, a novel representation technique is introduced which uses the notion of discrete demand nodes. We show how the information in geographical information systems can be used to estimate the teletraffic demand in an early phase of the network design process. Additionally, we outline how the discrete demand node representation facilitates the application of demand-based automatic mobile network design algorithms.