Kista, Sweden

The Swedish Institute of Computer Science, SICS, is an independent non-profit research organization with a research focus on applied computer science. The institute carries out research in a number of areas, including networked embedded systems, future Internet technologies, large scale network-based applications, and human-machine interaction. Research projects at SICS are typically carried out in cooperation with both industry and academia.In January 2005 SICS had approximately 88 employees, of which 77 are researchers and 30 have PhD degrees. The institute is located in the Kista district of Stockholm, with the main office in the Electrum building. Wikipedia.

Time filter

Source Type

Agency: European Commission | Branch: FP7 | Program: CP | Phase: ICT-2007.3.7 | Award Amount: 4.66M | Year: 2008

Research on wireless sensor networks (WSNs) is at an early stage and, to date, practical experience with deployment has been very limited. The focus of past research has been on fundamental design issues, especially on optimizing the use of scarce energy resources in battery-powered devices. Published studies show relative comparisons between alternative approaches, but there has been a dearth of research on absolute performance in WSNs. In particular, very little attention has been paid to situations where performance assurances are desirable, especially in regard to timeliness and dependability. However, many future WSN applications such as plant automation, vehicle control or health monitoring will demand a degree of certainty in their ability to respond to external stimuli. This proposal will conduct strategic research that will enable the use of WSNs in industrial environments where performance assurances are critical. Key innovations will be produced to enhance the performance and management of WSNs beyond the current state-of-the-art. Working with industry partners, the viability of the research will be demonstrated and evaluated in a large-scale industrial setting.

Agency: European Commission | Branch: FP7 | Program: CP | Phase: ICT-2007.1.1 | Award Amount: 23.39M | Year: 2008

Todays network architectures are stifling innovation, restricting it mostly to the application level while the need for structural change is increasingly evident. The absence of adequate facilities to design, optimize and interoperate new networks currently forces a convergence to an architecture that is suboptimal for many applications and that cannot support innovations within itself, the Internet.\n4WARD overcomes this impasse through a set of radical architectural approaches built on our strong mobile and wireless background.. We improve our ability to design inter-operable and complementary families of network architectures. We enable the co-existence of multiple networks on common platforms through carrier-grade virtualization for networking resources. We enhance the utility of networks by making them self-managing. We increase their robustness and efficiency by leveraging diversity. Finally we improve application support by a new information-centric paradigm in place of the old host-centric approach. These solutions will embrace the full range of technologies, from fibre backbones to wireless and sensor networks.\nThe 4WARD results will allow new markets to appear, redefining business roles and creating new economic models. We will establish the Future Internet Forum as a leading standards body, enabling these new markets and opening them for old and new players alike, increasing opportunities for competition and cooperation and creating new products and services.\nThese goals can only be achieved by gathering a strong, industry-led consortium of the leading operators, vendors, SME, and research organisations, with the determination, skills, and critical mass to create cross-industry consensus and to drive standardisation. The project is designed for multiple phases; the first one will establish the core concepts and technologies and last for two years. The planned effort of about 2200 person months corresponds to the strategic importance of this endeavour.

Agency: European Commission | Branch: FP7 | Program: CP | Phase: ICT-2007.1.1 | Award Amount: 3.91M | Year: 2008

Reaching optimising control, management and flexibility of the future network infrastructures requires actions to retrieve a good understanding of network and application behaviour. In previous EU-funded FP6 projects like EVERGROW and LOBSTER, large efforts have been taken to successfully develop and deploy measurement infrastructures (e.g. ETOMIC, DIMES) to gain insight into the operational network, without being intrusive from the perspective of commercial ISPs. Meta-repositories like MOME were dedicated to keep an overview on available measurement data, tools, infrastructures and projects. The achieved advances are integrated within the MOMENT project towards a common and open, pan-European platform by confederating participants from various FP5, FP6 and other measurement-related projects. The main objective is to design and implement a mediator architecture offering a unified interface for measurement services, able to use all data and functionalities from the existing measurement infrastructures. Main innovation of the project is the use of a measurement-specific ontology, allowing semantic representation and retrieval of measurement and monitoring information, as well as providing the flexibility of a service oriented architecture for future Internet applications. To validate the benefits of the integrated approach, the project will develop and demonstrate a set of tools and applications presenting the added value of combining measurement data collected from different infrastructures. Due to the flexible design, the achievements of the project will be open to future network architectures, rather than limited to the current Internet protocols. By liaison with international activities like CAIDA, the project ensures to have a major impact in the contribution to standardisation bodies, as well as to the overall measurement community in the Internet.

Faxen K.-F.,Swedish Institute of Computer Science
Proceedings of the International Conference on Parallel Processing | Year: 2010

This paper deals with improving the performance of fine grain task parallelism. It is often either cumbersome or impossible to increase the grain size of such programs. Increasing core counts exacerbates the problem; a program that appears coarse-grained on eight cores may well look a lot more finegrained on sixty four. In this paper we present the direct task stack, a novel work stealing algorithm with unusually low overheads, both for creating tasks and for stealing. We compare the performance of our scheduler to Cilk++, the icc implementation of OpenMP 3.0 and the Intel TBB library on an eight core, dual socket Opteron machine. We also analyze the reasons why our techniques achieve consistent speed ups over the other systems ranging from 2-3x on many fine grained workloads to over 50 in extreme cases and show quantitatively how each of the techniques we use contribute to the improved performance. © 2010 IEEE.

Abrahamsson H.,Swedish Institute of Computer Science | Nordmark M.,TeliaSonera AB
Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC | Year: 2012

Today increasingly large volumes of TV and video are distributed over IP-networks and over the Internet. It is therefore essential for traffic and cache management to understand TV program popularity and access patterns in real networks. In this paper we study access patterns in a large TV-on-Demand system over four months. We study user behaviour and program popularity and its impact on caching. The demand varies a lot in daily and weekly cycles. There are large peaks in demand, especially on Friday and Saturday evenings, that need to be handled. We see that the cacheability, the share of requests that are not first-time requests, is very high. Furthermore, there is a small set of programs that account for a large fraction of the requests. We also find that the share of requests for the top most popular programs grows during prime time, and the change rate among them decreases. This is important for caching. The cache hit ratio increases during prime time when the demand is the highest, and aching makes the biggest difference when it matters most. We also study the popularity (in terms of number of requests and rank) of individual programs and how that changes over time. Also, we see that the type of programs offered determines what the access pattern will look like. © 2012 ACM.

Mottola L.,Swedish Institute of Computer Science | Picco G.P.,University of Trento
IEEE Transactions on Mobile Computing | Year: 2011

Wireless sensor networks (WSNs) are increasingly proposed for applications characterized by many-to-many communication, where multiple sources report their data to multiple sinks. Unfortunately, mainstream WSN collection protocols are generally designed to account for a single sink and, dually, WSN multicast protocols optimize communication from a single source. In this paper, we present MUSTER, a routing protocol expressly designed for many-to-many communication. First, we devise an analytical model to compute, in a centralized manner, the optimal solution to the problem of simultaneously routing from multiple sources to multiple sinks. Next, we illustrate heuristics approximating the optimal solution in a distributed setting, and their implementation in MUSTER. To increase network lifetime, MUSTER minimizes the number of nodes involved in many-to-many routing and balances their forwarding load. We evaluate MUSTER in emulation and in a real WSN testbed. Results indicate that our protocol builds near-optimal routing paths, doubles the WSN lifetime, and overall delivers to the user 2.5 times the amount of raw data w.r.t. mainstream protocols. Moreover, MUSTER is intrinsically amenable to in-network aggregation, pushing the improvements up to a 180 percent increase in lifetime and a four-time increase in data yield. © 2006 IEEE.

Mottola L.,Swedish Institute of Computer Science | Mottola L.,University of Trento | Picco G.P.,University of Trento
ACM Computing Surveys | Year: 2011

Wireless sensor networks (WSNs) are attracting great interest in a number of application domains concerned with monitoring and control of physical phenomena, as they enable dense and untethered deployments at low cost and with unprecedented flexibility. However, application development is still one of the main hurdles to a wide adoption of WSN technology. In current real-world WSN deployments, programming is typically carried out very close to the operating system, therefore requiring the programmer to focus on low-level system issues. This not only distracts the programmer from the application logic, but also requires a technical background rarely found among application domain experts. The need for appropriate high-level programming abstractions, capable of simplifying the programming chore without sacrificing efficiency, has long been recognized, and several solutions have hitherto been proposed, which differ along many dimensions. In this article, we survey the state of the art in programming approaches forWSNs.We begin by presenting a taxonomy of WSN applications, to identify the fundamental requirements programming platforms must deal with. Then, we introduce a taxonomy of WSN programming approaches that captures the fundamental differences among existing solutions, and constitutes the core contribution of this article. Our presentation style relies on concrete examples and code snippets taken from programming platforms representative of the taxonomy dimensions being discussed. We use the taxonomy to provide an exhaustive classification of existing approaches. Moreover, we also map existing approaches back to the application requirements, therefore providing not only a complete view of the state of the art, but also useful insights for selecting the programming abstraction most appropriate to the application at hand. © 2011 ACM.

Swedish Institute of Computer Science | Date: 2010-10-20

The present invention relates to a method and system for collecting human migration data into a database (1), comprising the steps of receiving (A) information regarding the spatial movement, here called a path, or stationary position, here called a station, of a mobile device (3) in a communication network (2), from the same communication network, and associating (B) information or a sequence of information that represents a path or a station, here called a signal (11), with previously collected specific information (12) regarding an individual (4) associated with the mobile device (3). The inventive method specifically comprises the steps of de-identifying (C) the information by deleting all information 11a, 12a that can uniquely identify the mobile device (3) or the individual (4) from the signal (11) and from the specific information (12), and storing (D) the signal (11) together with the specific information (12) in the database (1), the signal (11) and personal information (12) thus being associated with each other and stored without any information (11a, 12a) that can uniquely identify the mobile device (3) or the individual (4).

Swedish Institute of Computer Science | Date: 2013-08-07

The present invention relates to a method for analyzing a periodic movement. The method comprises receiving (210) time series data from an inertial sensor used for sensing the periodic movement. The method further comprises partitioning (220) the received time series data into partitions, each partition corresponding to a period of the movement, and transforming (230) each partition into a data representation of a defined size. The method also comprises analyzing (240) the data representation of the periodic movement.

Lindgren A.,Swedish Institute of Computer Science
Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM | Year: 2011

In this demo, we describe the design and implementation of fb-DTN, a gateway that allow users to access Facebook services over a Disruption Tolerant Network (DTN) in a convenient and secure manner. Our system enables users to read their news feed, post status updates and photos, and comment and like the posts of other people. We also show the importance of supporting applications like this in a DTN and allow demo session attendees to see this system in action.

Loading Swedish Institute of Computer Science collaborators
Loading Swedish Institute of Computer Science collaborators