Report on the Dagstuhl Seminar on Visualization and Monitoring of Network Traffic

The Dagstuhl Seminar on Visualization and Monitoring of Network Traffic took place May 17-20, 2009 in Dagstuhl, Germany. Dagstuhl seminars promote personal interaction and open discussion of results as well as new ideas. Unlike at most conferences, the focus is not solely on the presentation of established results but also, and in equal parts, to presentation of results, ideas, sketches, and open problems. The aim of this particular seminar was to bring together experts from the information visualization community and the networking community in order to discuss the state of the art of monitoring and visualization of network traffic. People from the different research communities involved jointly organized the seminar. The co-chairs of the seminar from the networking community were Aiko Pras (University of Twente) and Jürgen Schönwälder (Jacobs University Bremen). The co-chairs from the visualization community were Daniel A. Keim (University of Konstanz) and Pak Chung Wong (Pacific Northwest National Laboratory). Florian Mansmann (University of Konstanz) helped with producing this report. The seminar was organized and supported by Schloss Dagstuhl and the European Network of Excellence for the Management of Internet Technologies and Complex Systems (EMANICS)

DIY networking as a facilitator for interdisciplinary research on the hybrid city

DIY networking is a technology with special characteristics compared to the public Internet, which holds a unique potential for empowering citizens to shape their hybrid urban space toward conviviality and collective awareness. It can also play the role of a “boundary object” for facilitating interdisciplinary interactions and participatory processes between different actors: researchers, engineers, practitioners, artists, designers, local authorities, and activists. This position paper presents a social learning framework, the DIY networking paradigm, that we aim to put in the centre of the hybrid space design process. We first introduce our individual views on the role of design as discussed in the fields of engineering, urban planning, urban interaction design, design research, and community informatics. We then introduce a simple methodology for combining these diverse perspectives into a meaningful interdisciplinary collaboration, through a series of related events with different structure and framing. We conclude with a short summary of a selection of these events, which serves also as an introduction to the CONTACT workshop on facilitating information sharing between strangers, in the context of the Hybrid City III conference

Stochastic scheduling on unrelated machines

Two important characteristics encountered in many real-world scheduling problems are heterogeneous machines/processors and a certain degree of uncertainty about the actual sizes of jobs. The first characteristic entails machine dependent processing times of jobs and is captured by the classical unrelated machine scheduling model.The second characteristic is adequately addressed by stochastic processing times of jobs as they are studied in classical stochastic scheduling models. While there is an extensive but separate literature for the two scheduling models, we study for the first time a combined model that takes both characteristics into account simultaneously. Here, the processing time of job $j$ on machine $i$ is governed by random variable $P_{ij}$, and its actual realization becomes known only upon job completion. With $w_j$ being the given weight of job $j$, we study the classical objective to minimize the expected total weighted completion time $E[\sum_j w_jC_j]$, where $C_j$ is the completion time of job $j$. By means of a novel time-indexed linear programming relaxation, we compute in polynomial time a scheduling policy with performance guarantee $(3+\Delta)/2+\epsilon$. Here, $\epsilon>0$ is arbitrarily small, and $\Delta$ is an upper bound on the squared coefficient of variation of the processing times. We show that the dependence of the performance guarantee on $\Delta$ is tight, as we obtain a $\Delta/2$ lower bound for the type of policies that we use. When jobs also have individual release dates $r_{ij}$, our bound is $(2+\Delta)+\epsilon$. Via $\Delta=0$, currently best known bounds for deterministic scheduling are contained as a special case

05291 Abstracts Collection -- Sublinear Algorithms

From 17.07.05 to 22.07.05, the Dagstuhl Seminar 05291 ``Sublinear Algorithms\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available