Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Electrical Engineering / 電機工程學系
  4. Research on Time-of-day Internet Access Management by Quota-based Priority Control
 
  • Details

Research on Time-of-day Internet Access Management by Quota-based Priority Control

Date Issued
2007
Date
2007
Author(s)
Chu, Shao-I
DOI
en-US
URI
http://ntur.lib.ntu.edu.tw//handle/246246/53521
Abstract
There exists abusive and unfair Internet access during peak hours by users of a free-of-charge or flat-rate network even under a quota-based priority control (QPC). To effectively managing the Internet access over time based on QPC, this thesis studies and analyzes two classes of schemes: time-of-day pricing (TDP) and quota scheduling (QS). TDP is an incentive control method, where users can flexibly allocate the daily quota by virtual price. QS allocates the daily quota to individual time periods to directly and forcedly limit the maximum volume usage of each user during peak hours.
The TDP design takes advantage of the empirical data to characterize user demand and quota-allocation behavior with respect to time and pricing. In-depth analyses of empirical data reveal distinctive behavior patterns of myopic and prudent quota allocations over time and both patterns indicate high preference for peak-hour access. The user models adopt general utility functions and capture how pricing affects user behavior as prudent or myopic. Preference parameters of users’ utility over time are then estimated by collecting easily measurable user volumes. The TDP design problem is then formulated and solved as a Stackelberg game. Numerical results shows that the TDP design leads to significant improvements in peak-hour abuse and fairness, peak shaving and load balancing over pure QPC. The methodology of TDP requires only two simple and short-period data collections from an operational network. One is from the network with QPC; the other is from the network without quota control. Results demonstrate the effectiveness of TDP design methodology when applied to Internet access environments with frequent changes.
Two QS schemes, load balancing-based quota scheduling (LB-QS) and peak shaving-based quota scheduling (PS-QS), are proposed. LB-QS intends to equalize average traffic over time by proportional quota allocation to time periods of control. There is no empirical data of traffic usage needed for the LB-QS design. PS-QS aims at reducing total traffic of peak hours by utilizing an aggregate empirical data-based user model. This model needs the measurement data collected from a network with QPC to approximate user quota allocation behavior over time. Both QS schemes are compulsive control measures.
Performances of TDP and QS are evaluated and compared over the empirical data of a 5000-user network. Results demonstrate TDP significantly outperforms both LB-QS and PS-QS in regulating the Internet access over time. This is because TDP exploits user behavior modeling and pricing to induce user behavior over time, avoiding congestion at the time of quota renewal. As for calculation complexity, the TDP design needs to solve an optimization problem, while the QS design only requires simple mathematical operations. However, the CPU time for TDP calculation takes about 1 minute. Recommendations are given for selecting an effective Internet access scheme based on data availability and traffic pattern over time.
We further study how to manage the user traffic over a profitable and multi-service network by designing pricing and bandwidth allocation at the same time. Although pricing and bandwidth allocation of individual services are two important and coupled resource management functions, they are treated separately in most of the literature. In this thesis, we design for a service provider an integrated pricing and bandwidth allocation (IPBA) scheme for a popular network service, where each user is guaranteed with a minimum bandwidth for transmission according to the service class subscribed. Revenue maximization of service provisioning is the service provider’s objective. The design problem is formulated as a nonlinear programming problem. It adopts an empirical user demand model, where a user’s usage time for a service class is a function of prices. Constrained by the total bandwidth limitation, the revenue-maximizing price design induces user demands for individual classes, which in turn determines an optimal allocation of bandwidth. Analyses of the IPBA solution demonstrate that the price increases with traffic intensity while the bandwidth allocation is insensitive to the variation. Results also reveal that when users’ demand for a class is relatively sensitive to the price of other class. Over the same network capacity, the total revenue of offering more than one service classes is higher than that of offering only single service class.
Subjects
時段計價
配額為基礎之優先權控制
經驗使用者模型
設計方法
公平性
頻寬分配
整合
time-of-day pricing
quota-based priority control
empirical user demand model
design methodology
fairness
bandwidth allocation
integration
SDGs

[SDGs]SDG11

Type
thesis
File(s)
Loading...
Thumbnail Image
Name

ntu-96-D89921016-1.pdf

Size

23.31 KB

Format

Adobe PDF

Checksum

(MD5):81c8d52b9260ca543efecd4acefcad37

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science