hkr.sePublications
Change search
Link to record
Permanent link

Direct link
BETA
Arvidsson, Ake
Alternative names
Publications (10 of 21) Show all publications
Robert, R., Atxutegi, E., Arvidsson, Å., Liberal, F., Brunström, A. & Grinnemo, K.-J. (2016). Behaviour of Common TCP Variants over LTE. In: IEEE Globecom 2016: Mobile and Wireless Networks Symposium. Paper presented at IEEE Globecom 2016, Washington.
Open this publication in new window or tab >>Behaviour of Common TCP Variants over LTE
Show others...
2016 (English)In: IEEE Globecom 2016: Mobile and Wireless Networks Symposium, 2016Conference paper, Published paper (Refereed)
Abstract [en]

This paper presents our work regarding the comparison of the behaviour of some of the major TCP variants in a LTE network. Using the LENA LTE simulator and the DCE framework, the behaviour of the Linux implementations of seven TCP variants are compared. The evolution of the throughput, congestion window and queuing delay are studied for four scenarios with different network loads and flow types. Our measurements show that, in the situations we consider, most variants are able to quickly reach full link utilisation. However, to reach the same throughput, they create different amounts of queuing delay. On the one hand, loss based algorithms tend to totally fill the queue, creating huge queuing delays and inducing packet losses. On the other hand, delay based variants manage to limit the queue size and decrease the amount of packet dropped by the eNodeB but struggle to reach the maximum throughput in some circumstances.

Series
IEEE Global Communications Conference, ISSN 2334-0983
Keywords
TCP, performance, LTE/EPC, NS-3, DCE
National Category
Computer Systems
Identifiers
urn:nbn:se:hkr:diva-15851 (URN)000401963300142 ()978-1-5090-1328-9 (ISBN)
Conference
IEEE Globecom 2016, Washington
Available from: 2016-08-30 Created: 2016-08-30 Last updated: 2019-09-06Bibliographically approved
Atxutegi, E., Liberal, F., Grinnemo, K.-J., Brunström, A., Arvidsson, Å. & Robert, R. (2016). TCP behaviour in LTE: impact of flow start-up and mobility. In: Wireless and Mobile Networking Conference (WMNC), 2016 9th IFIP: . Paper presented at 9th IFIP Wireless and Mobile Networking Conference (WMNC), Colmar (pp. 73-80). IEEE Communications Society
Open this publication in new window or tab >>TCP behaviour in LTE: impact of flow start-up and mobility
Show others...
2016 (English)In: Wireless and Mobile Networking Conference (WMNC), 2016 9th IFIP, IEEE Communications Society, 2016, p. 73-80Conference paper, Published paper (Refereed)
Abstract [en]

Mobile internet has been widely adopted and it is expected to rise to almost 4 billion users by 2020. Despite the research effort dedicated to the enhancement of its performance, there still exists a gap in the understanding of how TCP and its many variants work over LTE. To this end, this paper evaluates the extent to which five common TCP variants, CUBIC, NewReno,Westwood+, Illinois, and CAIA Delay Gradient (CDG), are able to utilise available radio resources under hard conditions, such as during start-up and in mobile scenarios at different speeds. The paper suggests that CUBIC, due to its Hybrid Slow-Start mechanism, enters congestion avoidance prematurely, and thus experiences a prolonged start-up phase. As a result, it is unable to efficiently utilise radio resources during shorter transmissionsessions. Besides, CUBIC, Illinois and NewReno, i.e., the loss-based TCP implementations, offer better throughput, and are able to better utilise available resources during mobility than Westwood+ and CDG - the delay-based variants do.

Place, publisher, year, edition, pages
IEEE Communications Society, 2016
Keywords
Data models, Delays, Mobile communication, Mobile computing, Throughput, Wireless communication;Hybrid Slow-Start;LTE;Slow-Start;, TCP adaptability, mobility
National Category
Computer Systems
Identifiers
urn:nbn:se:hkr:diva-15849 (URN)10.1109/WMNC.2016.7543932 (DOI)000383221300010 ()978-1-4673-8746-0 (ISBN)978-1-4673-8747-7 (ISBN)
Conference
9th IFIP Wireless and Mobile Networking Conference (WMNC), Colmar
Available from: 2016-08-30 Created: 2016-08-30 Last updated: 2019-09-06Bibliographically approved
Andersson, J. A., Arvidsson, A., Du, M., Zhang, H., Kihl, M., Host, S. & Lagerstedt, C. (2016). User profiling for pre-fetching or caching in a catch-Up TV network. In: 2016 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB): . Paper presented at 11th IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB), JUN 01-03, 2016, Nara, JAPAN.
Open this publication in new window or tab >>User profiling for pre-fetching or caching in a catch-Up TV network
Show others...
2016 (English)In: 2016 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB), 2016Conference paper, Published paper (Refereed)
Abstract [en]

We investigate the potential of different pre-fetching and/or caching strategies for different user behaviour with respect to surfing or browsing in a catch-up-TV network. To this end we identify accounts and channels associated with strong or weak surfing or browsing respectively and study the distributions of hold times for the different types of behaviour. Finally we present results from a request prediction model and a caching simulation for the different types of behaviour and find that the results are relatively similar.

Series
IEEE International Symposium on Broadband Multimedia Systems and Broadcasting, ISSN 2155-5044
Keywords
IPTV service, scheme
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:hkr:diva-16158 (URN)000382920900086 ()978-1-4673-9044-6 (ISBN)
Conference
11th IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB), JUN 01-03, 2016, Nara, JAPAN
Available from: 2016-10-06 Created: 2016-10-06 Last updated: 2019-09-06Bibliographically approved
Du, M., Kihl, M., Arvidsson, Å., Lagerstedt, C. & Gawler, A. (2015). Analysis of prefetching schemes for TV-on-Demand service. In: Tapio Saarelainen (Ed.), ICDT 2015 : the Tenth International Conference on Digital Telecommunications: . Paper presented at ICDT 2015 : The Tenth International Conference on Digital Telecommunications. International Academy, Research and Industry Association (IARIA)
Open this publication in new window or tab >>Analysis of prefetching schemes for TV-on-Demand service
Show others...
2015 (English)In: ICDT 2015 : the Tenth International Conference on Digital Telecommunications / [ed] Tapio Saarelainen, International Academy, Research and Industry Association (IARIA), 2015Conference paper, Published paper (Refereed)
Abstract [en]

TV-on-Demand service has become one of the most popular Internet applications that continuously attracts higher user interests. With rapidly increasing user demand, the existing network conditions may not be able to ensure low start-up delay of video playback. Prefetching has been broadly investigated to cope with the start-up latency problem which is also known as user perceived latency. In this paper, we analyse request patterns for TV programs from a popular Swedish TV service provider over 11 weeks. According to the analysis, we propose a prefetching scheme at the user end to preload videos before user requests. Our prefetching scheme significantly improves the cache hit ratio compared to terminal caching and we note that there is a potential to further improve prefetching performance by customizing prefetching schemes for different video categories. We further present a cost model to determine the optimal number of videos to prefetch. Finally, we discuss available time for prefetching and suggest that when to make prefetching decisions depends on the user demand patterns of different video categories.

Place, publisher, year, edition, pages
International Academy, Research and Industry Association (IARIA), 2015
Keywords
TV-on-Demand services, user perceived latency, prefetching
National Category
Computer Systems
Identifiers
urn:nbn:se:hkr:diva-14735 (URN)978-1-61208-396-4 (ISBN)
External cooperation:
Conference
ICDT 2015 : The Tenth International Conference on Digital Telecommunications
Available from: 2015-09-23 Created: 2015-09-23 Last updated: 2019-09-06Bibliographically approved
Arvidsson, Å. & Rydén, T. (2015). Load transients in pooled cellular core network nodes. Performance evaluation (Print), 90, 18-35
Open this publication in new window or tab >>Load transients in pooled cellular core network nodes
2015 (English)In: Performance evaluation (Print), ISSN 0166-5316, E-ISSN 1872-745X, Vol. 90, p. 18-35Article in journal (Refereed) Published
Abstract [en]

The coverage areas of cellular networks are logically subdivided into service areas. Each service area has a local anchor node which “hides” the mobility inside the area and the entire network has a global anchor node which “hides” the mobility between areas.

The concept of unique local anchor nodes per service area was invented to simplify routing but has been found to complicate expansion. The rapidly growing demand for cellular access has therefore prompted for alternative solutions with pools of local anchor nodes per service area. Such pools are now deployed by several operators all over the world.

Users in pooled service areas are mapped to specific pool members according to a load distribution policy, but the mapping can change as a result of node failures or operator interventions. Such changes take a certain time to implement and cause additional load on the anchor nodes. We study these processes in detail and derive closed form expressions which allow operators to control the trade-off between rapid changes and acceptable loads.

Finally we show that the key assumptions of our model are in agreement with measured data and demonstrate how the model can be applied to investigate the effects of different network settings (timers) under different user behaviour (traffic and mobility).

Contrary to current solutions to this problem, which typically are slow and/or inaccurate, our results enable fast and accurate analysis of different scenarios thereby enabling operators to maximise utilisation of the existing investments and at the same time avoid potentially dangerous situations of overload.

Keywords
Iu-flex, S1-flex, pool, node failure, user redistribution
National Category
Computer Systems
Identifiers
urn:nbn:se:hkr:diva-13938 (URN)10.1016/j.peva.2015.04.001 (DOI)000358092200002 ()
Available from: 2015-05-25 Created: 2015-05-25 Last updated: 2019-09-06Bibliographically approved
Du, M., Kihl, M., Arvidsson, A., Zhang, H., Lagerstedt, C. & Gawler, A. (2015). Prefetching schemes and performance analysis for TV on demand services. International Journal On Advances in Telecommunications, 8(3&4), 162-172
Open this publication in new window or tab >>Prefetching schemes and performance analysis for TV on demand services
Show others...
2015 (English)In: International Journal On Advances in Telecommunications, ISSN 1942-2601, E-ISSN 1942-2601, Vol. 8, no 3&4, p. 162-172Article in journal (Refereed) Published
Abstract [en]

TV-on-Demand services have become one of the most popular Internet applications that continuously attracts high user interest. With rapidly increasing user demands, the existing network conditions may not be able to ensure a low start-up delay of video playback. Prefetching has been broadly investigated to cope with the start-up latency problem, which is also known as user perceived latency. In this paper, two datasets from different IPTV providers are used to analyse the TV program request patterns. According to the results, we propose a prefetching scheme at the user end to preload videos before user requests. For both datasets, our prefetching scheme significantly improves the cache hit ratio compared to passive caching and we note that there is a potential to further improve prefetching performance by customizing prefetching schemes for different video categories. We further present a cost model to determine the optimal number of videos to prefetch. We also discuss if there is enough time for prefetching. Finally, more factors, which may have an impact onoptimizing prefetching performance, are further discussed, such as the jump patterns over different time in a day and the the distribution of each video’s viewing length.

Keywords
User perceived latency, prefetching, jump patterns over time, viewing fractions
National Category
Computer Systems
Identifiers
urn:nbn:se:hkr:diva-15852 (URN)
Available from: 2016-08-30 Created: 2016-08-30 Last updated: 2017-11-21Bibliographically approved
Kihl, M., Larsson, R., Unnervik, N., Haberkamm, J., Arvidsson, Å. & Aurelius, A. (2014). Analysis of Facebook content demand patterns. In: Said Hoceini, Guang-Jie Ren och Eva Marín-Tordera (Ed.), SaCoNet 2014: . Paper presented at SaCoNet 2014. IEEE Communications Society
Open this publication in new window or tab >>Analysis of Facebook content demand patterns
Show others...
2014 (English)In: SaCoNet 2014 / [ed] Said Hoceini, Guang-Jie Ren och Eva Marín-Tordera, IEEE Communications Society, 2014Conference paper, Published paper (Refereed)
Abstract [en]

Data volumes in communication networks increase rapidly. Further, usage of social network applications is very wide spread among users, and among these applications, Facebook is the most popular. In this paper, we analyse user demands patterns and content popularity of Facebook generated traffic. The data comes from residential users in two metropolitan access networks in Sweden, and we analyse more than 17 million images downloaded by almost 16,000 Facebook users. We show that the distributions of image popularity and user activity may be described by Zipf distributions which is favourable for many types of caching. We also show that Facebook activity is more evenly spread over the day, compared to more defined peak hours of general Internet usage. Looking at content life time, we show that profile pictures have a relatively constant popularity while for other images there is an initial, short peak of demand, followed by a longer period of significantly lower and quite stable demand. These findings are useful for designing network andQoE optimisation solutions, such as predictive pre-fetching, proxy caching and delay tolerant networking.

Place, publisher, year, edition, pages
IEEE Communications Society, 2014
National Category
Computer Systems
Identifiers
urn:nbn:se:hkr:diva-14782 (URN)9781479951970 (ISBN)
Conference
SaCoNet 2014
Available from: 2015-09-24 Created: 2015-09-24 Last updated: 2019-09-06Bibliographically approved
Li, J., Wu, J., Dán, G., Arvidsson, Å. & Kihl, M. (2014). Performance analysis of local caching replacement policies for internet video streaming services. In: Dinko Begusi och Nikola Rozic (Ed.), SoftCOM 2014: . Paper presented at SoftCOM 2014, Split, September 17-19, 2014. IEEE Communications Society
Open this publication in new window or tab >>Performance analysis of local caching replacement policies for internet video streaming services
Show others...
2014 (English)In: SoftCOM 2014 / [ed] Dinko Begusi och Nikola Rozic, IEEE Communications Society, 2014Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
IEEE Communications Society, 2014
Keywords
Video-on-demand, cache, caching replacement policy, caching algorithm, TV-on-demand, YouTube, local access network
National Category
Computer Systems
Identifiers
urn:nbn:se:hkr:diva-14784 (URN)978-9-5329-0052-1 (ISBN)
Conference
SoftCOM 2014, Split, September 17-19, 2014
Available from: 2015-09-24 Created: 2015-09-24 Last updated: 2019-09-06Bibliographically approved
Laulajainen, J.-P., Arvidsson, Å., Ojala, T., Seppänen, J. & Du, M. (2014). Study of YouTube demand patterns in mixed public and campus WiFi network. In: Pedro Casas och Brian Trammell (Ed.), TRAC 2014: . Paper presented at TRAC 2014. IEEE Communications Society
Open this publication in new window or tab >>Study of YouTube demand patterns in mixed public and campus WiFi network
Show others...
2014 (English)In: TRAC 2014 / [ed] Pedro Casas och Brian Trammell, IEEE Communications Society, 2014Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we study traffic patterns in a large municipal WiFi network and in particular those of the most bandwidth hungry application, viz. YouTube, for which we provide a detailed analysis of demand in different geographical areas and over time. We consider the possibilities to reduce network traffic and increase Quality of Experience (QoE) by serving repeated requests for YouTube videos from caches placed either at the network head end, at the wireless access points, or in the user devices. Our data confirms that a significant part of the YouTube traffic can be served by such devices and that there exists a potential to optimize caching performance by exploiting the content demand locality. We also discover a previously unknown pattern of periodicity in content demand and present a simple example of how to exploit this in cache design.

Place, publisher, year, edition, pages
IEEE Communications Society, 2014
Keywords
Traffic analysis, wireless networks
National Category
Computer Systems
Identifiers
urn:nbn:se:hkr:diva-14785 (URN)978-1-4799-0959-9 (ISBN)
Conference
TRAC 2014
Available from: 2015-09-24 Created: 2015-09-24 Last updated: 2019-09-06Bibliographically approved
Zhang, Y., Arvidsson, Å., Siekkinen, M. & Urvoy-Keller, G. (2014). Understanding HTTP flow rates in cellular networks. In: Bjarne Helvik, Deep Medhi och Bin Liu (Ed.), Networking 2014: . Paper presented at Networking 2014. IFIP
Open this publication in new window or tab >>Understanding HTTP flow rates in cellular networks
2014 (English)In: Networking 2014 / [ed] Bjarne Helvik, Deep Medhi och Bin Liu, IFIP , 2014Conference paper, Published paper (Refereed)
Abstract [en]

Data traffic in cellular networks increased tremendously over the past few years and this growth is predicted to continue over the next few years. Due to differences in access technology and user behavior, the characteristics of cellular traffic can differ from existing results for wireline traffic. In this study we focus on understanding the flow rates and on the relationship between the rates and other flow properties by analyzing packet level traces collected in a large cellular network. To understand the limiting factors of the flow rates, we further analyze the underlying causes behind the observed rates, e.g.,network congestion, access link or end host configuration. Our study extends other related work by conducting the analysis from a unique dimension, the comparison with traffic in wired networks, to reveal the unique properties of cellular traffic. We find that they differ in variability and in the dominant rate limiting factors.

Place, publisher, year, edition, pages
IFIP, 2014
National Category
Computer Systems
Identifiers
urn:nbn:se:hkr:diva-14786 (URN)978-3-901882-58-6 (ISBN)
Conference
Networking 2014
Available from: 2015-09-24 Created: 2015-09-24 Last updated: 2019-09-06Bibliographically approved
Organisations

Search in DiVA

Show all publications