PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Powiadomienia systemowe
  • Sesja wygasła!
Tytuł artykułu

Utility optimization-based bandwidth allocation for elastic and inelastic services in peer-to-peer networks

Treść / Zawartość
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
This paper considers reasonable bandwidth allocation for multiclass services in peer-to-peer (P2P) networks, measures the satisfaction of each peer as a customer by a utility function when acquiring one service, and develops an optimization model for bandwidth allocation with the objective of utility maximization. Elastic services with concave utilities are first considered and the exact expression of optimal bandwidth allocation for each peer is deduced. In order to obtain an optimum in distributed P2P networks, we develop a gradient-based bandwidth allocation scheme and illustrate the performance with numerical examples. Then we investigate bandwidth allocation for inelastic services with sigmoidal utilities, which is a nonconvex optimization problem. In order to solve it, we analyze provider capacity provisioning for bandwidth allocation of inelastic services and modify the update rule for prices that service customers should pay. Numerical examples are finally given to illustrate that the improved scheme can also efficiently converge to the global optimum.
Rocznik
Strony
111--123
Opis fizyczny
Bibliogr. 25 poz., tab., wykr.
Twórcy
autor
  • School of Economics and Management, Yanshan University, No. 138 Hebei Avenue, Qinhuangdao 066004, China
autor
  • School of Economics and Management, Yanshan University, No. 138 Hebei Avenue, Qinhuangdao 066004, China
autor
  • School of Economics and Management, Yanshan University, No. 138 Hebei Avenue, Qinhuangdao 066004, China
autor
  • School of Economics and Management, Yanshan University, No. 138 Hebei Avenue, Qinhuangdao 066004, China
Bibliografia
  • [1] Antal, E. and Vinkó, T. (2016). Modeling max-min fair bandwidth allocation in bittorrent communities, Computational Optimization and Applications 66(2): 383–400.
  • [2] Bertsekas, D. (2003). Nonlinear Programming, Athena Scientific, Belmont, MA.
  • [3] Chen, M., Ponec, M., Sengupta, S., Li, J. and Chou, P. (2012). Utility maximization in peer-to-peer systems with applications to video conferencing, IEEE/ACM Transactions on Networking 20(6): 1681–1694.
  • [4] Eger, K. and Killat, U. (2007a). Fair resource allocation in peer-to-peer networks (extended version), Computer Communications 30(16): 3046–3054.
  • [5] Eger, K. and Killat, U. (2007b). Resource pricing in peer-to-peer networks, IEEE Communications Letters 11(1): 82–84.
  • [6] Goswami, A., Gupta, R. and Parashari, G. (2017). Reputation-based resource allocation in P2P systems: A game theoretic perspective, IEEE Communications Letters 21(6): 1273–1276.
  • [7] Gupta, R., Singha, N. and Singh, Y. (2015). Reputation based probabilistic resource allocation for avoiding free riding and formation of common interest groups in unstructured P2P networks, Peer-to-Peer Networking and Applications 9(6): 1101–1113.
  • [8] Hande, P., Zhang, S. and Chiang, M. (2007). Distributed rate allocation for inelastic flows, IEEE/ACM Transactions on Networking 15(6): 1240–1253.
  • [9] Koutsopoulos, I. and Iosifidis, G. (2010). A framework for distributed bandwidth allocation in peer-to-peer networks, Performance Evaluation 67(4): 285–298.
  • [10] Kumar, C., Altinkemer, K. and De, P. (2011). A mechanism for pricing and resource allocation in peer-to-peer networks, Electronic Commerce Research and Applications 10(1): 26–37.
  • [11] Lee, J., Mazumdar, R. and Shroff, N. (2005). Non-convex optimization and rate control for multi-class services in the internet, IEEE/ACM Transactions on Networking 13(4): 827–840.
  • [12] Li, S., Jiao, L., Zhang, Y., Wang, Y. and Sun, W. (2017). A scheme of resource allocation for heterogeneous services in peer-to-peer networks using particle swarm optimization, IAENG International Journal of Computer Science 44(4): 482–488.
  • [13] Li, S. and Sun,W. (2016). A mechanism for resource pricing and fairness in peer-to-peer networks, Electronic Commerce Research 16(4): 425–451.
  • [14] Li, S., Sun, W., E, C.-G. and Shi, L. (2016a). A scheme of resource allocation and stability for peer-to-peer file-sharing networks, International Journal of Applied Mathematics & Computer Science 26(3): 707–719, DOI: 10.1515/amcs-2016-0049.
  • [15] Li, S., Sun,W. and Hua, C. (2016b). Optimal resource allocation for heterogeneous traffic in multipath networks, International Journal of Communication Systems 29(1): 84–98.
  • [16] Li, S., Sun, W. and Tian, N. (2015). Resource allocation for multi-class services in multipath networks, Performance Evaluation 92(1): 1–23.
  • [17] Lin, F., Zhou, X., Huang, D. and Yuan, J. (2015). Hierarchical name system based on hybrid p2p for multimedia networks, Telecommunication Systems 59(3): 393–400.
  • [18] Satsiou, A. and Tassiulas, L. (2010). Reputation-based resource allocation in p2p systems of rational users, IEEE Transactions on Parallel and Distributed Systems 21(4): 466–479.
  • [19] Song, F., Huang, D., Zhou, H., Zhang, H. and You, I. (2014). An optimization-based scheme for efficient virtual machine placement, International Journal of Parallel Programming 42(5): 853–872.
  • [20] Song, F., Li, R. and Zhou, H. (2015). Feasibility and issues for establishing network-based carpooling scheme, Pervasive and Mobile Computing 24(1): 4–15.
  • [21] Song, F., Zhou, Y., Kong, K., Zheng, Q., You, I. and Zhang, H. (2017). Smart collaborative connection management for identifier-based network, IEEE Access 5: 7936–7949.
  • [22] Vo, P., Lee, S. and Hong, C. (2012). The random access num with multiclass traffic, EURASIP Journal on Wireless Communications and Networking 242: 1–12.
  • [23] Wang, K., Yin, H., Quan, W. and Min, G. (2018). Enabling collaborative edge computing for software defined vehicular networks, IEEE Network 32(5): 112–117.
  • [24] Yan, H., Gao, D., Su, W., Foh, C., Zhang, H. and Vasilakos, A. (2017). Caching strategy based on hierarchical cluster for named data networking, IEEE Access 5: 8433–8443.
  • [25] Zheng, Y., Lin, F., Yang, Y. and Gan, T. (2016). Adaptive resource scheduling mechanism in P2P file sharing system, Peer-to-Peer Networking and Applications 9(6): 1089–1100.
Uwagi
PL
Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2019).
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-010f6662-0c8f-4681-8bc4-604a453cd346
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.