A Framework for Pricing Schemes for Networks under Complete Information

@article{Goyal2014AFF,
  title={A Framework for Pricing Schemes for Networks under Complete Information},
  author={Aditya Goyal and Akanksha Tyagi and Manisha Sunil Bhende and Swapnil Kawade},
  journal={ArXiv},
  year={2014},
  volume={abs/1403.2990}
}
The revenue maximization problem of service provider is considered and different pricing schemes to solve the above problem are implemented. The service provider can choose an apt pricing scheme subjected to limited resources, if he knows the utility function and identity of the user. The complete price differentiation can achieve a large revenue gain but has high implementation complexity. The partial price differentiation scheme to overcome the high implementational complexity of complete… 

Figures from this paper

Optimization of Wireless Internet Pricing Scheme in Serving Multi QoS Network Using Various Attributes

TLDR
In this research, a wireless pricing model that involve QoS attributes is established then the model will be transformed into a model of optimization, which is to maximize the total price for the connection based on the QoS parameters.

Optimization of Wireless Internet Pricing Scheme in Serving Multi QoS Network Using Various Attributes

TLDR
In this research, a wireless pricing model that involve QoS attributes is established then the model will be transformed into a model of optimization, which is to maximize the total price for the connection based on the QoS parameters.

A traffic engineering framework for maximizing network revenue in software defined network

TLDR
This work designed a path assignment scheme that supports network constraints and user request priorities, and aims to maximize the revenue generated for the service providers via a priority based traffic engineering framework in SDN.

References

SHOWING 1-9 OF 9 REFERENCES

Price Differentiation for Communication Networks

TLDR
This work considers the incomplete information case where the service provider does not know to which group each user belongs and shows that it is still possible to realize price differentiation under this scenario and designs a polynomial-time algorithm that can compute the optimal partial differentiation prices.

Revenue Maximization for Communication Networks with Usage-Based Pricing

TLDR
By properly combining the two pricing schemes, it is shown that it is possible to maintain a very small revenue loss without knowing detailed information of each user in the network.

Optimal Nonlinear Pricing for a Monopolistic Network Service Provider with Complete and Incomplete Information

TLDR
Analytical and numerical results indicate a profit improvement exceeding 38% over linear pricing by the introduction of nonlinear pricing in the scenario where the service provider has incomplete information on user types.

The Price of Simplicity

TLDR
It is shown that in a range of environments, the loss of revenue from using simple entry fees is small and the gain from this type of price discrimination is small, particularly in environments in which the simple entry fee pricing leads to a low Price of Simplicity.

A stackelberg game for pricing uplink power in wide-band cognitive radio networks

TLDR
It is shown that for regimes with symmetric users who share the same level of willingness to pay, the optimal revenue is concave and increasing in the number of users in the network.

Time-Dependent Network Pricing and Bandwidth Trading

TLDR
A model to study the important role of time-preference in network pricing is presented, and if the SP can differentiate its prices over different users and times, the maximal revenue can be achieved, as well as the maximal social welfare.

Charging and rate control for elastic traffic

  • F. Kelly
  • Computer Science
    Eur. Trans. Telecommun.
  • 1997
This paper addresses the issues of charging, rate control and routing for a communication network carrying elastic traffic, such as an ATM network offering an available bit rate service. A model is

Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures

TLDR
A survey of the recent efforts towards a systematic understanding of layering as optimization decomposition, where the overall communication network is modeled by a generalized network utility maximization problem, each layer corresponds to a decomposed subproblem, and the interfaces among layers are quantified as functions of the optimization variables coordinating the subproblems.

AT&T shifts to usage-based wireless data plan