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

A Nash bargaining and dual technology, applied in the field of inter-domain cooperative cache based on Lagrangian dual decomposition and Nash bargaining game, can solve the problems of low cache efficiency, low cache efficiency, cache redundancy, etc., to reduce transmission costs, Good privacy and guaranteed fairness

Active Publication Date: 2021-11-09
BEIHANG UNIV
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

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 L

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Inter-domain cooperation caching method based on Lagrange dual decomposition and Nash bargaining game
  • Inter-domain cooperation caching method based on Lagrange dual decomposition and Nash bargaining game
  • Inter-domain cooperation caching method based on Lagrange dual decomposition and Nash bargaining game

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0142] Example 1

[0143] The inventive method is to use python development language, using as CPLEX optimization problem solver, simulation environment for Ubuntu12.04 operating system, CPU is Intel Core i7-8750, memory 16GB.

[0144] Whether the cooperation in different caches and cooperation between autonomous systems access network, can be summarized in three different scenarios caching strategy: Local optimal caching strategies (Local Optimal Caching strategy, LOC), the global optimum caching policy (Global Optimal caching strategy, GOC), and the present invention is proposed based on fair cooperation caching strategies Lagrangian decomposition and cooperative game (fair cooperative caching strategy, FC). Following their cache earnings were introduced.

[0145] Table 1, the popularity of the service

[0146] service AN 1

[0147] LOC strategy: every decision selfish access network cache content, the goal is to make the local network to maximize revenue. Can be calc...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04L29/08
CPCH04L67/568Y02D30/70
Inventor 罗洪斌张珊
Owner BEIHANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap