Inter-domain cooperation caching method based on Lagrange dual decomposition and Nash bargaining game

Abstract

The invention discloses a cooperative caching method between Internet autonomous systems based on Lagrange dual decomposition and Nash bargaining game, and the method comprises the following steps: setting a negotiation proxy server in each access network autonomous system in an SINET architecture, and negotiating shadow prices of service caching between the negotiation proxy servers; constructing an optimization function for maximizing the cache revenue of the autonomous system by adopting an economics model, constructing a cooperative cache problem through a Nash bargaining game model, decomposing an original problem into a plurality of sub-optimization problems through a Lagrange dual decomposition technology, and enabling a negotiation proxy server of each access network to solve the sub-optimization problems in a distributed manner; through multi-round negotiation and calculation, obtaining a service caching scheme meeting fairness and Pareto optimum.

Description

technical field [0001] The invention relates to a caching method among autonomous domains in a SINET framework, more particularly, an inter-domain cooperative caching method based on Lagrangian dual decomposition and Nash bargaining game. Background technique [0002] With the introduction of the concept of Information-Centric Network (Information-Centric Network), more and more future network architectures incorporate "network internal cache" into the basic capabilities of the network. The "network internal cache" in the Smart Identifier Network (SINET) architecture can help an autonomous system (Autonomous System, AS, or autonomous domain) reduce redundant transmission of service data and reduce inter-domain traffic. However, most of the existing technologies focus on designing the cache decision algorithm within a single autonomous system. Each autonomous system selfishly decides the local cache service (service) based on the local cache capacity, service popularity, serv...

AI Technical Summary

Problems solved by technology

[0006] In order to solve the problems of low cache efficiency and high redundancy caused by the selfish decision of cache services between autonomous systems in the existing SINET architecture, the present invention proposes an Internet autonomous system based on Lagrangian dual decomposition and Nash bargaining game cooperative caching method

[0007] The method of the present invention solves the problems of cache redundancy and low cache efficiency caused by selfish decision cache services between Internet autonomous systems

Images