2004 Summer Institute on Peer-to-peer Computing

Detailed Program

[an error occurred while processing this directive] Tutorial
July 29 (Thursday)
09:00 - 10:35 D.T. Lee (AS) and Yuh-Jzer Joung (NTU)
Chung-Ta King (NTHU)
P2P computing: An introduction
10:35 - 10:55 Coffee Break
10:55 - 12:30 Chung-Ta King (NTHU) (Cont.)
12:30 - 13:30 Lunch Break
13:30 - 15:05 Tai-Yi Huang (NTHU)
Load-balancing issues on P2P networks
15:05 - 15:25 Coffee Break
15:25 - 17:00 Ren-Hung Hwang (CCU)
Issues on structured P2P
July 30 (Friday)
09:00 - 10:35 Yuh-Jzer Joung (NTU)
Search in P2P networks
10:35 - 10:55 Coffee Break
10:55 - 12:30 Yuh-Jzer Joung (NTU) (Cont.)
12:30 - 13:30 Lunch Break
13:30 - 15:05 Tsung-Nan Lin (NTU)
Search algorithm and performance analysis in unstructured P2P networks
15:05 - 15:25 Coffee Break
15:25 - 17:00 Ming-Yan Shieh (NTU)
Impacts of revised IPR law on future P2P development
[an error occurred while processing this directive]


August 2 (Monday)
09:00 - 10:35 Beng Chin Ooi (National University of Singapore, Singapore)
Database searching/sharing in structured and unstructured P2P environment
    Today's peer-to-peer (P2P) systems are unable to cope well with complex queries on high-dimensional data. In this talk, I will highlight the problems of high-dimensional database retrieval, and will examine search strategies in unstructured networks and structured networks. Subsequently, I will cover hierarchal summary indexing and searching in unstructured P2P networks with supernodes, and an adaptive high-dimensional addressable P2P network and its associated range search strategies.
10:35 - 10:55 Coffee Break
10:55 - 12:30 Beng Chin Ooi
12:30 - 13:30 Lunch Break
13:30 - 15:05 Lisa Childers (on behalf of Gregor von Laszewski) (Argonne National Laboratory, USA)
Grid abstractions
    Authors: Gregor von Laszewski, Lisa Childers, et. al
    Presented by Lisa Childers

    Part I: Basic Grid Computing

      This part will introduce abstractions of Grid functionalities as introduced by the Globus Toolkit.
    Part II: Advanced Grid Computing
      This part will introduce convenient anbstractions for problem solving, portal, and Grid application designers based on the Java CoG Kit v 4.0. Issues that will be covered are task graphs, workflows, and hosting environment abstractions.
15:05 - 15:25 Coffee Break
15:25 - 17:00 Lisa Childers
17:30 - 19:30 Reception (Invited Only)
August 3 (Tuesday)
09:00 - 10:35 David Peleg (Weizmann Institute of Science, Israel)
Resource discovery in distributed P2P networks
    The resource discovery problem arises in the context of peer to peer networks, where peers may join or leave the network in arbitrary times and locations. A peer can communicate with another vertex directly if and only if it knows a certain routing information to that other peer. Hence, a critical task is for the peers to convey this routing information to each other. The problem was formalized by Harchol-Balter, Leighton and Lewin. The talk will present the resource discovery problem and review a number of randomized and deterministic approaches for handling it.
10:35 - 10:55 Coffee Break
10:55 - 12:30 David Peleg
12:30 - 13:30 Lunch Break
13:30 - 15:05 John Chuang (University of California, Berkeley, USA)
Economics of P2P systems
    The fundamental premise of peer-to-peer systems is that individual peers voluntarily contribute resources to the system. However, the inherent tension between individual rationality and collective welfare produces a misalignment of incentives in the grassroots provisioning of P2P services. What makes free-riding a particularly difficult problem is the unique set of challenges that P2P systems pose, e.g., large populations, high turnover, asymmetry of interest, hidden action, collusion, and zero-cost identities. We will discuss recent advances and open questions in the design of incentive mechanisms for a wide range of peer-to-peer systems.
15:05 - 15:25 Coffee Break
15:25 - 17:00 John Chuang
17:30 - 19:30 Banquet (Invited Only)
August 4 (Wednesday)
09:00 - 10:35 Jun Xu (Georgia Institute of Technology, USA)
On the fundamental tradeoff between routing table size and network diameter in P2P networks
    Lower bound, fundamental tradeoff, and impossibility results are the deepest and most fundamental results in many fields of computer science. Such results are important since they typically end the vigorous search for a better algorithm that does not exist at all, or lead to provably optimal algorithms. In this talk, Professor Xu will focus on his past and current work on establishing the fundamental tradeoffs between routing table size and network diameter in distributed hash table (DHT). DHT schemes have been proposed to support scalable object search and retrieval in a peer-to-peer (P2P) file-sharing system. Existing DHT schemes either have a routing table of size O(log_2 n) and network diameter of O(log_2 n), or have a routing table of size d and network diameter of O(n^{1/d}), including. It was posed as an open problem whether this represents the best asymptotic "state-efficiency" tradeoffs. We clarified this question and established some foundational results. This work leads to our recent work named Ulysses, a DHT scheme that achieves the desired optimal "state-efficiency" tradeoff.
10:35 - 10:55 Coffee Break
10:55 - 12:30 Jun Xu
[an error occurred while processing this directive]

Biographies of Principal Speakers

John C.-I. Chuang (University of California, Berkeley, USA)
    Dr. John Chuang is Assistant Professor of Information Management and Systems at the University of California, Berkeley. He received a B.S. and M.S. in Electrical Engineering from the University at Southern California and Stanford University respectively, and a Ph.D. in Engineering and Public Policy from Carnegie Mellon University. His research focus is on economics-informed design of computer networks and distributed systems, including incentive mechanisms for peer-to-peer networks, service differentiation for web-caching and content distribution networks, and ubiquitous broadband access to the Internet. He was program co-chair for the 1st Workshop on Economics of Peer-to-Peer Systems in 2003.
Gregor von Laszewski (Argonne National Laboratory, USA)
    Gregor von Laszewski is a Scientist at Argonne National Laboratory and a fellow of the Computation Institute at University of Chicago. He received a Masters Degree in 1990 from the University of Bonn, Germany, and a Ph.D. in 1996 from Syracuse University in computer science. He is involved in Grid computing since the term was coined. Current research interests are in the areas of parallel, distributed, and Grid computing. Specifically, he is working on topics in the area of using commodity technologies within Grid services, applications, and portals. He serves on multiple Grid related conferences. He is the principal investigator of the Java Commodity Grid Kit which provides a basis for many Grid related projects including GT3 and GT4 (http://www.cogkits.org). The Java CoG Kit also enables easy programming of the Grid by using a high level abstraction of Grids through a task model.
Beng Chin Ooi (National University of Singapore, Singapore)
    Beng Chin is Professor of Computer Science and Vice Dean (Academic Affairs and Graduate Studies) at School of Computing, National University of Singapore, and a fellow of Singapore-MIT Alliance Programme . He obtained his BSc (1st Class Honors) and PhD from Monash University, Australia, in 1985 and 1989 respectively. His research interests include database performance issues, indexing techniques, XML, P2P/grid/parallel, and embedded system, internet and genomic applications. He has served as a PC member for international conferences including SIGMOD, VLDB, ICDE, EDBT, DASFAA, CIKM and Vice PC Chair for ICDE'00,04 and PC Chair for SSD'93 and DASFAA'05. He is an editor of GeoInformatica, Journal of GIS, VLDB Journal and IEEE Transactions on Knowledge and Data Engineering. He is a co-founder and director of GeoFoto, a company providing imaging and point-to-point photo management solutions, and BestPeer (http://www.bestpeer.com/), a company specializing in P2P computing and IR technology.
David Peleg (Weizmann Institute of Science, Israel)
    David Peleg received the B.A. degree in 1980 from the Technion, Israel, the M.Sc. degree in 1982 from Bar-Ilan University, Israel, and the Ph.D. degree in 1985 from the Weizmann Institute, Israel, all in computer science. He then spent a post-doctoral period at IBM and at Stanford University. In 1988 he joined the Department of Applied Mathematics and Computer Science at The Weizmann Institute, where he serves as a professor and holds the Norman D. Cohen Professorial Chair of Computer Sciences.

    His research interests include distributed network algorithms, fault-tolerant computing, communication network theory, approximation algorithms and graph theory. He is the author of a book titled "Distributed Computing: A Locality-Sensitive Approach," and he has published close to two hundred papers in scientific journals and refereed conferences, and supervised over thirty graduate students.

    He serves as a Council Member of the EATCS. He also serves as a member of the editorial board of the journals Theoretical Computer Science, Parallel Processing Letters, Networks, and the Chicago Journal of Theoretical Computer Science, and as the steering committee chair of the SIROCCO Colloquium. He has chaired the program committees for the ACM PODC Symposium in 1994, the ISTCS Symposiun in 1995, and the SIROCCO Colloquium in 1998, and also served as a program committee member for a number of conferences, including PODC, FOCS, STOC, SODA, ICALP, ICDCS, SIROCCO, SWAT, Dial M, IPDPS, IFIP-TCS, MFCS, DISC, WG, WAOA, ISTCS and APPROX.

Jun Xu (Georgia Institute of Technology, USA)
    Jun (Jim) Xu is an Assistant Professor in the College of Computing at Georgia Institute of Technology. He received his Ph.D. in Computer and Information Science from The Ohio State University in 2000. His current research interests include data streaming algorithms for the measurement and monitoring of computer networks, network algorithms and data structures, network security, and performance modeling and simulation. He received the NSF CAREER award in 2003 for his ongoing efforts in establishing fundamental lower bound and tradeoff results in networking. He is a co-author of a paper that won the Best Student Paper Award from 2004 ACM Sigmetrics/IFIP Performance joint conference, and the thesis advisor of the student winners.