SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "L773:9789532900521 "

Search: L773:9789532900521

  • Result 1-4 of 4
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Andersson, Jens A, et al. (author)
  • Analytic Model for Cross-Layer Dependencies in VDSL2 access networks
  • 2014
  • In: 22nd International Conference on Software, Telecommunications and Computer Networks (SoftCOM), 2014. - 9781479964970 - 9789532900521 ; , s. 269-273
  • Conference paper (peer-reviewed)abstract
    • Recent changes in user employment of Internet based services, new deployment technologies for mobile networks as well as an ongoing realisation of fixed and mobile converged networks e.g. the EU FP7 project COMBO, are significant examples of enablers for increasing demands on DSL links. Investigating cross-layer dependencies between all layers in the OSI reference model becomes increasingly important. In this paper we present an analytical model and experimental results for the relation between impulse noise on a VDSL2 link and the effect this have on the network layer packet loss. We show how the packet loss rate is dependent not only on the disturbance signal level and periodicity but also on the link utilisation.
  •  
2.
  • Li, Jie, et al. (author)
  • Performance analysis of local caching replacement policies for internet video streaming services
  • 2014
  • In: SoftCOM 2014. - : IEEE Communications Society. - 9789532900521
  • Conference paper (peer-reviewed)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.
  •  
3.
  • Li, J., et al. (author)
  • Performance analysis of local caching replacement policies for internet video streaming services
  • 2014
  • In: 2014 22nd International Conference on Software, Telecommunications and Computer Networks, SoftCOM 2014. - : IEEE conference proceedings. - 9789532900521 ; , s. 341-348
  • Conference paper (peer-reviewed)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.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-4 of 4

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view