Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Patrik Arlos

dblp:47/6090 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
0since 2021 · last 2015
0000-0003-4494-9851ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 1 first-authorSecurity and privacy · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Network measurement and analytics · 77% Wireless networking · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network measurement and analytics › latency measurement
end-to-end delay estimation
0.212013
Estimating Performance of Mobile Services from Comparative Output-Input Analysis of End-to-End Throughput · IEEE Trans. Mob. Comput. 2013
Wireless networking
heterogeneous wireless networks
0.012013
Estimating Performance of Mobile Services from Comparative Output-Input Analysis of End-to-End Throughput · IEEE Trans. Mob. Comput. 2013

Methods — techniques the papers use, named apart from their topics

delay estimation · 0.2comparative output-input analysis · 0.2
YearPublicationVenuePosition
2015 Packet loss priority of cognitive radio networks with partial buffer sharing
abstract
In this paper, we consider the application of partial buffer sharing to an M/G/1/K queueing system for cognitive radio networks (CRNs). It is assumed that the CRN is subject to Nakagami-?? fading. Secondary users are allowed to utilize the licensed radio spectrum of the primary users through underlay spectrum access. A finite buffer at the secondary transmitter is partitioned into two regions, the first region serves both classes of packets while the second region serves only packets of the highest priority class. Therefore, the examined CRN can be modeled as an M/G/1/K queueing system using partial buffer sharing. An embedded Markov chain is applied to analyze the queueing behavior of the system. Utilizing the balance equations and the normalized equation, the equilibrium state distribution of the system at an arbitrary time instant can be found. This outcome is utilized to investigate the impact of queue length, arrival rates, and fading parameters on queueing performance measures such as blocking probability, throughput, mean packet transmission time, channel utilization, mean number of packets in the system, and mean packet waiting time for each class of packets.
Hoc Phan, Thi My Chinh Chu, Hans-Jürgen Zepernick, Patrik Arlos
ICC4
2015 VLQoE: Video QoE instrumentation on the smartphone
Selim Ickin, Markus Fiedler, Katarzyna Wac, Patrik Arlos, Canberk Temiz, Khadija Mkocha
Multim. Tools Appl.4
2013 Estimating Performance of Mobile Services from Comparative Output-Input Analysis of End-to-End Throughput
abstract
Mobile devices with ever-increasing functionality and the ubiquitous availability of wireless communication networks are driving forces behind innovative mobile applications enriching our daily life. One of the performance measures for a successful application deployment is the ability to support application-data flows by heterogeneous networks within certain delay boundaries. However, the quantitative impact of this measure is unknown and practically infeasible to determine at real time due to the mobile device resource constraints. We research practical methods for measurement-based performance evaluation of heterogeneous data communication networks that support mobile application-data flows. We apply the lightweight Comparative Output-Input Analysis (COIA) method estimating an additional delay based on an observation interval of interest (e.g., 1 second) induced on the flow. An additional delay is the amount of delay that exceeds nonavoidable, minimal end-to-end delay caused by the networks propagation, serialization, and transmission. We propose five COIA methods to estimate additional delay, and we validate their accuracy with measurements obtained from the existing healthcare and multimedia streaming applications. Despite their simplicity, our methods prove to be accurate in relation to an observation interval of interest, and robust under a variety of network conditions. The methods offer novel insights into application-data delays with regards to the performance of heterogeneous data communication networks.
Markus Fiedler, Katarzyna Wac, Richard Bults, Patrik Arlos
IEEE Trans. Mob. Comput.4
2011 Evaluation of throughput performance of traffic shapers
abstract
Traffic shapers are used by researchers to emulate the behavior of networks and applications in test environments, typically with user-defined traffic shaping parameters such as throughput and loss. Also, traffic shapers are used for the enforcement of SLA, so they are of interest for Internet Service Providers. However, output given by traffic shapers may not be as accurate as desired. Therefore, it is important to assess the accuracy of the implementation of traffic shapers. In this paper, we evaluate two traffic shapers with regard to the performance of their throughput shaping. For this evaluation, traces were collected. The properties of the resulting throughput at the outlet of the shaper are compared to the properties of the throughput at the inlet in combination with the preset shaper parameters. In this sense, we also compare shapers installed on Advance Micro Devices (AMD) and Intel platforms, and we use different PDU sizes and load levels to test the influence of those parameters on the shaping. We are furthermore able to deduct internal shaper parameters such as packet rate and buffer size from our measurements, and we analyse the statistical properties of the packet departure process. The extensive measurement results in this paper allow for a detailed assessment of the question whether the shaper performance is up to mark for a desired timescale. In general, the performance of both shapers and hardware platforms can be considered satisfactory on the investigated time scales between 1 ms and 1 s, with a slight advantage for NetEm on AMD.
Tahir Nawaz Minhas, Markus Fiedler, Junaid Shaikh, Patrik Arlos
IWCMC4
2011 Evaluation of protocol treatment in 3G networks
abstract
In this work, we present a systematic study of how the traffic of different transport protocols (UDP, TCP and ICMP) is treated, in three operational Swedish 3G networks. This is done by studying the impact that protocol and packet size have on the one-way-delay (OWD) across the networks. We do this using a special method that allows us to calculate the exact OWD, without having to face the usual clock synchronization problems that are normally associated with OWD calculations. From our results we see that all three protocols are treated similarly by all three operators, when we consider packet sizes that are smaller than 250 bytes and larger than 1100 bytes. We also show that larger packet sizes are given preferential treatment, with both smaller median OWD as well as a smaller standard deviation. It is also clear that, ICMP is given a better performance compared to TCP and UDP.
Patrik Arlos, Ravichandra Kommalapati, Markus Fiedler
LCN1
2010 Quantification of packet delay variation through the coefficient of throughput variation
abstract
Packet delay variation plays an important role in network performance degradation and affects the user-perceptual quality, especially in case of real-time services such as video streaming, VoIP etc. Lightweight methods for detecting network performance issues are desirable as compared to task-intensive measurement and analysis. On this background, this paper discusses the applicability of the Coefficient of Throughput Variation (CoTV) to quickly and reliably detect bottleneck behavior between two arbitrary points in a network. The CoTV can be used as a Reduced Reference Metric. It is relatively simple to calculate, compare and interpret, yet powerful to provide control feedback when facing changes in network performance. In this paper, we demonstrate above mentioned properties of the CoTV through a formula relating it to the sample interval of the throughput and the variability of the delay. The latter is shown to be detectable on time scales that are significantly larger than that of the variability itself. This observation is a key enabler for reducing the load on the device that performs the analysis due to the possibility to use large sample intervals. We also describe how difference and ratio of CoTV at outlet and inlet can be used to identify network performance issues.
Tahir Nawaz Minhas, Markus Fiedler, Patrik Arlos
IWCMC3
2010 Influence of the Packet Size on the One-Way Delay in 3G Networks
Patrik Arlos, Markus Fiedler
PAM1
2007 A Method to Estimate the Timestamp Accuracy of Measurement Hardware and Software Tools
Patrik Arlos, Markus Fiedler
PAM1