In this paper, a Stackelberg differential game based approach is proposed to solve the bandwidth allocation problems in satellite communication network. All the satellites are divided into two groups, one has high dow...In this paper, a Stackelberg differential game based approach is proposed to solve the bandwidth allocation problems in satellite communication network. All the satellites are divided into two groups, one has high download requirements, and the other one has low download requirements. Each satellites group has its own controller for bandwidth allocation, and can get payments from the satellites for the allocated resources. The relationships between the controllers and satellites are formed as a Stackelberg game. In our model, differential equation is introduced to describe the bandwidth dynamics for the whole satellite communication network. Combine the differential equation and Stackelberg game together, we can formulate the bandwidth allocation problems in satellite communication network as a Stackelber differential game. The solutions to the proposed game is solved based the Bellman dynamic equations. Numerical simulations are given to prove the effeteness and correctness of the proposed approach.展开更多
Elastic control could balance the distributed control plane in Software-Defined Networking(SDN). Dynamic switch migration has been proposed to achieve it. However, existing schemes mainly focus on how to execute migra...Elastic control could balance the distributed control plane in Software-Defined Networking(SDN). Dynamic switch migration has been proposed to achieve it. However, existing schemes mainly focus on how to execute migration operation, but not why. This paper designs a decision-making mechanism based on zero-sum game theory to reelect a new controller as the master for migrated switches. It first chooses a switch for migration in the heavy controller which invites its neighbors as the game players to compete for the master role of this switch in the game-playing field(GPF) which is an occasional and loose domain for game-playing. Second, based on the concept of GPF, we design a decentralized strategy to play the game and determine which player as the final master. We implement it by extending the Open Flow protocol. Finally, numerical results demonstrate that our distributed strategy can approach elastic control plane with better performance.展开更多
In this paper, the authors outline a formal system for reasoning about agents' knowledge in knowledge games-a special type of multi-agent system. Knowledge games are card games where the agents' actions involve an e...In this paper, the authors outline a formal system for reasoning about agents' knowledge in knowledge games-a special type of multi-agent system. Knowledge games are card games where the agents' actions involve an exchange of information with other agents in the game. The authors' system is modeled using Coq-a formal proof management system. To the best of the authors" knowledge, there are no papers in which knowledge games are considered using a Coq proof assistant. The authors use the dynamic logic of common knowledge, where they particularly focus on the epistemic consequences of epistemic actions carried out by agents. The authors observe the changes in the system that result from such actions. Those changes that can occur in such a system that are of interest to the authors take the form of agents' knowledge about the state of the system, knowledge about other agents' knowledge, higher-order agents' knowledge and so on, up to common knowledge. Besides an axiomatic ofepistemic logic, the authors use a known axiomatization of card games that is extended with some new axioms that are required for the authors' approach. Due to a deficit in implementations grounded in theory that enable players to compute their knowledge in any state of the game, the authors show how the authors' approach can be used for these purposes.展开更多
基金supported by National Science Foundation Project of P. R. China (No. 61501026, U1603116)
文摘In this paper, a Stackelberg differential game based approach is proposed to solve the bandwidth allocation problems in satellite communication network. All the satellites are divided into two groups, one has high download requirements, and the other one has low download requirements. Each satellites group has its own controller for bandwidth allocation, and can get payments from the satellites for the allocated resources. The relationships between the controllers and satellites are formed as a Stackelberg game. In our model, differential equation is introduced to describe the bandwidth dynamics for the whole satellite communication network. Combine the differential equation and Stackelberg game together, we can formulate the bandwidth allocation problems in satellite communication network as a Stackelber differential game. The solutions to the proposed game is solved based the Bellman dynamic equations. Numerical simulations are given to prove the effeteness and correctness of the proposed approach.
基金supported by the Foundation for Innovative Research Groups of the National Natural Science Foundation of China(Grant No.61521003)the National Basic Research Program of China(2012CB315901,2013CB329104)+2 种基金the National Natural Science Foundation of China(Grant No.61372121,61309020,61309019)the National High-Tech Research&Development Program of China(Grant No.2013AA013505)the National Science and Technology Support Program Project(Grant No.2014BAH30B01)
文摘Elastic control could balance the distributed control plane in Software-Defined Networking(SDN). Dynamic switch migration has been proposed to achieve it. However, existing schemes mainly focus on how to execute migration operation, but not why. This paper designs a decision-making mechanism based on zero-sum game theory to reelect a new controller as the master for migrated switches. It first chooses a switch for migration in the heavy controller which invites its neighbors as the game players to compete for the master role of this switch in the game-playing field(GPF) which is an occasional and loose domain for game-playing. Second, based on the concept of GPF, we design a decentralized strategy to play the game and determine which player as the final master. We implement it by extending the Open Flow protocol. Finally, numerical results demonstrate that our distributed strategy can approach elastic control plane with better performance.
文摘In this paper, the authors outline a formal system for reasoning about agents' knowledge in knowledge games-a special type of multi-agent system. Knowledge games are card games where the agents' actions involve an exchange of information with other agents in the game. The authors' system is modeled using Coq-a formal proof management system. To the best of the authors" knowledge, there are no papers in which knowledge games are considered using a Coq proof assistant. The authors use the dynamic logic of common knowledge, where they particularly focus on the epistemic consequences of epistemic actions carried out by agents. The authors observe the changes in the system that result from such actions. Those changes that can occur in such a system that are of interest to the authors take the form of agents' knowledge about the state of the system, knowledge about other agents' knowledge, higher-order agents' knowledge and so on, up to common knowledge. Besides an axiomatic ofepistemic logic, the authors use a known axiomatization of card games that is extended with some new axioms that are required for the authors' approach. Due to a deficit in implementations grounded in theory that enable players to compute their knowledge in any state of the game, the authors show how the authors' approach can be used for these purposes.