Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | ACM Digital Library |
|---|---|
| Author | Pefkianakis, Ioannis Poularakis, Konstantinos Chandrashekar, Jaideep Tassiulas, Leandros |
| Abstract | Motivation: ISPs today are seeing unprecedented growth in residential broadband traffic volumes driven by the wide- spread popularity of video streaming services such as Net- flix, Hulu, Youtube and so on. This traffic explosion creates a need for (expensive) periodic network capacity upgrades and also increases transit costs paid to upstream providers. As a response, several ISPs started to impose time-of-day data caps, i.e., where per subscriber data usage limits are defined for particular periods of the day, e.g. BRC [USA] from 5pm-1am daily.While these have the effect of reducing traffic in busy periods (and hence costs), they also run the risk of alienating subscribers due their punitive nature. In this abstract, we propose an alternative mechanism where the ISP has a simple fixed monthly subscription price but also applies price discounts to influence subscribers to shift their traffic demands outside of the peak windows. Cost Model: Most ISPs size the network for peak demand and over-provision network capacity so that average utilization stays below a threshold p. Capacity upgrades are triggered by sustained, upward shifts in the peak traffic (denoted $P_{100}).$ Hence, capacity cost can be assumed to scale proportionally to a rate factor c (ε/Mbps) and $P_{100}.$ The second cost component, transit, is charged based on the 95th percentile (denoted $P_{95})$ of the transit traffic (computed over 5 minute windows in a month) and a committed price r (ε per Mbps). The actual fraction of transit traffic (f) depends greatly on several factors -- ISP size, geographic market, etc. For example, f ~ 0.3 in Japan, and f ~ 0.8 in Africa [1]. Utility Model: Previous work has considered user utility to be a quadratic function of the monthly data usage [2]. In this abstract, we assume a general model where each subscriber may have different utility functions at different peak-time intervals. Hence, for a subscriber k that generates $w_{t}$ amount of data (in bytes) in t, the total utility will be: $U_{k}(w)$ = ∑/t $α_{kt}$ • $(b_{kt}$ • $w'_{t}$ -- $w'^{2}_{t}/2)$ (1) where $w'_{t}$ = min $v\{w_{t},$ $b_{kt}\}$ and $α_{kt},$ $b_{kt}$ are constants. IncentiveMechanism: The exact price discount is based on two values computed by the ISP in each interval t: (i) The implementation of the scientific publication is co-financed through the Project "State Scholarships Foundation" from the resources of the Operational Program "Education & Lifelong Learning", European Social Fund (ESF) and the NSRF, 2007-2013. The first author would like to acknowledge the "Alexander S. Onassis" Public Benefit Foundation, Greece for providing a scholarship. a data threshold $D_{t}$ ≥ 0 (in bytes) and (ii) a discount rate pt ≥ 0 (in ε/byte). If the monthly data usage of k inside t, $d^{kt},$ is lower than $D^{t},$ k gets a discount pt • $(D^{t}--d^{kt}).$ Then, k will adopt her behavior so that: $Max/d^{k}≥0$ $U^{k}(d^{k})$ + $∑P^{t}$ • $(D^{t}$ ? $d^{kt}$ (D, p))+ (2) where (.)+ = max(., 0). D, p and $d^{k}$ are the vectors 8t. We assume that the ISP can estimate the per subscriber daily traffic pattern and predict how it will change as a response to the incentives by solving the problem in (2). Then, the ISP will try to minimize the incentive and traffic costs: Min/D,p ∑/t(pt $∑(D^{t}$ -- $d_{kt}(D,$ p))+) + r • f • P95 + c/? • $P_{100}$ (3) where $P_{95},$ $P_{100}$ are the traffic percentiles after incentives. Approximation: The above problem is NP-Hard in general. The difficulty lies on the ordering in the objective function, which renders it non-continuous. Interestingly, the slightly different problem for which we are to minimize the weighted sum of all the percentile values from the 95th up to the 100th, is of lower complexity. Specifically, this problem can be solved by replacing the percentile terms with new optimization variables and adding a set of linear constraints [3]. The ISP can alternatively solve the above problem to get a solution close to the optimal one for the problem in (3). Evaluation: We applied the price incentives on a dataset of 223 subscribers of a European ISP measured in Dec. 2013. The ISP offers discounts only during the peak period of 6- 11pm, at 1 hour granularity. We set bkt to the total data usage of k in t in our dataset, and considered utility to be equal to the tariff price to find akt. We find evidence of tangible benefits to the ISP (up to 24% cost reduction), while the discounts varied from 0.08e - 1.45e per subscriber. Conclusion: The proposed mechanism does not mandate changes in behavior, but instead offers a quid-pro-quo to subscribers. In contrast to previous incentive mechanisms [4], [5], our scheme is designed requiring no dynamic traffic management and additional communication between the ISP and the subscribers. |
| Starting Page | 43 |
| Ending Page | 43 |
| Page Count | 1 |
| File Format | |
| ISSN | 01635999 |
| DOI | 10.1145/2695533.2695551 |
| Journal | ACM SIGMETRICS Performance Evaluation Review (PERV) |
| Volume Number | 42 |
| Issue Number | 3 |
| Language | English |
| Publisher | Association for Computing Machinery (ACM) |
| Publisher Date | 2014-01-10 |
| Publisher Place | New York |
| Access Restriction | One Nation One Subscription (ONOS) |
| Content Type | Text |
| Resource Type | Article |
| Subject | Computer Networks and Communications Hardware and Architecture Software |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|