Article View/Open
(951)
Publication Export
| Citation Infomation |
| 社群 sharing |
Related Publications in TAIR
- > Simple Record
- > Full Record
| Field | Value |
|---|---|
| Title: | Analysis of bandwidth allocation on end-to-end QoS networks under budget control |
| Authors: | Wang, Chia-Hung 王嘉宏 Luh, Hsing Paul 陸行 |
| Contributors: | 應數系 |
| Keywords: | 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 |
| Date: | 2011-07 |
| Issue Date: | 2015-06-22 16:17:48 (UTC+8) |
| 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. |
| Relation: | Computers and Mathematics with Applications, 62(1), 419-439 |
| Data Type: | article |
| DOI: | http://dx.doi.org/10.1016/j.camwa.2011.05.024 |
| DCField | Value | Language |
|---|---|---|
| dc.contributor (Contributor) | 應數系 | - |
| dc.creator (Authors) | Wang, Chia-Hung | en_US |
| dc.creator (Authors) | 王嘉宏 | zh_TW |
| dc.creator (Authors) | Luh, Hsing Paul | en_US |
| dc.creator (Authors) | 陸行 | zh_TW |
| dc.date (Date) | 2011-07 | - |
| dc.date.accessioned | 2015-06-22 16:17:48 (UTC+8) | - |
| dc.date.available | 2015-06-22 16:17:48 (UTC+8) | - |
| dc.date.issued (Issue Date) | 2015-06-22 16:17:48 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/76064 | - |
| dc.description.abstract (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 (Relation) | Computers and Mathematics with Applications, 62(1), 419-439 | - |
| dc.subject (Keywords) | 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 (Title) | Analysis of bandwidth allocation on end-to-end QoS networks under budget control | - |
| dc.type (Data Type) | article | en |
| dc.identifier.doi (DOI) | 10.1016/j.camwa.2011.05.024 | - |
| dc.doi.uri | http://dx.doi.org/10.1016/j.camwa.2011.05.024 | - |
NO.64,Sec.2,ZhiNan Rd.,Wenshan District,Taipei City 11605,Taiwan (R.O.C.)
11605 臺北市文山區指南路二段64號 Tel：+886-2-2939-3091
© 2016 National ChengChi University All Rights Reserved.
DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © 2006-2017 - 問題回報 Problem return