IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v22y2022i3d10.1007_s12351-021-00622-9.html
   My bibliography  Save this article

Optimal resource allocation for multiclass services in peer-to-peer networks via successive approximation

Author

Listed:
  • Shiyong Li

    (Yanshan University)

  • Wei Sun

    (Yanshan University)

  • Huan Liu

    (Yanshan University)

Abstract

Peer-to-peer (P2P) networks support a wide variety of network services including elastic services such as file-sharing and downloading and inelastic services such as real-time multiparty conferencing. Each peer who acquires a service will receive a certain level of satisfaction if the service is provided with a certain amount of resource. The utility function is used to describe the satisfaction of a peer when acquiring a service. In this paper we consider optimal resource allocation for elastic and inelastic services and formulate a utility maximization model which is an intractable and difficult non-convex optimization problem. In order to resolve it, we apply the successive approximation method and approximate the non-convex problem to a serial of equivalent convex optimization problems. Then we develop a gradient-based resource allocation scheme to achieve the optimal solutions of the approximations. After a serial of approximations, the proposed scheme can finally converge to an optimal solution of the primal utility maximization model for resource allocation which satisfies the Karush–Kuhn–Tucker conditions.

Suggested Citation

  • Shiyong Li & Wei Sun & Huan Liu, 2022. "Optimal resource allocation for multiclass services in peer-to-peer networks via successive approximation," Operational Research, Springer, vol. 22(3), pages 2605-2630, July.
    • Handle: RePEc:spr:operea:v:22:y:2022:i:3:d:10.1007_s12351-021-00622-9
    DOI: 10.1007/s12351-021-00622-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-021-00622-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-021-00622-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Barry R. Marks & Gordon P. Wright, 1978. "Technical Note—A General Inner Approximation Algorithm for Nonconvex Mathematical Programs," Operations Research, INFORMS, vol. 26(4), pages 681-683, August.
    2. Seyedakbar Mostafavi & Mehdi Dehghan, 2017. "A stochastic approximation resource allocation approach for HD live streaming," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 64(1), pages 87-101, January.
    3. Shiyong Li & Wei Sun, 2016. "A mechanism for resource pricing and fairness in peer-to-peer networks," Electronic Commerce Research, Springer, vol. 16(4), pages 425-451, December.
    4. Farhood Rismanchian & Young Hoon Lee, 2018. "Moment-based approximations for first- and second-order transient performance measures of an unreliable workstation," Operational Research, Springer, vol. 18(1), pages 75-95, April.
    5. Shiyong Li & Yue Zhang & Wei Sun, 2019. "Optimal Resource Allocation Model and Algorithm for Elastic Enterprise Applications Migration to the Cloud," Mathematics, MDPI, vol. 7(10), pages 1-20, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ziping Zhao & Rui Zhou & Zhongju Wang & Daniel P. Palomar, 2018. "Optimal Portfolio Design for Statistical Arbitrage in Finance," Papers 1803.02974, arXiv.org.
    2. Satish Kumar & Weng Marc Lim & Nitesh Pandey & J. Christopher Westland, 2021. "20 years of Electronic Commerce Research," Electronic Commerce Research, Springer, vol. 21(1), pages 1-40, March.
    3. Xu, Gongxian, 2013. "Steady-state optimization of biochemical systems through geometric programming," European Journal of Operational Research, Elsevier, vol. 225(1), pages 12-20.
    4. Huang, Jinbo & Li, Yong & Yao, Haixiang, 2022. "Partial moments and indexation investment strategies," Journal of Empirical Finance, Elsevier, vol. 67(C), pages 39-59.
    5. Shiyong Li & Yue Zhang & Wei Sun, 2019. "Optimal Resource Allocation Model and Algorithm for Elastic Enterprise Applications Migration to the Cloud," Mathematics, MDPI, vol. 7(10), pages 1-20, October.
    6. Xu, Gongxian, 2014. "Global optimization of signomial geometric programming problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 500-510.
    7. Ata Allah Taleizadeh & Leila Aliabadi & Park Thaichon, 2022. "A sustainable inventory system with price-sensitive demand and carbon emissions under partial trade credit and partial backordering," Operational Research, Springer, vol. 22(4), pages 4471-4516, September.
    8. Y. Shi & H. D. Tuan & H. Tuy & S. Su, 2017. "Global optimization for optimal power flow over transmission networks," Journal of Global Optimization, Springer, vol. 69(3), pages 745-760, November.
    9. Kha-Hung Nguyen & Hieu V. Nguyen & Mai T. P. Le & Tuan X. Cao & Oh-Soon Shin, 2020. "Rate Fairness and Power Consumption Optimization for NOMA-Assisted Downlink Networks," Energies, MDPI, vol. 14(1), pages 1-18, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:operea:v:22:y:2022:i:3:d:10.1007_s12351-021-00622-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.