8th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Call for Papers
Conference Organization
Accepted Papers
Invited Speakers
Conference Program
Registration
Local Information
Panel
<< Index
springer
lncs
Login 
Pass 
Invited Speakers
· · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · 

Stabilization Enabling Technology

Shlomi Dolev and Yinnon Haviv (Speaker: S. Dolev)

Hardware and software components are suggested for enabling the creation of a self-stabilizing os on top of an off-the-shelf, non-self-stabilizing processor. Simple ``watchdog'' hardware called periodic reset monitor (prm) provides a basic solution. The solution is extended to a stabilization enabling hardware (seh) which removes any real time requirement from the os. A stabilization enabling system that extends the seh with some software components provides the user (the os designer) with a self-stabilizing processor abstraction. Adapting the current os code to be self-stabilizing is supported using a mechanism for enforcing the software configuration.

Shlomi Dolev's Biography: Shlomi Dolev received his B.Sc. in Engineering and B.A. in Computer Science in 1984 and 1985, and his M.Sc. and D.Sc. in computer Science in 1990 and 1992 from the Technion Israel Institute of Technology. From 1992 to 1995 he was at Texas A&M University. In 1995 he joined the Department of Mathematics and Computer Science at Ben-Gurion University. Shlomi is the author of the book ``self-stabilization'' published by the MIT Press. He published more than hundred journal and conference scientific articles, and served in the program committee of more than forty conferences including: the ACM Symposium on Principles of Distributed Computing, and the International Symposium on DIStributed Computing. Shlomi served as the program committee chair of the workshop on self-stabilizing systems in 1995 and of the International Symposium on DIStributed Computing in 2006. He is an associate editor of the AIAA Journal of Aerospace Computing, Information and Communication and a guest editor of the Distributed Computing Journal. His research grants include IBM faculty awards, Intel academic grants, and the NSF. He was a visiting researcher/professor at MIT, DIMACS, and LRI, for several periods during summers. Shlomi established the Computer Science Department at Ben-Gurion university, and served as the first chair of the department, where he is now a full professor holding the Rita Altura trust chair in computer science. His current research interests include distributed computing, communication networks, cryptography and security; in particular the self-stabilization property of such systems.

· · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · 

A General Characterization of Indulgence

Rachid Guerraoui and Nancy Lynch (Speaker: R. Guerraoui)

An indulgent algorithm is a distributed algorithm that, besides tolerating process failures, also tolerates arbitrarily long periods of instability, with an unbounded number of timing and scheduling failures. In particular, no process can take any irrevocable action based on the operational status, correct or failed, of other processes. This paper presents an intuitive and general characterization of indulgence. The characterization can be viewed as a simple application of Murphy's law to partial runs of a distributed algorithm, in a computing model that encompasses various communication and resilience schemes. We use our characterization to establish several results about the inherent power and limitations of indulgent algorithms.

Rachid Guerraoui's Biography: Rachid Guerraoui (lpdwww.epfl.ch/rachid) just finished the hilly marathon of Lausanne in 3h27. He is professor at EPFL where he works on distributed algorithms. In previous incarnations, he finished an olympic triathlon in 2h38 and was affiliated respectively with MIT, HP Labs, CEA Saclay as well as Ecole des Mines of Paris.

· · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · 

Online Advertising: The Good, The Bad, and The Ugly

Yi-Min Wang

Online advertising is an important part of web economy. Good advertising syndicators serve as effective middlemen to connect publishers with merchant advertisers and to deliver relevant ads to web users. Bad ones pretend to be ads syndicators but, instead of serving ads, they serve scripts that exploit browser vulnerabilities to install malicious programs. In the middle gray area is a bunch of ugly players including typo-squatters who hijack type-in traffic due to typos of trademark domains and search spammers who hijack search click-through traffic by using web spamming techniques.

In this talk, I will give an overview of these booming advertising-related activities and describe the Strider framework that ties them all together. In particular, I will introduce the concept of automated web patrol with Strider monkeys which include Strider HoneyMonkey for hunting down malicious websites, Strider Typo-Patrol for catching cybersquatters, and Strider Search Ranger for exposing web spammers.

Yi-Min Wang's Biography: Yi-Min Wang is a Principal Researcher at Microsoft Research, Redmond, where he manages the Cybersecurity and Systems Management Group and leads the Strider project. Yi-Min received his B.S. degree from National Taiwan University in 1986. He received his Ph.D. in Electrical and Computer Engineering from University of Illinois at Urbana-Champaign in 1993, worked at AT&T Bell Labs from 1993 to 1997, and joined Microsoft in 1998. His research interests include security, systems management, dependability, home networking, and distributed systems.

· · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · 
SSS 2005 | SSS 2003 | WSS 2001 | WSS 1999 | WSS 1997 | WSS 1995 | WSS 1989