liu.seSearch for publications in DiVA
Change search
Link to record
Permanent link

Direct link
BETA
Carlsson, Niklas
Alternative names
Publications (10 of 75) Show all publications
de Leng, D., Tiger, M., Almquist, M., Almquist, V. & Carlsson, N. (2018). Second Screen Journey to the Cup: Twitter Dynamics during the Stanley Cup Playoffs. In: Proceedings of the 2nd Network Traffic Measurement and Analysis Conference (TMA): . Paper presented at Network Traffic Measurement and Analysis Conference, Vienna, Austria, 26-29 June, 2018 (pp. 1-8).
Open this publication in new window or tab >>Second Screen Journey to the Cup: Twitter Dynamics during the Stanley Cup Playoffs
Show others...
2018 (English)In: Proceedings of the 2nd Network Traffic Measurement and Analysis Conference (TMA), 2018, p. 1-8Conference paper, Oral presentation only (Refereed)
Abstract [en]

With Twitter and other microblogging services, users can easily express their opinion and ideas in short text messages. A recent trend is that users use the real-time property of these services to share their opinions and thoughts as events unfold on TV or in the real world. In the context of TV broadcasts, Twitter (over a mobile device, for example) is referred to as a second screen. This paper presents the first characterization of the second screen usage over the playoffs of a major sports league. We present both temporal and spatial analysis of the Twitter usage during the end of the National Hockey League (NHL) regular season and the 2015 Stanley Cup playoffs. Our analysis provides insights into the usage patterns over the full 72-day period and with regards to in-game events such as goals, but also with regards to geographic biases. Quantifying these biases and the significance of specific events, we then discuss and provide insights into how the playoff dynamics may impact advertisers and third-party developers that try to provide increased personalization.

Keywords
Second Screen, Social Media, Twitter, National Hockey League, Personalization
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-148431 (URN)10.23919/TMA.2018.8506531 (DOI)000454696100018 ()978-3-903176-09-6 (ISBN)978-1-5386-7152-8 (ISBN)
Conference
Network Traffic Measurement and Analysis Conference, Vienna, Austria, 26-29 June, 2018
Funder
CUGS (National Graduate School in Computer Science)Swedish Research Council
Note

Funding agencies:  Swedish Research Council (VR); National Graduate School in Computer Science, Sweden (CUGS) Swedish Research Council (VR); National Graduate School in Computer Science, Sweden (CUGS)

Available from: 2018-06-11 Created: 2018-06-11 Last updated: 2019-01-21
Vapen, A., Carlsson, N., Mahanti, A. & Shahmehri, N. (2016). A Look at the Third-Party Identity Management Landscape. IEEE Internet Computing, 20(2), 18-25
Open this publication in new window or tab >>A Look at the Third-Party Identity Management Landscape
2016 (English)In: IEEE Internet Computing, ISSN 1089-7801, E-ISSN 1941-0131, Vol. 20, no 2, p. 18-25Article in journal (Refereed) Published
Abstract [en]

Many websites act as relying parties (RPs) by allowing access to their services via third-party identity providers (IDPs), such as Facebook and Google. Using IDPs simplifies account creation, login activity, and information sharing across websites. However, different websites use of IDPs can have significant security and privacy implications for users. Here, the authors provide an overview of third-party identity managements current landscape. Using datasets collected through manual identification and large-scale crawling, they answer questions related to which sites act as RPs, which sites are the most successful IDPs, and how different classes of RPs select their IDPs.

Place, publisher, year, edition, pages
IEEE COMPUTER SOC, 2016
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:liu:diva-127053 (URN)10.1109/MIC.2016.38 (DOI)000372015500003 ()
Available from: 2016-04-13 Created: 2016-04-13 Last updated: 2018-01-10
Hiran, R., Carlsson, N. & Shahmehri, N. (2016). Does Scale, Size, and Locality Matter?: Evaluation of Collaborative BGP Security Mechanisms. In: 2016 IFIP NETWORKING CONFERENCE (IFIP NETWORKING) AND WORKSHOPS: . Paper presented at IFIP Networking Conference (IFIP Networking) and Workshops, Vienna, Austria, May 2016 (pp. 261-269). IEEE
Open this publication in new window or tab >>Does Scale, Size, and Locality Matter?: Evaluation of Collaborative BGP Security Mechanisms
2016 (English)In: 2016 IFIP NETWORKING CONFERENCE (IFIP NETWORKING) AND WORKSHOPS, IEEE , 2016, p. 261-269Conference paper, Published paper (Refereed)
Abstract [en]

The Border Gateway Protocol (BGP) was not designed with security in mind and is vulnerable to many attacks, including prefix/subprefix hijacks, interception attacks, and imposture attacks. Despite many protocols having been proposed to detect or prevent such attacks, no solution has been widely deployed. Yet, the effectiveness of most proposals relies on largescale adoption and cooperation between many large Autonomous Systems (AS). In this paper we use measurement data to evaluate some promising, previously proposed techniques in cases where they are implemented by different subsets of ASes, and answer questions regarding which ASes need to collaborate, the importance of the locality and size of the participating ASes, and how many ASes are needed to achieve good efficiency when different subsets of ASes collaborate. For our evaluation we use topologies and routing information derived from real measurement data. We consider collaborative detection and prevention techniques that use (i) prefix origin information, (ii) route path updates, or (iii) passively collected round-trip time (RTT) information. Our results and answers to the above questions help determine the effectiveness of potential incremental rollouts, incentivized or required by regional legislation, for example. While there are differences between the techniques and two of the three classes see the biggest benefits when detection/prevention is performed close to the source of an attack, the results show that significant gains can be achieved even with only regional collaboration.

Place, publisher, year, edition, pages
IEEE, 2016
National Category
Computer Sciences Communication Systems
Identifiers
urn:nbn:se:liu:diva-129430 (URN)10.1109/IFIPNetworking.2016.7497237 (DOI)000383224900030 ()978-3-9018-8283-8 (ISBN)
Conference
IFIP Networking Conference (IFIP Networking) and Workshops, Vienna, Austria, May 2016
Available from: 2016-06-19 Created: 2016-06-19 Last updated: 2018-01-10
Vapen, A., Carlsson, N. & Shahmehri, N. (2016). Longitudinal Analysis of the Third-party Authentication Landscape. In: : . Paper presented at NDSS Workshop on Understanding and Enhancing Online Privacy Workshop (UEOP@NDSS).21-24 February 2016 Catamaran Resort Hotel & Spa in San Diego, California. Internet Society
Open this publication in new window or tab >>Longitudinal Analysis of the Third-party Authentication Landscape
2016 (English)Conference paper, Published paper (Refereed)
Abstract [en]

Many modern websites offer single sign-on (SSO) services, which allow the user to use an existing account with a third-party website such as Facebook to authenticate. When using SSO the user must approve an app-rights agreement that specifies what data related to the user can be shared between the two websites and any actions (e.g., posting comments) that the origin website is allowed to perform on behalf of the user on the third-party provider (e.g., Facebook). Both cross-site data sharing and actions performed on behalf of the user can have significant privacy implications. In this paper we present a longitudinal study of the third-party authentication landscape, its structure, and the protocol usage, data sharing, and actions associated with individual third-party relationships. The study captures the current state, changes in the structure, protocol usage, and information leakage risks.

Place, publisher, year, edition, pages
Internet Society, 2016
National Category
Computer Systems
Identifiers
urn:nbn:se:liu:diva-127301 (URN)1-891562-44-4 (ISBN)
Conference
NDSS Workshop on Understanding and Enhancing Online Privacy Workshop (UEOP@NDSS).21-24 February 2016 Catamaran Resort Hotel & Spa in San Diego, California
Note

DOI does not work: 10.14722/ueop.2016.23008

Available from: 2016-04-19 Created: 2016-04-19 Last updated: 2018-09-20Bibliographically approved
Linder, T., Persson, P., Forsberg, A., Danielsson, J. & Carlsson, N. (2016). On Using Crowd-sourced Network Measurements for Performance Prediction. In: Proc. IEEE/IFIP Wireless On-demand Network Systems and Services Conference (IEEE/IFIP WONS), Cortina d'Ampezzo, Italy, Jan. 2016.: . Paper presented at Proc. IEEE/IFIP Wireless On-demand Network Systems and Services Conference (IEEE/IFIP WONS), Cortina d'Ampezzo, Italy, Jan. 2016. (pp. 1-8). IEEE Computer Society Digital Library
Open this publication in new window or tab >>On Using Crowd-sourced Network Measurements for Performance Prediction
Show others...
2016 (English)In: Proc. IEEE/IFIP Wireless On-demand Network Systems and Services Conference (IEEE/IFIP WONS), Cortina d'Ampezzo, Italy, Jan. 2016., IEEE Computer Society Digital Library, 2016, p. 1-8Conference paper, Published paper (Refereed)
Abstract [en]

Geo-location-based bandwidth prediction together with careful download scheduling for mobile clients can be used to minimize download times, reduce energy usage, and improve streaming performance. Although crowd-sourced measurements provide an important prediction tool, little is known about the prediction accuracy and improvements such datasets can provide. In this paper we use a large-scale crowd-sourced dataset from Bredbandskollen, Sweden's primary speedtest service, to evaluate the prediction accuracy and achievable performance improvements with such data. We first present a scalable performance map methodology that allows fast insertion/retrieval of geo-sparse measurements, and use this methodology to characterize the Bredbandskollen usage. Second, we analyze the bandwidth variations and predictability of the download speeds observed within and across different locations, when accounting for various factors. Third, we evaluate the relative performance improvements achievable by users leveraging different subsets of measurements (capturing effects of limited sharing or filtering based on operator, network technology, or both) when predicting opportune locations to perform downloads. Our results are encouraging for both centralized and peer-to-peer performance map solutions. For example, most measurements are done in locations with many measurements and good prediction accuracy, and further improvements are possible through filtering (e.g., based on operator and technology) or limited information sharing.

Place, publisher, year, edition, pages
IEEE Computer Society Digital Library, 2016
National Category
Computer Sciences Communication Systems
Identifiers
urn:nbn:se:liu:diva-129427 (URN)000377341500005 ()978-3-901882-79-1 (ISBN)
Conference
Proc. IEEE/IFIP Wireless On-demand Network Systems and Services Conference (IEEE/IFIP WONS), Cortina d'Ampezzo, Italy, Jan. 2016.
Available from: 2016-06-19 Created: 2016-06-19 Last updated: 2018-03-26
Carlsson, N. (2016). Optimized eeeBond: Energy Efficiency with non-Proportional Router Network Interfaces. In: PROCEEDINGS OF THE 2016 ACM/SPEC INTERNATIONAL CONFERENCE ON PERFORMANCE ENGINEERING (ICPE'16): . Paper presented at 7th ACM/SPEC International Conference on Performance Engineering (ICPE) (pp. 215-223). ACM Digital Library
Open this publication in new window or tab >>Optimized eeeBond: Energy Efficiency with non-Proportional Router Network Interfaces
2016 (English)In: PROCEEDINGS OF THE 2016 ACM/SPEC INTERNATIONAL CONFERENCE ON PERFORMANCE ENGINEERING (ICPE'16), ACM Digital Library, 2016, p. 215-223Conference paper, Published paper (Refereed)
Abstract [en]

The recent Energy Efficient Ethernet (EEE) standard and the eBond protocol provide two orthogonal approaches that allow significant energy savings on routers. In this paper we present the modeling and performance evaluation of these two protocols and a hybrid protocol. We first present eeeBond, pronounced ``triple-e bond'', which combines the eBond capability to switch between multiple redundant interfaces with EEE's active/idle toggling capability implemented in each interface. Second, we present an analytic model of the protocol performance, and derive closed-form expressions for the optimized parameter settings of both eBond and eeeBond. Third, we present a performance evaluation that characterizes the relative performance gains possible with the optimized protocols, as well as a trace-based evaluation that validates the insights from the analytic model. Our results show that there are significant advantages to combine eBond and EEE. The eBond capability provides good savings when interfaces only offer small energy savings when in short-term sleep states, and the EEE capability is important as short-term sleep savings improve.

Place, publisher, year, edition, pages
ACM Digital Library, 2016
National Category
Computer Sciences Communication Systems
Identifiers
urn:nbn:se:liu:diva-129429 (URN)10.1145/2851553.2851564 (DOI)000389809200032 ()978-1-4503-4080-9 (ISBN)
Conference
7th ACM/SPEC International Conference on Performance Engineering (ICPE)
Available from: 2016-06-19 Created: 2016-06-19 Last updated: 2018-01-10
Gopinathan, A., Carlsson, N., Li, Z. & Wu, C. (2016). Revenue-maximizing and Truthful Online Auctions for Dynamic Spectrum Access. In: 2016 12TH ANNUAL CONFERENCE ON WIRELESS ON-DEMAND NETWORK SYSTEMS AND SERVICES (WONS): . Paper presented at 12th Annual Conference on Wireless On-demand Network Systems and Services (WONS) (pp. 1-8). IEEE
Open this publication in new window or tab >>Revenue-maximizing and Truthful Online Auctions for Dynamic Spectrum Access
2016 (English)In: 2016 12TH ANNUAL CONFERENCE ON WIRELESS ON-DEMAND NETWORK SYSTEMS AND SERVICES (WONS), IEEE , 2016, p. 1-8Conference paper, Published paper (Refereed)
Abstract [en]

Secondary spectrum auctions have been suggested as a strategically robust mechanism for distributing idle spectrum to competing secondary users. However, previous work on such auction design have assumed a static auction setting, thus failing to fully exploit the inherently time-varying nature of spectrum demand and utilization. In this paper, we address this issue from the perspective of the primary user who wishes to maximize the auction revenue. We present an online auction framework that dynamically accepts bids and allocates spectrum. We prove rigorously that our online auction framework is truthful in the multiple dimensions of bid values, as well as bid timing parameters. To protect against unbounded loss of revenue due to latter bids, we introduce controlled preemption into our mechanism. We prove that preemption, coupled with the technique of inflating bids artificially, leads to an online auction that guarantees a 1/5-fraction of the optimal revenue as obtained by an offline adversary. Since the previous guarantee holds only for the optimal channel allocation, we further provide a greedy channel allocation scheme which provides scalability. We prove that the greedy scheme also obtains a constant competitive revenue guarantee, where the constant depends on the parameter of the conflict graph.

Place, publisher, year, edition, pages
IEEE, 2016
National Category
Telecommunications
Identifiers
urn:nbn:se:liu:diva-130078 (URN)000377341500001 ()978-3-901882-79-1 (ISBN)
Conference
12th Annual Conference on Wireless On-demand Network Systems and Services (WONS)
Available from: 2016-07-06 Created: 2016-07-06 Last updated: 2017-03-16
Krishnamoorthi, V., Carlsson, N., Eager, D., Mahanti, A. & Shahmehri, N. (2015). Bandwidth-aware Prefetching for Proactive Multi-video Preloading and Improved HAS Performance. In: Proceedings of the ACM International Conference on Multimedia (ACM Multimedia): . Paper presented at ACM Multimedia 2015 (pp. 551-560). New York, USA: Association for Computing Machinery (ACM)
Open this publication in new window or tab >>Bandwidth-aware Prefetching for Proactive Multi-video Preloading and Improved HAS Performance
Show others...
2015 (English)In: Proceedings of the ACM International Conference on Multimedia (ACM Multimedia), New York, USA: Association for Computing Machinery (ACM), 2015, p. 551-560Conference paper, Published paper (Refereed)
Abstract [en]

This paper considers the problem of providing users playing one streaming video the option of instantaneous and seamless playback of alternative videos. Recommendation systems can easily provide a list of alternative videos, but there is little research on how to best eliminate the startup time for these alternative videos. The problem is motivated by services that want to retain increasingly impatient users, who frequently watch the beginning of multiple videos, before viewing a video to the end. We present the design, implementation, and evaluation of an HTTP-based Adaptive Streaming (HAS) solution that provides careful prefetching and buffer management. We also present the design and evaluation of three fundamental policy classes that provide different tradeoffs between how aggressively new alternative videos are prefetched versus the importance of ensuring high playback quality. We show that our solution allows us to reduce the startup times of alternative videos by an order of magnitude and effectively adapt the quality such as to ensure the highest possible playback quality of the video being viewed. By improving the channel utilization we also address the discrimination problem that HAS clients often suffer from, allowing us to in some cases simultaneously improve the playback quality of the video being viewed and provide the value-added service of allowing instantaneous playback of the prefetched alternative videos.

Place, publisher, year, edition, pages
New York, USA: Association for Computing Machinery (ACM), 2015
Keywords
HTTP-based adaptive streaming (HAS); Bandwidth-aware prefetching; Multi-video preloading; Seamless playback
National Category
Computer Systems
Identifiers
urn:nbn:se:liu:diva-128168 (URN)10.1145/2733373.2806270 (DOI)000387861300064 ()978-1-4503-3459-4 (ISBN)
Conference
ACM Multimedia 2015
Available from: 2016-05-20 Created: 2016-05-19 Last updated: 2018-02-06
Hiran, R., Carlsson, N. & Shahmehri, N. (2015). Crowd-based Detection of Routing Anomalies on the Internet. In: Proc. IEEE Conference on Communications and Network Security (IEEE CNS), Florence, Italy, Sept. 2015.: . Paper presented at Proc. IEEE Conference on Communications and Network Security (IEEE CNS), Florence, Italy, Sept. 2015. (pp. 388-396). IEEE Computer Society Digital Library
Open this publication in new window or tab >>Crowd-based Detection of Routing Anomalies on the Internet
2015 (English)In: Proc. IEEE Conference on Communications and Network Security (IEEE CNS), Florence, Italy, Sept. 2015., IEEE Computer Society Digital Library, 2015, p. 388-396Conference paper, Published paper (Refereed)
Abstract [en]

The Internet is highly susceptible to routing attacks and there is no universally deployed solution that ensures that traffic is not hijacked by third parties. Individuals or organizations wanting to protect themselves from sustained attacks must therefore typically rely on measurements and traffic monitoring to detect attacks. Motivated by the high overhead costs of continuous active measurements, we argue that passive monitoring combined with collaborative information sharing and statistics can be used to provide alerts about traffic anomalies that may require further investigation. In this paper we present and evaluate a user-centric crowd-based approach in which users passively monitor their network traffic, share information about potential anomalies, and apply combined collaborative statistics to identify potential routing anomalies. The approach uses only passively collected round-trip time (RTT) measurements, is shown to have low overhead, regardless if a central or distributed architecture is used, and provides an attractive tradeoff between attack detection rates (when there is an attack) and false alert rates (needing further investigation) under normal conditions. Our data-driven analysis using longitudinal and distributed RTT measurements also provides insights into detector selection and the relative weight that should be given to candidate detectors at different distances from the potential victim node.

Place, publisher, year, edition, pages
IEEE Computer Society Digital Library, 2015
National Category
Communication Systems
Identifiers
urn:nbn:se:liu:diva-129426 (URN)10.1109/CNS.2015.7346850 (DOI)000380401800048 ()978-1-4673-7876-5 (ISBN)
Conference
Proc. IEEE Conference on Communications and Network Security (IEEE CNS), Florence, Italy, Sept. 2015.
Available from: 2016-06-19 Created: 2016-06-19 Last updated: 2017-03-16
James, C. & Carlsson, N. (2015). Green Domino Incentives: Impact of Energy-aware Adaptive Link Rate Policies in Routers. In: Proc. ACM/SPEC International Conference on Performance Engineering (ACM/SPEC ICPE): . Paper presented at Proc. ACM/SPEC International Conference on Performance Engineering (ACM/SPEC ICPE), Austin, TX, Jan/Feb. 2015. (pp. 211-221). Association for Computing Machinery (ACM)
Open this publication in new window or tab >>Green Domino Incentives: Impact of Energy-aware Adaptive Link Rate Policies in Routers
2015 (English)In: Proc. ACM/SPEC International Conference on Performance Engineering (ACM/SPEC ICPE), Association for Computing Machinery (ACM), 2015, p. 211-221Conference paper, Published paper (Refereed)
Abstract [en]

To reduce energy consumption of lightly loaded routers, operators are increasingly incentivized to use Adaptive Link Rate (ALR) policies and techniques. These techniques typically save energy by adapting link service rates or by identifying opportune times to put interfaces into low-power sleep/idle modes. In this paper, we present a trace-based analysis of the impact that a router implementing these techniques has on the neighboring routers. We show that policies adapting the service rate at larger time scales, either by changing the service rate of the link interface itself or by changing which redundant heterogeneous link is active, typically have large positive effects on neighboring routers, with the downstream routers being able to achieve up-to 30% additional energy savings due to the upstream routers implementing ALR policies. Policies that save energy by temporarily placing the interface in a low-power sleep/idle mode, typically has smaller, but positive, impact on neighboring routers. Best are hybrid policies that use a combination of these two techniques. The hybrid policies consistently achieve the biggest energy savings, and have positive cascading effects on surrounding routers. Our results show that implementation of ALR policies can contribute to large-scale positive domino incentive effects, as they further increase the potential energy savings seen by those neighboring routers that consider implementing ALR techniques, while satisfying performance guarantees on the routers themselves.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2015
Keywords
Energy Efficiency; Adaptive Link Rate; Energy Proportional Computing; Router Performance
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-118739 (URN)10.1145/2668930.2688045 (DOI)978-1-4503-3248-4 (ISBN)
Conference
Proc. ACM/SPEC International Conference on Performance Engineering (ACM/SPEC ICPE), Austin, TX, Jan/Feb. 2015.
Available from: 2015-06-03 Created: 2015-06-03 Last updated: 2018-07-17
Organisations

Search in DiVA

Show all publications