| 1. |
|
|
| 2. |
|
|
| 3. |
|
|
| 4. |
- Abrahamsson, Henrik, et al.
(författare)
-
Connected Vehicles in Cellular Networks : Multi-Access Versus Single-Access Performance
- 2018
-
Ingår i: TMA 2018 - Proceedings of the 2nd Network Traffic Measurement and Analysis Conference. - : Institute of Electrical and Electronics Engineers Inc.. - 9783903176096
-
Konferensbidrag (refereegranskat)abstract
- Connected vehicles can make roads traffic safer and more efficient, but require the mobile networks to handle time-critical applications. Using the MONROE mobile broadband measurement testbed we conduct a multi-access measurement study on buses. The objective is to understand what network performance connected vehicles can expect in today's mobile networks, in terms of transaction times and availability. The goal is also to understand to what extent access to several operators in parallel can improve communication performance. In our measurement experiments we repeatedly transfer warning messages from moving buses to a stationary server. We triplicate the messages and always perform three transactions in parallel over three different cellular operators. This creates a dataset with which we can compare the operators in an objective way and with which we can study the potential for multi-access. In this paper we use the triple-access dataset to evaluate single-access selection strategies, where one operator is chosen for each transaction. We show that if we have access to three operators and for each transaction choose the operator with best access technology and best signal quality then we can significantly improve availability and transaction times compared to the individual operators. The median transaction time improves with 6% compared to the best single operator and with 61% compared to the worst single operator. The 90-percentile transaction time improves with 23% compared to the best single operator and with 65% compared to the worst single operator.
|
|
| 5. |
|
|
| 6. |
- Abrahamsson, Henrik, et al.
(författare)
-
From QoS provisioning to QoS charging
- 2002. - 1
-
Ingår i: Proceedings of the Second International Workshop on Internet Charging and QoS Technologies, ICQT 2002. ; , s. 135-144
-
Konferensbidrag (refereegranskat)
|
|
| 7. |
- Abrahamsson, Henrik
(författare)
-
Network overload avoidance by traffic engineering and content caching
- 2012
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- The Internet traffic volume continues to grow at a great rate, now driven by video and TV distribution. For network operators it is important to avoid congestion in the network, and to meet service level agreements with their customers. This thesis presents work on two methods operators can use to reduce links loads in their networks: traffic engineering and content caching.This thesis studies access patterns for TV and video and the potential for caching. The investigation is done both using simulation and by analysis of logs from a large TV-on-Demand system over four months.The results show that there is a small set of programs that account for a large fraction of the requests and that a comparatively small local cache can be used to significantly reduce the peak link loads during prime time. The investigation also demonstrates how the popularity of programs changes over time and shows that the access pattern in a TV-on-Demand system very much depends on the content type.For traffic engineering the objective is to avoid congestion in the network and to make better use of available resources by adapting the routing to the current traffic situation. The main challenge for traffic engineering in IP networks is to cope with the dynamics of Internet traffic demands.This thesis proposes L-balanced routings that route the traffic on the shortest paths possible but make sure that no link is utilised to more than a given level L. L-balanced routing gives efficient routing of traffic and controlled spare capacity to handle unpredictable changes in traffic. We present an L-balanced routing algorithm and a heuristic search method for finding L-balanced weight settings for the legacy routing protocols OSPF and IS-IS. We show that the search and the resulting weight settings work well in real network scenarios.
|
|
| 8. |
|
|
| 9. |
- Abrahamsson, Henrik, et al.
(författare)
-
Temporal Characteristics of Large IP Traffic Flows
- 2003. - 1
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- Several studies of Internet traffic have shown that it is a small percentage of the flows that dominate the traffic. This is often referred to as the mice and elephants phenomenon. It has been proposed that this might be one of very few invariants of Internet traffic and that this property could somehow be used for traffic engineering purposes. The idea being that one in a scalable way could control a major part of the traffic by only keeping track of a small number of flows. But for this the large flows must also be stable in the meaning that they should be among the largest flows during long periods of time. In this work we analyse packet traces of Internet traffic and study the temporal characteristics of large aggregated traffic flows defined by destination address prefixes.
|
|
| 10. |
- Abrahamsson, Henrik, et al.
(författare)
-
Traffic Characteristics on 1Gbit/s Access Aggregation Links
- 2017
-
Konferensbidrag (refereegranskat)abstract
- Large network operators have thousands or tens of thousands of access aggregation links that they need to manage and dimension properly. Measuring and understanding the traffic characteristics on these type of links are therefore essential. What do the traffic intensity characteristics look like on different timescales from days down to milliseconds? How do the characteristics differ if we compare links with the same capacity but with different type of clients and access technologies? How do the traffic characteristics differ from that on core network links? These are the type of questions we set out to investigate in this paper. We present the results of packet level measurements on three different 1Gbit/s aggregation links in an operational IP network. We see large differences in traffic characteristics between the three links. We observe highly skewed link load probability densities on timescales relevant for buffering (i.e. 10-milliseconds). We demonstrate the existence of large traffic spikes on short timescales (10-100ms) and show their impact on link delay. We also found that these traffic bursts often are caused by only one or a few IP flows.
|
|
