Publications-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 Analysis of bandwidth allocation on end-to-end QoS networks under budget control
作者 Wang, Chia-Hung
王嘉宏
Luh, Hsing Paul
陸行
貢獻者 應數系
關鍵詞 Budget constraint; Convexity; Core networks; Efficient designs; End-to-end QoS; Erlang loss formula; Internet economics; Monotonicity; Multiple class; Network service providers; Operational process; Optimality conditions; Revenue management; Service class; Solution algorithms; Stochastic traffic; Traffic class; Traffic demands; Virtual paths; Bandwidth; Blocking probability; Budget control; Commerce; Economics; Elasticity; Probability; Quality of service; Sensitivity analysis; Telecommunication networks; Telecommunication systems
日期 2011-07
上傳時間 22-Jun-2015 16:17:48 (UTC+8)
摘要 This paper considers the problem of bandwidth allocation on communication networks with multiple classes of traffic, where bandwidth is determined under the budget constraint. Due to the limited budget, there is a risk that the network service providers can not assert a 100% guaranteed availability for the stochastic traffic demand at all times. We derive the blocking probabilities of connections as a function of bandwidth, traffic demand and the available number of virtual paths based on the Erlang loss formula for all service classes. A revenue/profit function is studied through the monotonicity and convexity of the blocking probability and expected path occupancy. We present the optimality conditions and develop a solution algorithm for optimal bandwidth of revenue management schemes. The sensitivity analysis and three economic elasticity notions are also proposed to investigate the marginal revenue for a given traffic class by changing bandwidth, traffic demand and the number of virtual paths, respectively. By analysis of those monotone and convex properties, it significantly facilitates the operational process in the efficient design and provision of a core network under the budget constraint. © 2011 Elsevier Ltd. All rights reserved.
關聯 Computers and Mathematics with Applications, 62(1), 419-439
資料類型 article
DOI http://dx.doi.org/10.1016/j.camwa.2011.05.024
dc.contributor 應數系-
dc.creator (作者) Wang, Chia-Hungen_US
dc.creator (作者) 王嘉宏zh_TW
dc.creator (作者) Luh, Hsing Paulen_US
dc.creator (作者) 陸行zh_TW
dc.date (日期) 2011-07-
dc.date.accessioned 22-Jun-2015 16:17:48 (UTC+8)-
dc.date.available 22-Jun-2015 16:17:48 (UTC+8)-
dc.date.issued (上傳時間) 22-Jun-2015 16:17:48 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/76064-
dc.description.abstract (摘要) This paper considers the problem of bandwidth allocation on communication networks with multiple classes of traffic, where bandwidth is determined under the budget constraint. Due to the limited budget, there is a risk that the network service providers can not assert a 100% guaranteed availability for the stochastic traffic demand at all times. We derive the blocking probabilities of connections as a function of bandwidth, traffic demand and the available number of virtual paths based on the Erlang loss formula for all service classes. A revenue/profit function is studied through the monotonicity and convexity of the blocking probability and expected path occupancy. We present the optimality conditions and develop a solution algorithm for optimal bandwidth of revenue management schemes. The sensitivity analysis and three economic elasticity notions are also proposed to investigate the marginal revenue for a given traffic class by changing bandwidth, traffic demand and the number of virtual paths, respectively. By analysis of those monotone and convex properties, it significantly facilitates the operational process in the efficient design and provision of a core network under the budget constraint. © 2011 Elsevier Ltd. All rights reserved.-
dc.format.extent 561780 bytes-
dc.format.mimetype application/pdf-
dc.relation (關聯) Computers and Mathematics with Applications, 62(1), 419-439-
dc.subject (關鍵詞) Budget constraint; Convexity; Core networks; Efficient designs; End-to-end QoS; Erlang loss formula; Internet economics; Monotonicity; Multiple class; Network service providers; Operational process; Optimality conditions; Revenue management; Service class; Solution algorithms; Stochastic traffic; Traffic class; Traffic demands; Virtual paths; Bandwidth; Blocking probability; Budget control; Commerce; Economics; Elasticity; Probability; Quality of service; Sensitivity analysis; Telecommunication networks; Telecommunication systems-
dc.title (題名) Analysis of bandwidth allocation on end-to-end QoS networks under budget control-
dc.type (資料類型) articleen
dc.identifier.doi (DOI) 10.1016/j.camwa.2011.05.024-
dc.doi.uri (DOI) http://dx.doi.org/10.1016/j.camwa.2011.05.024-