IMPORTANT: This is a draft. The final document may differ significantly from the current version. | |
Abstract: The Systems Architecture Group is engaged in numerous projects: Berlin Roof Net, Anonymous Reputation Management for Social Network Services, and Early Warning Systems for Seismic Activities. Each of these projects requires intensive research to make progress. In this project seminar, we will identify specific problems for each project, review prior art literature, discuss our findings, and regularly report about progress made on each issue. In addition to acquiring knowledge about the technologies that are relevant for each project, seminar participants will get hands-on experience with research techniques, including literature study, project planning, and result presentation / publication.
|
Synopsis:- Project Seminar, Praktische Informatik.
- 2h each week, over one semester (2 SWS).
- Target Audience: Students who are interested in writing their term paper or masters thesis at the Systems Architecture Group, as well as students who want to participate in one of the current projects (1) Berlin Roof Net, (2) Anonymous Reputation Management for Social Network Services, and (3) Early Warning Systems for Seismic Activities.
Credits and grading: There are no grades for this project seminar.
In order to obtain credits (Seminarschein), participants are expected to: - Attend regularly (at least 90%).
- Contribute to discussions and implementation/experiments.
- Research an assigned subject; present major findings (45 min presentation; 30 min discussion).
- Presentations may be given in English or German. All documents are in English (exceptions may be granted).
Prerequisites: - Successful completion of PI-1,2,3; involvement in one of the group's 3 projects.
Wiki: External Events:SPREE: A Community-based Information Exchange Network Date: Wednesday, October 18, 2006, 12:00-13:00
Location: T-Labs, TEL 0010 (ground floor)
Spree's objectives include realizing an innovative engine (on a [web]server) which bridges users/experts with each other for exchanging information in real-time and a user interface based on latest Ajax technologies. During the research and development of the system we will investigate advanced scalable machine learning algorithms, underlying networking problems, and usability issues. A prototype is planned to demonstrate research results and to bring both the client- and server-side implementations together.
On the logical composition of file content Date: Friday, October 20, 11:00-12:00
Speaker: Calicrates Policroniades from Telenor R&D
Location: T-Labs, Sputnik.
This talk will address the lack of ability in the file API to exploit the advantages of gaining access to the logical composition of file content. It will mainly argue that the trade-off between efficiency and ease of programmability of persistent code in the context of the file API is unbalanced. Therefore, the speaker will present two practical strategies to disclose structure and type in file data. In the first part of his talk, it will be shown to what extent it is possible to identify specific portions of file content in diverse data sets based on data redundancy detection techniques. After that, Datom is presented, a storage system API that departs from the view of file content as a monolithic object. The Datom API discloses a judicious degree of structure and type in the logical composition of files and makes the data access semantics of applications explicit through a minimal set of commonly-used abstract data types. Finally, an implementation of the Datom API is presented and its evaluation based on different criteria such as usability, impact at the source-code level, and performance.
Security and Cooperation in Wireless Networks Date: Monday, November 13, 10:15-12:00
Speaker: Prof. Jean-Pierre Hubaux, EPFL, Switzerland
Location: T-Labs, Sputnik.
According to most technology pundits, progress in wireless and sensor networks will lead us into a world of ubiquitous computing, in which myriads of tiny, untethered sensors and actuators will communicate with each other. Information technology will thus deliver its most encompassing and pervasive accomplishment to mankind, promptly taking care of the needs and wishes of everyone.
Or maybe not. The described evolution is driven primarily by market forces and vastly ignores the users' intentions. Yet the recent history of the Internet has shown that these intentions can have devastating effects; for example, spam, viruses, "phishing" and denial of service attacks have unfortunately become commonplace. The misbehavior of a relatively small number of users is leading to a substantial inconvenience to the whole community. Similar or even worse misdeeds are and will be perpetrated in wireless networks.
This talk addresses the fundamental questions related to this problem, in particular: - How are users and devices identified?
- How can a security association be established between two wireless peers?
- How can packets be securely and cooperatively routed in a multi-hop network?
- How can the fair share of bandwidth between nodes located in the same radio domain be guaranteed?
- How do wireless operators behave, if they have to share a given chunk of the spectrum?
- How can naturally selfish players be encouraged to behave cooperatively?
- And, above all, how is privacy protected?
'Geometry' of Resource Allocation and Load Balancing in Computing/Communication Systems Date: Monday, January 29, 10:30-11:30
Speaker: Prof. Nicholas Bambos, Stanford University
Location: T-Labs, Sputnik.
We consider a processing system having several parallel buffers, where classes of jobs/tasks are queued up, while awaiting execution. At each point in time, the system can be set to one of several available service modes; each queue then receives service at a mode-dependent rate. Modes correspond to feasible configurations of various processing resources.
The model unifies resource allocation situations in autonomic computing, wireless transmitter power control, packet switching and various networking problems, etc. Taking a 'geometric' perspective, we discuss some new general families of algorithms, which maximize the throughput by dynamically choosing service modes in response to observed buffer backlogs.
Papers:
| |
|
