A Multidomain Survivable Virtual Network Mapping Algorithm

Abstract

Although the existing networks are more often deployed in the multidomain environment, most of existing researches focus on single-domain networks and there are no appropriate solutions for the multidomain virtual network mapping problem. In fact, most studies assume that the underlying network can operate without any interruption. However, physical networks cannot ensure the normal provision of network services for external reasons and traditional single-domain networks have difficulties to meet user needs, especially for the high security requirements of the network transmission. In order to solve the above problems, this paper proposes a survivable virtual network mapping algorithm (IntD-GRC-SVNE) that implements multidomain mapping in network virtualization. IntD-GRC-SVNE maps the virtual communication networks onto different domain networks and provides backup resources for virtual links which improve the survivability of the special networks. Simulation results show that IntD-GRC-SVNE can not only improve the survivability of multidomain communications network but also render the network load more balanced and greatly improve the network acceptance rate due to employment of GRC (global resource capacity).

A game‐theoretic approach of mixing different qualities of coins

“…Meanwhile, this rule also limits the participants to mix coins, reducing the occurrence of illegal crimes. (2) This paper assumes that the coins of the participant A are not all good, while the participant B's coins are all good. The participant A applies for mixing coins and submits a deposit to the smart contract to protect the rights of the participant B.…”

“…The mixing coins process between participants is shown in Figure 1. In the haircut policy, the incomes of A and B are presented in Equations (1) and (2).…”

“…The technology of mixing coins can set up a random map between current accounts and new accounts such that anonymity is established protecting the privacy of the accounts, which have wide applications. [1][2][3] The basic rationale is as follows: the input and output of the account are isolated to confuse the accounts. Therefore, it's hard to trace the address of the accounts.…”

“…Our paper draws on the ideas initially set out in the work of Abramova et al, 10 which presents two stylized models of mixing with perfect and imperfect information and analyzes the feasibility of the two models through game theory. It is also inspired by the introduction of blacklists and the use of three blacklisting policies 2,20 …”

A Virtual Network Resource Allocation Model Based on Dynamic Resource Pricing

“…As an important technology of information networks, VN allocation technology includes two specific types of resource allocation methods: static resource allocation and dynamic resource allocation. The typical static network allocation method allocates users sufficient resources to meet their peak requirement, ignoring the limited number of resources or other issues [20][21][22][23]. There are many literatures that used different strategies to improve resource utilization, including sub-graph isomorphism [24], path splitting and migration [25], topology-aware node ranking [26] or other heuristics [27][28][29].…”