Non-linear game models for large-scale network bandwidth management

Abstract

The design of dynamic Label-Switched Paths (LSP's) in MultiProtocol Label Switched (MPLS) networks is an NP-hard optimization problem. An LSP is a logical path between two nodes in the network. This path has a pre-reserved amount of bandwidth that defines its size. The LSP design problem consists of determining the number of these logical links and configuring the physical path and the size of each LSP. This paper presents an optimization model based on game theory. In this approach, connection requests are modeled as competitive players in a noncooperative game context. The transport network bandwidth constitutes the resource for which optimization is sought. The outcome of this optimization is a set of LSPs upon which the competing connections are routed.

Game Model Solution of Aircraft Deicing Operation Scheduling Based on Shapley Value

“…is the probability that the airline i participates the coalition S. The Shapley value of the airline i is the expect contribution to the coalition when participating the coalition, this is the index to determine the contribution of every airline [3]. Therefore, Shapley value is the effective method to distribute payoff fairly and avoid the endless confrontation of airline coalition.…”

Adaptive Learning Rate Elitism Estimation of Distribution Algorithm Combining Chaos Perturbation for Large Scale Optimization

“…Many real world problems may be modeled as large scale problems in continuous domains, such as large combinational problem [1], computer network management [2], industrial engineering [3], etc. Although, evolutionary algorithms (EAs) have been successfully applied to various engineering and scientific problems for the last two decades [4,5], the classical EAs often lose their efficacy and advantages when applied to large scale and complex problems [6].…”