| 1. |
|
|
| 2. |
- Andersson, Mikael, et al.
(författare)
-
Admission control with service level agreements for a web server
- 2005
-
Ingår i: Proceedings of the IASTED International Conference on Internet and Multimedia Systems and Applications, EuroIMSA 2005 : February 21 - 23, 2005, Grindelwald, Switzerland. - 0889864845
-
Konferensbidrag (refereegranskat)abstract
- One problem with web servers is that they are sensitive to overload. The servers may become overloaded during temporary traffic peaks when more requests arrive than the server is designed for. Because overload usually occurs rather seldom, it is not economical to overprovision the servers for these traffic peaks, instead admission control mechanisms can be implemented in the servers. This pa per investigates two overload control strategies with per formance bounds for a web server. In service level agree ments, we bound average response times and throughputs for all service classes. Each request is sorted into a class, where each class is assigned a weight representing the in come for the web site owner. Then a linear optimization algorithm is applied so that the total revenue for the web site during overload is maximized.
|
|
| 3. |
- Li, J., et al.
(författare)
-
Performance analysis of local caching replacement policies for internet video streaming services
- 2014
-
Ingår i: 2014 22nd International Conference on Software, Telecommunications and Computer Networks, SoftCOM 2014. - : IEEE conference proceedings. - 9789532900521 ; , s. 341-348
-
Konferensbidrag (refereegranskat)abstract
- In this work, the performance of 5 representative caching replacement policies was investigated and compared for caching Internet video-on-demand (VoD) in local access networks. Two measured traces of end-user requests were used in the analyses for two typical VoD services: TV-on-demand and user generated content represented by YouTube. The studied policies range from simple least recently used (LRU) and least frequently used (LFU) algorithms to more advanced ones denoted as LFU-dynamic lifespan (LFU-DL), Adaptive replacement cache (ARC) and Greedy-dual size frequency (GDSF). Our results show that the ARC policy always outperforms the other policies due to its adaptive nature and its ability to track changes in the traffic patterns. On the other hand, the simple LRU policy can also achieve a caching performance which is comparable to that of the more advanced ARC policy especially for the TV-on-demand service when the potential caching gain is high. On the contrary, the simple LFU policy always shows the poorest performance. However, by applying a proper lifespan supplement under the LFU-DL policy, the caching performance can be effectively enhanced to the level achievable using ARC and LRU policies. Moreover, the GDSF policy does not outperform simple LRU or LFU-DL, especially for YouTube video clips when the potential caching gain is relatively low. The advantage of GDSF manifested in our analysis is, however, its outstanding cache space usage efficiency among the five studied caching algorithms.
|
|
| 4. |
|
|
| 5. |
|
|
