Migrating to IPv6: A game-theoretic perspective

Software defined networking (SDN) and network function virtualization have emerged as a promising solution for elastic, dynamic, and scalable network management. A collection of works have investigated how virtualization and cloud technology can ameliorate the infrastructure management for the fifth generation mobile network. However, employing these techniques in mobile network for live streaming has not received enough attention. By leveraging the development of SDN and virtualization techniques, mobile live streaming service providers can efficiently manage their system to cope with network dynamics incurred by the variation of the environment. Specifically, we dynamically instantiate network entities at appropriate locations in response to the user live streaming demands. These network entities are in charge of transcoding and transmitting the live videos to the mobile end users, which we name as virtual live streaming agent (vLA). In this paper, we investigate the dynamic virtualization and migration of vLAs for mobile live streaming services. Typically, rate adaptive streaming is adopted to improve spectrum efficiency and user quality of experience. We formulate an integer linear program for the optimal vLA placement problem. Furthermore, we design a practical SDN-based live vLA migration process. Then, by designing and integrating migration cost functions, we develop a dynamic vLA placement mechanism for dynamic environments with the consideration of migration cost. Both heuristic and on-line algorithms are designed for the vLA placement and migration problems. Finally, a large scale real trace-based simulation is conducted to demonstrate the performance of our vLA placement and migration algorithms.

The purpose of this article is to demonstrate the importance of control over migration flows, especially from countries with different religions and ways of life. France was chosen as the object, being the most striking example of the growing problems with Muslim migration. The methods used in the article were socio-cultural and discourse analysis. The dynamics of Muslim migration to France, the process of emergence and accumulation of problems with adaptation and integration of the Muslim minority, sometimes developing into outbreaks of conflicts with the host community, the state's approaches to solving the issue under consideration, problems specific to France, the current situation is analysed and possible approaches to solving the problem are named. The result of the study was the analysis of a large volume of literature and sources on the issue of Muslim migration to France, the current state of affairs with integration, security, as well as the domestic political situation in the country. The following conclusions were made: control over migration, especially of other ethnic groups, is the most important task of the state, since the violation of the cultural balance leads to serious destabilization with possible grave consequences. It is also shown that the most important tasks are the cultural adaptation of migrants (proficiency in the language of the host country, loyalty to local customs and legislation) and integration (creation of a favourable environment while simultaneously blocking marginalization). The theoretical significance of the work consists in demonstrating the development of the problem, the stages of the state's response to the emerging situation, reflecting the key points of view on the problems of migration and integration in the course of scientific discourse of famous theorists in this area. The practical significance of the work is determined by the extreme importance of the issue under consideration, since the problem of migration and integration of Muslim minorities is urgent for all countries of the Northern Hemisphere.

We study the problem of virtual machine (VM) placement and migration in a data center. In the current approaches, VMs are assigned to physical servers using on-demand provisioning. Such an approach is simple but it often results in a poor performance due to resource fragmentation. Additionally, sub-optimal VM placement usually generates unneeded VM migration and unnecessary cross network traffic. The efficiency of a datacenter therefore significantly depends on how VMs are provisioned and where they are placed. A good placement scheme will not only improve the quality of service but also reduce the operation cost of the data center. In this paper, we study the problem of optimal VM placement and migration to minimize resource usage and power consumption in a data center. We formulate the optimization problem as a joint multiple objective function and solve it by leveraging the framework of convex optimization. Due to the intractable nature of the combinatorial optimization, we then propose Multi-level Join VM Placement and Migration (MJPM) algorithms based on the relaxed convex optimization framework to approximate the optimal solution. The theoretical analysis demonstrates the effectiveness of our proposed algorithms that substantially increases data center efficiency. In addition, our extensive simulation results on different practical topologies show significant performance improvement over the existing approaches.

Wireless sensor systems have drawn much attention from a considerable part of scientific community during the last years. The advances in this field range from the design of battery-powered embedded nodes to the development of software (i.e. operating system, middleware, etc) especially designed to run on such resource-constrained devices. One of the most challenging parts for both hardware and software oriented work is to maximize the lifetime of such nodes. This thesis focuses on the design and implementation of mobile code placement and migration algorithms for distributed applications in order to reduce the amount of application-level communication performed over the network. Since the largest part of a node’s energy expenditure is attributed to the wireless communication (not code execution), reducing the energy consumption becomes of paramount importance, leading in that way to an increased system lifetime. In the sequel, we give a brief overview of the application model, the algorithms and the middleware designed and implemented in the context of this thesis. The model adopted in this work is inspired by the POBICOS [91] platform, where the application is organized as a set of software entities (agents) that communicate with each other to implement the desired functionality. An agent can be ―non-generic? or ―generic?. Non-generic agents use special resources of a node, e.g. a sensor measuring a physical quantity or an actuator controlling a device or function. On the contrary, generic agents perform computational tasks and decision making at a higher level, without relying on special resources. Chapter 1 introduces the agent migration problem stated as follows: given an application that is deployed in a sensor network, perform generic agent migrations in order to reduce the data exchanged over the network due to the application-level communication between agents. We propose fully distributed algorithms that migrate an agent towards its center of gravity (in terms of communication load), thereby reducing the network cost. Also, two protocols are presented for handling the case of nodes with storage constraints (for hosting agents). iv Chapter 2 examines the same (above) problem, with the difference that it considers migrations of agent groups instead of single agent migrations. The algorithms in question deal with co-located agents that are ―mutually dependent?, which in the case of the simpler algorithms may hinder migration, leading to noticeably inferior placements. Chapter 3 discusses the competitiveness of the aforementioned algorithms versus the optimal algorithm. Also, it presents an enhancement of the group migration algorithms in order for them to produce an optimal agent placement (in terms of the network cost incurred by the application). It should be stressed that this enhancement guarantees optimality only if nodes do not have storage constraints, else the problem is NP-complete. Chapter 4 proposes fully distributed algorithms for the problem of generic agent migrations for resource-constrained nodes, introducing the concept of ―evictions?. Specifically, agent migrations are considered that are not beneficial in their own right but free space which can be used to perform additional (beneficial) migrations. Of course, the ultimate goal is to reduce the network load, so the total benefit of the migrations must be greater than the cost of the non-beneficial ones. In Chapter 5 we focus on the problem that the aforementioned algorithms are not able to ―guess? whether a (group) migration will turn out to actually reduce the network cost. They simply assume that the structure and communication pattern of the application remains stable for a ―sufficiently? long time, so as to amortize the migration cost. As a consequence, frequent changes in the application-level load may lead to frequent agent migrations, thereby increasing the network cost (instead of reducing it). For example, an agent may continuously ―oscillate? between two nodes due to periodic changes of the communication load with other agents (changing its center of gravity), before the respective migration cost is amortized. For this reason, we propose online algorithms, along with a discussion of their competitiveness versus the offline optimal algorithm. In Chapters 6 and 7 we propose centralized algorithms tackling more complex problems. Specifically, chapter 6 addresses the problem of reducing the network cost through migrations of both generic and non-generic agents, considering that the nodes of the system have storage capacity limitations. The proposed algorithms use graph coloring techniques. In Chapter 7, a two-dimensional problem is considered, the objectives being: (a) to maximize the number of agents hosted by the nodes of the system; and (b) to maximize the network lifetime (maximize the lifetime of the first node that depletes its battery). We propose algorithms solving each dimension (sequentially) in an independent way, along with a branch-and-bound algorithm v tackling the problem concurrently in both dimensions. Regarding the first dimension of the problem, a considerable part of the algorithms involves the de-fragmentation of the nodes’ storage capacity, through agent migrations. Chapter 8 describes the implementation of the component of the POBICOS middleware that provides full-fledged, distributed, agent management functionality, on top of the TinyOS embedded operating system. Specifically, we describe: i) the mechanism for creating agents on eligible nodes; ii) the mechanism for transporting agent-level messages; iii) the mechanism detecting and destroying ―orphan? agents; and iv) the mechanism for the migration of generic agents with full transparency for the application. Finally, Chapter 9 discusses works related to this thesis, while Chapter 10 includes an overview of this dissertation and future directions.

Network Function Virtualization (NFV) enables flexible deployment of network services as applications. Network operators expect to use a limited number of Network Function (NF) instances to handle the fluctuating traffic load and provide network services. However, it is a big challenge to guarantee the Quality of Service (QoS) under the unpredictable network traffic while minimizing the processing resources. One typical solution is to realize NF scale-out, scale-in and load balancing by elastically migrating the related traffic flows with SoftwareDefined Networking (SDN). However, it is difficult to optimally migrate flows since many real-time statuses of NF instances should be considered to make accurate decisions. In this paper, we propose DeepMigration to solve the problem by efficiently and dynamically migrating traffic flows among different NF instances. DeepMigration is a Deep Reinforcement Learning (DRL)-based solution coupled with Graph Neural Network (GNN). By taking advantages of the graph-based relationship deduction ability from our customized GNN and the self-evolution ability from the experience training of DRL, DeepMigration can accurately model the cost (e.g., migration latency) and the benefit (e.g., reducing the number of NF instances) of flow migration among different NF instances and generate dynamic and effective flow migration policies to improve the QoS. Experiment results show that DeepMigration requires less migration cost and saves up to 71.6{%} of the computation time than existing solutions.

Maximizing the number of virtual infrastructures spawned out of a data center is a prime concern of cloud service providers to improve their revenue and the customers' quality-of-experience. Optimal placement of topology sensitive virtual data centers on its physical counterparts increases the resource utilization and thereby the revenue. However, provisioning, scaling, and de-provisioning of virtual data centers, over the time, leaves the cloud data center fragmented. Embedding new virtual data centers on a fragmented data center would require migration of virtual machines and virtual network, already mapped to it. However, these migrations are costly in terms of the resource usage and possible violations of the terms of service level agreement. The costs of these migrations associated with a new embedding should be controlled to increase the profit. In this paper, the problem of finding virtual machine migrations with minimum cost is formally defined and two meta-heuristic solutions are proposed for it. We consider the memory size, the rate of page dirtying, the class of application running on the VM, and the bandwidth of the migration path for modeling the cost of migration. The objective is to find a pattern of virtual machine migrations so that the total cost for embedding a new virtual data center is minimized. Experimental results show that the proposed technique can reduce the average migration time upto 30% and the penalty for corresponding service level agreement violation by 200%.

In this paper a ring based network design tool is described. The tool supports semi-automatic design of SDH ring based network with Ethernet over SDH capability. A need for specialized network optimization and design tools is always a hot topic among network professionals. Today telecommunication networks have very complex structure due to simultaneous deployment of different network technologies and classical layered network architecture is not applicable in realistic scenarios that are common today.

Organisations frequently deploy a range of new or improved technologies in order to improve their performance (efficiency and effectiveness). However, the literature has thus far primarily investigated Information Technology (IT) deployment issues and success factors, which may not be relevant or sufficient in the context of other technology types. Moreover, the literature usually discusses high-level success factors without identifying relevant low-level activities and their interdependencies. Specific guidance on how such activities may best be arranged in a process model is also lacking. Based on a one-year-long ethnographic study and one in-depth case study in the Australian Defence Organisation, this paper presents a normative technology-neutral process model comprising 61 activities thought to be necessary and sufficient for effective technology deployment.

Efficient service reconfiguration with partial virtual network function migration

DSMLB: Dynamic switch-migration based load balancing for software-defined IoT network

The efficient migration of virtual machines (VMs) is critical for optimizing resource management, ensuring service continuity, and enhancing resiliency in cloud and edge computing environments, particularly as 6G networks demand higher reliability and lower latency. This study addresses the challenges of dynamically balancing server loads while minimizing downtime and migration costs under stochastic task arrivals and variable processing times. We propose a queuing theory-based model employing continuous-time Markov chains (CTMCs) to capture the interplay between VM migration decisions, server resource constraints, and task processing dynamics. The model incorporates two migration policies—one minimizing projected post-migration server utilization and another prioritizing current utilization—to evaluate their impact on system performance. The numerical results show that the blocking probability for the first VM for Policy 1 is 2.1% times lower than for Policy 2 and the same metric for the second VM is 4.7%. The average server’s resource utilization increased up to 11.96%. The framework’s adaptability to diverse server–VM configurations and stochastic demands demonstrates its applicability to real-world cloud systems. These results highlight predictive resource allocation’s role in dynamic environments. Furthermore, the study lays the groundwork for extending this framework to multi-access edge computing (MEC) environments, which are integral to 6G networks.

The importance of file migration is increasing because of its potential to improve the performance of distributed office, manufacturing and hospital information systems. To encourage research in the file migration problem, the authors summarize accomplishments of researchers of the problem, provide a detailed comparison of file migration and dynamic file allocation problems, and identify important areas of research to support the development of effective file migration policies.

Due to the growth of migration flows, border areas and cities are among the first to experience the effects of globalization and integration. Cross-border migration and tourism mobility are considered modern challenges affecting small border cities. At the same time, host community often takes opposite positions in relation to these challenges: stimulating tourism and restricting migration. The increased dynamics of cross-border migration brings changes, sometimes significant, to the development of the social and cultural environment of small border cities. Thus, the experience of Tornio city that struggled with the increased number of visitors from Africa and Asia demonstrates a growing society fragmentation and the emergence of cultural identity crisis. The Finnish cities bordering Russia make profit from cross-border mobility, stimulating the development of shopping tourism. The problem of cross-border migration is illustrated by small border cities in Finland. The empirical data is based on the sociological survey conducted in August - September 2016 in Tornio as well as the results of the authors’ own observations.

With the development of embedded devices and in-depth research and extensive application of networking technology, smart objects and types, increasing the number of networking devices continue to be popular in the people's daily lives. Development of digital and network technologies enables the controller node, sensor nodes, radio frequency identification, and household appliances such as television, air-conditioning equipment can use the Internet protocol, wireless communication protocol to achieve information transmission and exchange. Things technology triggered a new wave of the information industry, and unlimited commercial value. Things study based on real significance of architecture and key technologies of Web applications is very important. Introduction With the popularity of Internet technology and embedded devices deployed a large number of research and development, make the amount and type of smart objects are in constant growth, equipment and systems in use in people's everyday life is becoming more and more popular. The evolution of network technology, also makes the sensor nodes, the controller node, RFID, and some electrical appliances (TV, alarm clock, acoustics, air conditioning, etc.) through wireless communication protocol and the Internet network interconnection and information exchange. The digital and networked intelligent devices are widely used in smart home, intelligent logistics, intelligent transportation and intelligent agriculture and other fields, has a huge commercial value. The Internet of things is, as it were, following computer, Internet and mobile communications technology triggered a wave of information industry of core areas, the developed countries to carry out the layout in the field of Internet of things. With the Internet of Things to promote research and development and deployment of technology and a lot of embedded devices, the number and type of smart objects in the growing networking equipment and systems used in people's daily lives are becoming increasingly popular. Situation of Things application development but due Things equipment, high coupling and poor scalability issues, divisive, the threshold is high, long development cycle [1]. According to the background and problems, we propose a Web services environment (WoTSE). Its core idea is a variety of equipment resources seamless access to the Internet of Things, in the form of Web pages open, so the integration of heterogeneous networking equipment, reduce application development difficulty and networking technology, while ensuring that the system of distributed Features loose coupling and large-scale deployment [2]. The technology architecture of Internet of things Internet of things have full perception, reliable transmission and can only process characteristics. Due to the integration of many things now appear in the latest technology, so I do not like the Internet, by the International Organization for Standardization clear hierarchy model. But the Internet also has its own hierarchy, the Internet is recognized technical architecture is divided into three layers, top to bottom are things perception layer, the network layer of the Internet of things application layer [3-4], as shown in Figure 1.

Dynamic replication and migration of data objects with hot-spot and cold-spot statuses across storage data centers