您现在的位置 >> Hadoop教程 >> Hadoop实战 >> 专题  
 

CS 525, Spring 2011 : Course Schedule

【作者:Hadoop实战专家】【关键词:Facebook Google 】 【点击:22968次】【2013-05-1】
Up to Main Course Web page  

相关热门搜索:google bigtable

大数据标签:hadoop hdfs mapreduce pic hbase hive zookeeper bigdata

Presentation Schedule // CS 525: Advanced Distributed Systems // Spring 2011

------------

Jump to Course Schedule (Below)

Jump to Tips and Instructions (link for Reviews and Presentations)

Up to Main Course Webpage

------------

Date

Presenters,

Slides,

and

Reviews

Topic

Main Papers

More Papers (optional)

Must-see Papers if your Project overlaps with the area.

1/18 Indy

[ppt slides]

Introduction
* The mathematical theory of infectious diseases and its applications, N.T.J. Bailey, 1975 (out of print)
See topic "Epidemics" below
1/20 Indy

[ppt slides]

Before, There Were Clouds
* Historical reflections: The rise, fall, and resurrection of software as a service, M. Campbell-Kelly, CACM, May 2009.
* Above the clouds (see the latest version of the paper on the site), M. Armbrust et al, Berkeley RADLAB, 2009.
* Open Cirrus? Cloud Computing Testbed: Federated Data Centers for Open Source Systems and Services Research, R. Campbell, I. Gupta, et al, HotCloud 2009 [HotCloud Version]

?Larry Ellison's Rant on Cloud Computing (Youtube video)

Join Googlegroups on Cloud Computing

* Datatecture: Data Center Overload, Tom Vanderbilt, New York Times Magazine, June 2009
* Amazon EC2 and S3
* Google AppEngine
* Others: IBM Blue Cloud, SUN network.com, others (Joyent, Flexiscale, GoGrid) - see the GoogleGroups
* Cost of a Cloud: Research Problems in Data Center Networks, A. Greenberg et al, ACM SIGCOMM CCR, 2009
* A BluePrint for Introducing Disruptive Technology into the Internet, L. Peterson et al
* Economic Perspectives on the History of the Computer Timesharing Industry, M. Campbell-Kelly and D. Garcia-Swartz
* PlanetLab website
* Emulab Website
* ModelNet website
* OpenCirrus

1/25 Indy

[ppt slides]

Cloud Computing Continued
* MapReduce: Simplified Data Processing on Large Clusters, J. Dean et al, OSDI 2004 (Google)
* Parallel Computing on the Berkeley NOW, D. E. Culler et al, JSPP 1997
* Grid: a new infrastructure for 21st century science, I. Foster, Physics Today, 2002 (Argonne)

*

Cloudera's Video Tutorials on Hadoop and HDFS

*

List of Cloud Computing Providers

*

Hadoop Tutorial (and website)

*

Some open source Cloud Computing Projects

*

Hadoop Summit and Data-Intensive Symposium at CMU/Yahoo in March 2008

*

Tashi Project (CMU)

*

Deter Testbed (UC Berkeley)

* Hadoop-on-demand
* The anatomy of the Grid: enabling scalable virtual organizations, I. Foster et al, Intnl Journal High Perf. Computing Appl. 2001

1/27 Indy

[ppt slides]

P2P Systems

*

The Gnutella protocol specification v 0.4

See topic "Overlays and DHTs" below

2/1 Indy

[ppt slides-1] [ppt slides-2]

P2P Systems (contd.) and Basic Distributed Computing Concepts

* Chord: a scalable peer-to-peer lookup service for Internet applications, I. Stoica et al, SIGCOMM 2001
* Time, clocks and the ordering of events in a distributed system, L. Lamport, Communications ACM 1978
* Distributed snapshots: determining global states of distributed systems, Chandy and Lamport, ACM TOCS 1985
* Impossibility of distributed consensus with one faulty process, Fischer, Lynch and Patterson, Journal ACM 1985

* Tutorial on CSP (Communicating Sequential Processes), Tony Hoare [Free Book] [CACM 1978 paper]
* State Machine Aproach: A Tutorial, F. Schneider, ACM CSUR 1990.

2/3 Indy

[ppt slides]

Sensor Networks
* Smart Dust
* TinyOS

* Research challenges in wireless networks of biomedical sensors, L. Schwiebert, ACM Sigmobile 2001
* Research challenges in environmental observation and forecasting systems, D.C. Steere et al, Mobicom 2000
* Design considerations for distributed microsensor systems, A. Chandrakasan et al, CICC 1999

2/8 Two Guest Speakers

[slide set 1] [slide set 2]

"Entrepreneurship at Illinois"

* David Washburn, Office of Technology Management/OTM, UIUC
* Laura Frerichs, Enterpriseworks Technology Business Incubator, UIUC

2/10 Mark Overholt & Matt Trower

[reviews] [slides]

Overlays and DHTs

Student Presentations and Reviews Start - See Instructions

*

Resilient overlay networks , D. Andersen et al, SOSP 2001

*

Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems, A. Rowstron et al, Middleware 2001.

*

A scalable content addressable network, S. Ratnasamy et al, SIGCOMM 2001

* Kelips, I. Gupta et al, IPTPS 2003
* BitTorrent Protocol Specification and BitTorrent Economics Paper
* Freenet: a distributed anonymous information storage and retrieval system, I. Clarke et al, 2000
* A routing underlay for overlay networks, A. Nakao et al, SIGCOMM 2003
* Viceroy: a scalable and dynamic emulation of the butterfly, D. Malkhi et al, PODC 2002

2/15 Long Kai & Andrew Harris

[reviews] [slides]

Cloud Programming
* Pig latin: a not-so-foreign language for data processing, C. Olston et al, SIGMOD 2008 (Yahoo!)
* DryadLINQ: A System for General-Purpose Distributed Data-Parallel Computing Using a High-Level Language, Yuan Yu et al, OSDI 2008
* Large-scale Incremental Processing Using Distributed Transactions and Notifications, D. Peng et al, OSDI 2010

* Map-reduce-merge: simplified relational data processing on large clusters, H.-C. Yang et al, SIGMOD 2007
* MapReduce Online, T. Condie et al, NSDI 2010
* Wave Computing in the Cloud, B. He et al, HotOS 2009
* Hadoop Streaming
* HBase
* Hive
* Data challenges at Yahoo!, R. Baeza-Yates and Ramakrishnan, EDBT 08
* Zookeeper (Yahoo!)
* Zookeeper: wait-free coordination for Internet-scale systems, P. Hunt et al (Yahoo!), Usenix 2010

2/17 Muntasir Raihan Rahman & Anupam Das

[reviews] [slides]

Cloud Scheduling
* Quincy: Fair Scheduling for Distributed Computing Clusters, M. Isard et al, SOSP 2009
* Improving MapReduce Performance in Heterogeneous Environments, M. Zaharia et al, OSDI 2008
* Reining in the Outliers in Map-Reduce Clusters using Mantri, G. Ananthanarayanan, OSDI 2010

*

Everest: Scaling down peak loads through I/O off-loading, D. Narayan et al, OSDI 2008

*

CA-NFS: A Congestion-Aware Network File System, A. Batsakis et al, FAST 2009

2/22 Shen Li & Tony Huang

[reviews] [slides]

Key-Value Stores
* Dynamo: Amazon's highly-available key-value store, DeCandia et al, SOSP 2007
* Project Voldemort, Linkedin
* Comet: An Active Distributed Key-Value Store,
R. Geambasu et al, OSDI 2010

2/24 Ankit Singla and Chi-Yao Hong

[reviews] [slides]

Storage  - 1
* A Case for Redundant Arrays of Inexpensive Disks (RAID), D. Patterson et al, SIGMOD 1988
* FAWN: A Fast Array of Wimpy Nodes, D. G. Andersen et al, SOSP 2009
* Ch. 1 from "The Innovator's Dilemma", C. M. Christensen (handout given in class)

* HydraFS: A High-Throughput File System for the HYDRAstor Content-Addressable Storage System, C. Ungureanu et al, FAST 2010
* Block-level RAID Is Dead, R. Appuswamy et al, HotStorage 2010
* Mean Time to Meaningless: MTTDL, Markov Models, and Storage System Reliability, K. M. Greenan, HotStorage 2010

2/27

Project Survey Report due, 11.59 pm [12pt font, single-sided, 3 + 1 pages max] (In groups of 2-3)

Wiki Term Paper - First Draft Due (Individual)

Instructions for Survey and its Submission

3/1 Rachit Agarwal & Lewis Tseng

[slides] [reviews]

Sensor Net Routing
*

A review of current routing protocols for ad hoc mobile wireless networks, E.M. Royer et al, IEEE Personal Communications 1999

*

Directed diffusion: A scalable and robust communication paradigm for sensor networks, C. Intanagonwiwat et al, Mobicom 2000

*

Learn on the Fly: Data-driven Link Estimation
and Routing in Sensor Network Backbones,
Hongwei Zhang et al, Infocom 2006

*

Rumor Routing Algorithm For Sensor Networks, Braginsky et al

*

Energy-Efficient Communication Protocol for Wireless Microsensor Networks, Heinzelman et al

* Adaptive Protocols for Information Dissemination in Wireless Sensor Networks, Kulik et al
*

Energy efficient routing in ad hoc disaster recovery Networks, G. Zussman et al, Infocom 2003

*

Locating and bypassing routing holes in sensor networks, Q. Fang et al, Infocom 2004.

3/3 Harshitha Menon & Nipun Sehrawat

[reviews] [slides]

Storage - 2
* Cumulus: Filesystem Backup to the Cloud, M. Vrable et al, FAST 2009
* Towards robust distributed systems, Eric A. Brewer, Keynote, ACM PODC 2000
* SPORC: Group Collaboration using Untrusted Cloud Resources, A. J. Feldman et al, OSDI 2010

* Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services, S Gilbert and N. Lynch, ACM SIGACT News, June 2002

3/8 Yanen Li & Tengfei Mu

[reviews] [slides]

Storage in Industry
* Finding a Needle in Haystack: Facebook's Photo Storage, D. Beaver et al, OSDI 2010  [Link 1] [Link 2]
* Bigtable: A Distributed Storage System for Structured Data, Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, and Robert E. Gruber, OSDI 2006 (Google)
* The Google File System, S. Ghemawat et al, SOSP 2003.

* Megastore: Providing Scalable, HIghly Available Storage for Interactive Services, J. Baker et al, CIRD 2010
* Cassandra - a decentralizxed structured storage system, A. Lakshman and P. Malik (Facebook)
* PNUTS: Yahoo!?s Hosted Data Serving Platform, Brian F. Cooper et al, VLDB 08
* Hypertable (Yahoo!)

3/10 Anjali Sridhar & Jason Croft

[reviews] [slides]

Geo-Distribution
* Smoke and Mirrors: Reflecting Files at a Geographically Remote Location Without Loss of Performance, H. Weatherspoon et al, FAST 2009
* Volley: Automated Data Placement for Geo-Distributed Cloud Services, S. Agarwal et al, NSDI 2010
* RACS: a case for cloud storage diversity, H. Abu-Libdeh et al, SOCC 2010

* Availability in Globally Distributed Storage Systems, D. Ford et al, OSDI 2010

3/15 Kevin Larson & Will Dietz

[reviews] [slides]

P2P Apps
*

Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility, A. Rowstron et al, SOSP 2001

*

UsenetDHT: A Low-Overhead Design for Usenet
Emil Sit et al, NSDI 2008

*

CoDNS: Improving DNS Performance and Reliability via Cooperative Lookups, KyoungSoo Park et al, OSDI 2004 [ppt]

*

Colyseus: A distributed architecture for interactive multiplayer games, A.R. Bharambe, Usenix NSDI 2006.

*

Peer-to-peer support for massively multiplayer games, B. Knutsson et al, Infocom 2004.

* Operating system support for planetary-scale network services, A. Bavier et al, NSDI 2004.
* Wide-area cooperative storage with CFS, F. Dabek et al, SOSP 2001
*

Ivy: a read/write peer-to-peer file system, A.  Muthitacharoen et al, OSDI 2002

*

Scalability of reliable group communication using overlays, F. Baccelli et al, Infocom 2004.

*

OceanStore: An Architecture for Global-Scale Persistent Storage ,  J. Kubiatowicz, ASPLOS 2000

* SHARP: an architecture for secure resource peering, Y. Fu et al, SOSP 2003
* Squirrel: a decentralized, peer-to-peer web cache, S. Iyer et al, PODC 2002.
* OverCite, J. Stribling et al, Usenix NSDI 2006

3/17 David Lundgren & Curtis Wang

[reviews] [slides]

In-network processing
*

TAG: A Tiny Aggregation service for ad-hoc sensor networks, S. Madden, et al, OSDI 2002

*

Synopsis diffusion for robust aggregation in sensor networks, S. Nath et al, ACM TOSN, 2008.

*

Trickle: a self-regulating algorithm for code propagation and maintenance in wireless sensor networks, P. Levis et al, NSDI 2004.

*

A framework for time indexing in sensor networks, He et al, ACM TOSN 2005.

*

Multi-resolution state retrieval in sensor networks, B. Deb et al, SNPA 2003

*

Robust location detection in emergency sensor networks, S. Ray et al, Infocom 2003

*

DIFS: A distributed index for features in sensor networks, B. Greenstein et al, SNPA 2003

*

Localized edge detection in sensor fields, K.K.Chintalapudi et al, SNPA 2003

*

Optimal energy balanced algorithm for selection in single hop sensor network, M. Singh et al, SNPA 2003

*

Sensor deployment and target localization based on virtual forces, Y. Zou et al, Infocom 2003

*

Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure, S. Meguerdichian et al, Mobihoc 2001

*

Amorphous Computing, H. Abelson et al, CACM 2000.

*

Probabilistic counting for database systems, Flajolet and Martin, JCSS, 1985

3/22

Spring Vacation - No Class.

3/24

Spring Vacation - No Class.

3/29 Michael Ford & Simon Krueger

[reviews] [slides]

Epidemics

*

Bimodal multicast, K Birman et al, ACM TOCS 1999

*

Epidemic algorithms for replicated database maintenance, A. Demers et al, PODC 1987.

*

Exploring the energy-latency trade-off for broadcasts in energy-saving sensor networks, M. Miller, C. Sengul, I. Gupta, ICDCS 2005

*

Randomized Rumor Spreading, Karp and Shenker, FOCS 2000

*

Immunology as information processing, S. Forrest et al, 2000.

*

Adaptive and Efficient Epidemic-style Protocols for Reliable and Scalable Multicast, Gupta et al, IEEE TPDS, 2006.

*

Gossip-based ad hoc routing, Z. Haas et al, Infocom 2002

*

Spatial gossip and resource location protocols, Kempe, Kleinberg and Demers, STOC 2001

3/31 Indy

[reviews] [slides]

Probabilistic Membership Protocols

*

A gossip-based failure detection service, R. van Renesse et al, Middleware 1998

*

SWIM: Scalable Weakly-consistent Infection-style process group Membership protocol, A. Das et al, DSN 2002

* On scalable and efficient distributed failure detectors, I. Gupta et al, PODC 2001

*

Peer-to-peer membership management for gossip-based protocols, A.J. Ganesh et al, IEEE TOC, Feb 2003.

*

CONGRESS:CONnection-oriented Group address Resolution Service, A. Tal et al, 1997

*

Using random subsets to build scalable network services, D. Kostic et al, USITS 2003

*

T-Man: Fast Gossip-based Construction of
Large-Scale Overlay Topologies, M. Jelasity et al, U. Bologna Tech Report.

*

CYCLON: Inexpensive Membership Management
for Unstructured P2P Overlays, S. Voulgaris et al, Journal Network Systems and Management, June 2005

4/3

Project Midterm Report due, 11.59 pm [12pt font, single-sided, 8 + 1 pages max] (In groups of 2-3)

Wiki Term Paper - Second Draft Due (Individual)

Instructions for Midterm and its Submission

4/5 Indy

[reviews] [slides]

Distributed Monitoring and  Management

*

Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining, van Renesse et al, ACM TOCS 2003.

* MON: ON-demand overlays for distributed system management, J. Liang et al, SIGOPS OSR 2007.
* Moara: Flexible and Scalable Group-Based Querying System, S. Ko, Middleware 2008.

* Chukwa: A large-scale monitoring system, J. Boulon et al, CCA 2008
* PlanetLab website
* Emulab Website
* WAIL website
* Chukwa system (Hadoop monitoring)
*

Distributed system management: PlanetLab incidents and management tools, R. Adams, PlanetLab Techreport

* PlanetLab management using Plush, J. Albrecht et al, ACM SIGOPS OSR, Jan 2006
* A Scalable Distributed Information Management System. Praveen Yalagandula and Mike Dahlin. In Proceedings of ACM SIGCOMM, August, 2004.
*

Network imprecision: a new consistency metric for scalable monitoring, N. Jain, OSDI 2008

* Field studies of computer system administrators: analysis of system management tools and practices, Barrett et al,  IBM Almaden
* Reducing the cost of IT operations: is automation always the answer? Brown and Hellerstein, IBM TJ Watson

4/7 Nick Jordan & Igors Svecs

[reviews] [slides]

Publish-Subscribe/CDNs
* Splitstream, M. Castro et al, SOSP 2003.
* Anysee: p2p live streaming, X. Liao et al, Infocom 2006.
* Corona: a high-performance publish-subscribe for the World Wide Web, V. Ramasubramaniam et al, Usenix NSDI 2006.

* Gryphon Home
* An efficient multicast protocol for content-based  publish-subscribe systems, G. Banavar et al, ICDCS 1999
* A reliable multicast framework for light-weight sessions and application level framing, S. Floyd et al, 1997
* SCRIBE: the design of a large-scale event notification infrastructure, A. Rowstron et al, NGC 2001.
* A shared control plane for overlay multicast, A. Nandi et al, NSDI 2007
* FeedTree: Sharing Web micronews with peer-to-peer event notification, Sandler et al, IPTPS 2005.
* Efficient Probabilistic Subsumption Checking for Content-based Publish/Subscribe Systems. A. Ouksel et al, Middleware 2006
* Matching events in a content-based subscription system.  M. K. Aguilera et al., PODC, 1999
* Amazon's CloudFront service

4/12 Indy

[reviews] [slides]

Measurement Studies

*

Understanding availability, R. Bhagwan et al, IPTPS 2003

*

Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
Krishna P. Gummadi et al, SOSP 2003

*

Measurement and Modeling of a Large-scale Overlay for Multimedia Streaming, L. Vu, I. Gupta, J. Liang, K. Nahrstedt, QShine 2007

*

An Evaluation of Amazon's Grid Computing Services: EC2, S3 and SQS, Simson Garfinkel, Harvard TechRep., 2007

*

Availability and Locality Measurements of Peer-to-Peer File Systems, J. Chu et al, SPIE 2002.

*

A measurement study of peer-to-peer file sharing systems, S. Saroui et al, MMCN 2002

*

Free riding on Gnutella
Adar and Huberman, First Monday, 2000

*

Small-world file sharing communities, A Iamnitchi et al, Infocom 2004.

4/14 Indy

[reviews] [slides]

Old Wine: Stale or Vintage?

* A comparison of approaches to large-scale data analysis, A. Pavlo et al, ACM SIGMOD 2009
* On death, taxes and the convergence of peer-to-peer and grid computing, I. Foster et al, IPTPS 2003

* 2 P2P or Not 2 P2P, M. Roussopoulos et al, IPTPS 2004.
* Scooped, again, J. Ledlie et al, IPTPS 2003.
* A Note on Distributed Computing, A. Wollrath et al, MSR Techreport, 1994
* Cloud computing is a trap, warns GNU founder Richard Stallman, Guardian (UK), Sep 29, 2008
* (paper deleted - see their updated version in their SIGMOD 2009 paper) MapReduce - a major step backwards, D. DeWitt and M. Stonebraker

4/19 Imranul Hoque

[slides] [reviews]

In Byzantium
* The Byzantine Generals problem, L. Lamport et al, TOPLAS 1982
* PeerReview: practical accountability for distributed systems, A. Haeberlen, P. Kouznetsov, P. Druschel, SOSP 2007
* Airavat: Security and Privacy for MapReduce, I. Roy et al, OSDI 2010

* UpRight Cluster Services, A. Clement et al, SOSP 2009
* Zyzzyva: Speculative Byzantine Fault Tolerance (Awarded a best paper award.)
Ramakrishna Kotla et al, SOSP 2007
* Practical Byzantine Fault-Tolerance, Castro et al, OSDI 1999.
* Preserving peer replicas by rate-limited sampled voting, P. Maniatis et al, SOSP 2003
* BAR Fault Tolerance for Cooperative Services. A. Aiyer et al, SOSP 2005.
* BAR Gossip. Harry Li et al Usenix OSDI 2006
*

Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks. Yair Amir et al, IEEE DSN 2006

*

BFT Protocols under Fire, Atul Singh et al, NSDI 2008

4/21 Wenxuan Zhou & Qingxi Li

[reviews] [slides]

Cloud Pricing
* Optimizing Cost and Performance in Online Service Provider Networks, Z. Zhang et al, NSDI 2010
* Reducing costs of spot instances via checkpointing in the Amazon Elastic Compute Cloud, S. Yi et al,? IEEE Intl.  Conf. on Cloud Computing, 2010
* Market-oriented Grids and Utility Computing: The State-of-the-art and Future Directions, J. Broberg et al, Journ. Grid Computing, 2007

4/26 Brian Cho

[reviews] [slides A] [slides B]

Other  Industrial Systems
* ACMS: The Akamai Configuration Management System
Sherman et al, NSDI 2005.
* Centrifuge: Integrated Lease Management and Partitioning for Cloud Services, A. Adya et al, NSDI 2010
* Memcached: [Short article] [Main wiki] [Using memcached at Facebook] (read first two, look closely at third)

* Chubby lock service, M. Burrows, OSDI 2006 (Google)
* Zookeeper (Yahoo!)
* Interactive Analysis of Webscale data, C. Olston et al, CIDR 2009 (Yahoo)

4/28 Indy

[reviews] [slides]

Structure of Networks

* Exploring complex networks, Steven Strogatz, Nature 2001
*

Scaling properties of the Internet graph, A. Akella et al, PODC 2003

*

Mapping the Gnutella network, M. Ripeanu et al, IEEE Computing Journal 2002

* Implicit structure and the nature of blogspace, Adar et al.
* The anatomy of a large-scale hypertextual web search engine, Brin and Page
* DHT routing using social links, S. Marti et al, IPTPS 2004.
* Duncan Watt's Small World Project, Columbia
* Jon Kleinberg's Structure of Information Networks course
* Advice on Research and Writing (take with a grain of salt)

5/3 Indy

[slides]

Completing the Circle

(No reviews required for the following papers. Paper copies for offline papers were handed out during previous lecture.)

*

World Brain, H. G. Wells, 1937

*

The tragedy of the commons, G. Hardin, 1968

*

How (and how not) to write a good SOSP paper, R. Levin and D. D. Redell, 1983

* R. Hoffmann, "Why buy that theory?", 2003
* R. P. Feynman, "Metaplast Corp."

END OF CLASSES

5/8

Project Final Report due, 11.59 pm [12pt font, single-sided, 12 + 1 pages max] (In groups of 2-3)

Wiki Term Paper - Final Draft Due (Individual)

(Deadline is Hard and final, no extensions!)

Instructions for Midterm and its Submission

Leftover
Green Clouds
*

Managing Energy and Server Resources in Hosting Centers, J. Chase et al, SOSP 2001

*

On the Energy Inefficiency of Hadoop Clusters, J. Leverich et al, HotPower 2009 [Alternative Paper Link]

*

Cost- and Energy-Aware Load Distribution Across Data Centers, Kien Le et al, HotPower 2009

*

ElasticTree: Saving Energy in Data Center Networks, B. Heller et al, NSDI 2010

* HotPower 2009
* L. Chiaraviglio et al, A Green Distributed Cooperation for Network and Content Management

Leftover   Distributed Debugging

*

D3S: Debugging Deployed Distributed Systems
Xuezheng Liu et al, OSDI 2008 (Microsoft Research)

*

WiDS Checker: Combating Bugs in Distributed Systems, X. Liu et al, NSDI 07

*

X-Trace: A Pervasive Network Tracing Framework, R. Fonseca et al, NSDI 07

*

Friday: Global Comprehension for Distributed Replay, Dennis Geels et al, NSDI 07

*

Pip: Detecting the Unexpected in Distributed Systems, P. Reynolds, NSDI 06

*

Performance Debugging for Distributed Systems of Black Boxes, A. Muthitacharoen et al, SOSP 03

*

Using Magpie for request extraction and workload modeling, P. Barham et al, OSDI 04

*

Pinpoint: Problem Determination in Large, Dynamic Internet Services, M. Chen et al, DSN 02

*

Life, Death, and the Critical Transition: Finding Liveness Bugs in Systems Code, NSDI 07

*

Using Queries for Distributed Monitoring and Forensics, A. Singh et al, EuroSys 06

Leftover
Flash!
* Characterizing Flash Memory: Anomalies, Observations, and Applications, L. Grupp et al, MICRO 2009
* Extending SSD Lifetimes with Disk-Based Write Caches, G. Soundararajan et al, FAST 2010
* DFS: A File System for Virtualized Flash Storage,
W. Josephson et al, FAST 2010

Leftover   The Middle or the End?

(review any one of the following 3 papers)

* End to end arguments in system design, Saltzer, Reed and Clark, 1984
* Middleboxes: taxonomy and issues, RFC 3234
* An End to the Middle, C. Dixon et al, Usenix HotOS 2009.

* Rethinking the design of the Internet: the end-to-end arguments vs. the brave new world, Blumenthal and Clark, ACM Trans. Internet Technology, 2001
* Middleboxes no longer considered harmful, M. Walfish et al, OSDI 2004.
* Scalable, Commodity Data Center Network Architecture, Al-Fares et al, SIGCOMM 2008
* Internet-Scale Service Efficiency, J. H. Hamilton, LADIS 2008
* Stable and Accurate Network Coordinates, Jonathan Ledlie, Peter Pietzuch, and Margo Seltzer, ICDCS 2006
* On transport layer support for peer to peer networks, H-Y. Hsieh et al, IPTPS 2004.
* A comparison of overlay routing and multihoming route control, A. Akella et al, SIGCOMM 2004.
* Consensus Routing: The Internet as a Distributed System, John P. John et al, OSDI 2008
* Overview of CAIDA Tools (give overview, and discuss at least five tools from different categories)

Leftover   Availability-Aware Systems

(read the papers, but no reviews required for this session)

*

Understanding availability, R. Bhagwan et al, IPTPS 2003

* AVCast: new approaches for implementing availability-dependent reliability for multicast receivers, T. Pongthawornkamol et al, IEEE SRDS 2006.
* AVMON: Optimal and scalable discovery of consistent availability monitoring overlays for distributed systems, R. Morales et al, IEEE TPDS 2008.

Leftover   Design Methodologies, Handling Stress

(No class today, but if you submitted a review on time, you can skip one of the remaining review sessions)

* The design of novel distributed protocols from differential equations, Distributed Computing, August 2007
*

Implementing Declarative Overlays. Boon Thau Loo et al, SOSP 2005.

*

Sinfonia: A New Paradigm for Building Scalable Distributed Systems, Marcos K. Aguilera et al, SOSP 2007

* Comparing the performance of DHTs under churn, J. Li et al, IPTPS 2004.
* Routing design in operational networks: a look from the inside, D. A. Maltz et al, SIGCOMM 2004
* (short paper) Tools for the code generation, J. Ambrosio 2003.
* A protocol family approach to survivable storage infrastructures, J. Wylie et al, Fudico 2004.
* Randomized ID selection for peer-to-peer networks, G. S. Manku, PODC 2004
* Peer-to-Peer Approach to Resource Location in Grid Environments, A. Iamnitchi et al, 2003.
* OSPF monitoring: architecture, design and deployment experience, A Shaikh et al, NSDI 2004
* Metarouting, Griffin et al, SIGCOMM 2005.
* Automatic Discovery of Mutual Exclusion Algorithms, Bar David et al, PODC 2003.

Leftover
Sources of unreliability in networks

*

Internet routing instability, C. Labovitz et al, SIGCOMM 1997

*

Characterization of failures in an IP backbone, A. Markopoulos et al, Infocom 2004.

*

The Changing Usage of a Mature Campuswide Wireless Network, Tristan Henderson et al, ACM Mobicom 2004

*

Characterising the use of a campus wireless network, D. Schwab et al, Infocom 2004.

*

Origins of Internet Routing Instability, C. Labovitz et al, INFOCOM 1999

*

Firefly-inspired Heartbeat Synchronization in Overlay Networks, O. Babaoglu, SASO 2007

*

Gossip-Based Clock Synchronization for Large Decentralized Systems, K. Iwanicki et al, SelfMan 2006: 28-42

*

On the scalability of cooperative time synchronization in pulse-connected networks, Hu and Servetto, IEEE TON 2006.

*

Locating Internet routing instabilities, A. Feldmann et al, SIGCOMM 2004.

*

A longitudinal survey of Internet host reliability, D. Long et al, SRDS 1995

*

End-to-end Internet packet dynamics, V. Paxson, SIGCOMM 1997

*

Measurement and modeling of the temporal dependence in packet loss, M. Yajnik et al, Infocom 1999

*

Route flap damping exacerbates Internet routing convergence , Z. M. Mao et al, SIGCOMM 2002

*

Route oscillations in I-BGP with route reflection,  A. Basu et al, SIGCOMM 2002

*

Stability issues in OSPF routing, A. Basu et al, SIGCOMM 20 01

*

On the effect of traffic self-similarity on network performance, K. Park et al, WSC 1997

*

Measurement and analysis of the error characteristics of an in building wireless network SIGCOMM 1996

*

Modeling the performance of wireless sensor networks, C-F. Chiasserini et al, Infocom 2004.

*

The synchronization of periodic routing messages, S. Floyd et al, IEEE/ACM TON, 1994.

*

Characterizing User Behavior and Network Performance in a Public Wireless LAN, Anand Balachandran et al, ACM SIGMETRICS 2002

Leftover
A Step Back
* A modular network layer for SensorNets, C.T. Ee et al, Usenix OSDI 2006.
* Evaluating the running time of a communication round over the Internet, O. Bakr et al, PODC 2002

* Service capacity of peer-to-peer networks, X. Yang et al, Infocom 2004.
* The capacity of wireless networks, P.  Gupta et al, IEEE Transactions on Information Theory, vol. IT-46, no. 2, pp. 388-404, March 2000

Leftover   Distributed Management (2)
*

Globus: a metacomputing infrastructure toolkit, I. Foster et al, Intnl. Journal Supercomputer Applications and High Performance Computing

*

Condor and the Grid, D. Thain et al, Wiley Journals

*

Globus and PlanetLab Resource Management Solutions Compared, M. Ripeanu et al, HPDC 2004

Leftover
Handling Stress
* Understanding availability, R. Bhagwan et al, IPTPS 2003
* Minimizing churn in distributed systems, P. Godfrey, S. Shenker, and I. Stoica, SIGCOMM 2006
* AVCast: new approaches for implementing availability-dependent reliability for multicast receivers, T. Pongthawornkamol et al, IEEE SRDS 2006.

* Handling Churn in a DHT, S. Rhea et al, Usenix 2004.
* High-reliability architectures for networks under stress, G. E. Weichenberg et al, Infocom 2004.
* Comparing the performance of DHTs under churn, J. Li et al, IPTPS 2004.

Leftover   Selfish algorithms
* The tragedy of the commons, G. Hardin, 1968
* How bad is selfish routing, T. Roughgarden et al, FOCS 2000
* Characterizing selfishly constructed overlay networks, B-G. Chun et al, Infocom 2004.

* On Selfish Routing in Internet-Like Environments, L.  Qiu, SIGCOMM 2003

Leftover
Security
* Scalability, Fidelity and Containment in the Potemkin Virtual Honeyfarm, Michael Vrable et al, SOSP 2005.
*

Vigilante: End-to-End Containment of Internet Worms, Manuel Costa, SOSP 2005.

* TinySec: A Link Layer Security Architecture for Wireless Sensor Networks, Chris Karlof et al, Sensys 2004.

*

The Sybil Attack, J. R. Douceur, IPTPS 2002

*

Secure routing in wireless sensor networks: attacks and countermeasures, C. Karlof  et al, SNPA 2003

*

Secure routing for structured peer-to-peer overlay networks, M. Castro et al, OSDI 2002

* Peer-to-Peer File Sharing and Copyright Law: A Primer for Developers,
F. von Lohmann, IPTPS 2003

Leftover    Economic Theory
*

Rationality and self-interest in peer to peer networks, J. Shneidman et et al, IPTPS 2003

*

Distributed algorithmic mechanism design: recent results and future directions, J. Feigenbaum et al, DIALM 2002.

*

To share or not to share: an analysis of incentives to contribute in collaborative file sharing environments, K. Ranganathan, Wshop Economics of P2P systems 2003

*

Incentives for Cooperation in Peer-to-Peer Networks, K. Lai, Wshop Economics of P2P systems 2003

*

(short paper) The social cost of sharing, H. R. Varian, Wshop Economics of P2P systems 2003

Leftover    The future of sensor nets?
* Research challenges in wireless networks of biomedical sensors, L. Schwiebert, ACM Sigmobile 2001
* Research challenges in environmental observation and forecasting systems, D.C. Steere et al, Mobicom 2000
* Design considerations for distributed microsensor systems, A. Chandrakasan et al, CICC 1999

* Next century challenges: mobile networking for smart dust, J.M. Jahn et al, Mobicom 1999
* System architecture directions for networked sensors, J. Hill et al, ASPLOS 2000
*

Next century challenges: scalable coordination in sensor networks, D. Estrin et al, Mobicom 1999

Leftover    P2P - Etc.
* Starfish: highly-available block storage, E. Gabber et al, Usenix 2003.
* Turning the postal system into a generic digital communication mechanism, R. Y. Wang et al, SIGCOMM 2004.

Leftover   The End-to-End Approach
*

End to end arguments in system design, Saltzer, Reed and Clark, 1984

*

ESRT : Event-to-Sink Reliable Transport in wireless sensor networks, Y. Sankarasubramaniam et al, Mobihoc 2003

*

Middleboxes: taxonomy and issues, RFC 3234, zvon.org (read entire article by following "Next" links),

*

Rethinking the design of the Internet: the end-to-end arguments vs. the brave new world, Blumenthal and Clark, ACM Trans. Internet Technology, 2001

* Untangling the Web from DNS, M. Walfish et al, NSDI 2004.

4/25
Automatic Computing and Inference
* Model checking large protocol implementations, M. Musuvathi et al, NSDI 2004.
* Overview of CAIDA Tools (give overview, and discuss at least five tools from different categories)
* Total Recall: system support for automated availability management, R. Bhagwan et al, NSDI 2004.

*
Inferring TCP Connection Characteristics Through Passive Measurements, S. Jaiswal et al, Infocom 2004.

* Multiple source, multiple destination network tomography, M. Rabbat et al, Infocom 2004.

Leftover   Modular Systems
* The Click modular router, E. Kohler et al, ACM TOCS 2000.
* A composable service model with loss and a scheduling algorithm, S. Ayyorgun et al, Infocom 2004.
* Composition and behaviors of probabilistic I/O automata, Wu et al, TCS 1997.

Leftover
Practical theory perspectives
* Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience, D. Loguinov et al, SIGCOMM 2003
* Computation in Networks of Passively Mobile Finite-State Sensors, Dana Angluin, James Aspnes, Zoe Diamadi, Michael Fischer, Rene Peralta, PODC 2004.

Leftover    Topology and Naming
*

Algorithmic aspects of topology control problems for ad hoc networks, E. Lloyd et al, Mobihoc 2002

*

Unreliable sensor grids: coverage, connectivity and diameter, S. Shakkottai et al, Infocom 2003

* An address-free architecture for dynamic sensor networks, J. Elson et al, 2000
*

Prophet address allocation for large scale MANETs, H. Zhou et al, Infocom 2003

*

Biologically Inspired Topology Control Mechanism for Multi-hop Wireless Network, Z. Huang et al, Mobihoc 2003

Leftover   Classical Algorithms
* A sqrt-N algorithm for mutual exclusion in decentralized systems, M. Maekawa, ACM TOCS, Apr. 1985.
* Replication strategies in unstructured peer-to-peer networks, E. Cohen et al, SIGCOMM 2002
* Reliable communication in the presence of failures, K.P. Birman et al, ACM TOCS, Feb 1987.

* Exploiting network proximity in peer-to-peer overlay networks, M. Castro et al, MSR TechReport 2002
*

Geometric ad-hoc routing: of theory and practice, F. Kuhn et al, PODC 2003

*

On the curvature of the Internet and its usage for overlay construction and distance estimation, Y. Shavitt et al, Infocom 2004.

* A practical distributed mutual exclusion protocol in dynamic peer-to-peer systems, S-D. Lin et al, IPTPS 2004.
* Scalable and dynamic quorum systems, Naor and Wieder, PODC 2003

Leftover   Caching

*

On the scale and performance of cooperative web proxy caching, A. Wolman et al, SOSP 1999

*

Squirrel: a decentralized, peer-to-peer web cache, S. Iyer et al, PODC 2002.

*

Caching technologies for web applications, C. Mohan (IBM), VLDB 2001

*

A churn-resistant peer-to-peer web caching system, P. Linga et al, Wshop on Survivable & Self-Regenerative Systems 2003.

*

The case for cooperative networking, V. N. Padmanabhan et al, IPTPS 2002.

*

Approximate caches for packet classification, F. Chang et al, Infocom 2004.

*

Comparing strength of locality of reference - popularity, majorization and some folk theorems, S. Vanichpun, Infocom 2004.

*

Botz-4-Sale: Surviving Organized DDoS Attacks That Mimic Flash Crowds, Srikanth Kandula et al, NSDI 2005.

Report broken links to indy at cs dawt illinois dawt edu

(c)ig

Up to Main Course Web page

大数据系列相关文章:

最新评论
newhadoop2014-09-10 02:30:51
[图片]
Gabinbin2014-09-09 02:56:46
求帮助啊、、再弄不好公司要把我开除了、
爱若飘渺2014-09-08 11:54:14
hadoop namenode -format到底把哪里格式化为hdfs了?
菱帅2014-09-08 09:00:28
#ITer涨姿势#【Hadoop科普文】时至今日,Hadoop已成为最流行的离线数据处理平台,然而它的集群配置起来并不简单。如果你学习Hadoop不久,相信下面这45个问题会对你有所帮助。请戳→_→来自CSDN的科普文 http://t.cn/8FhpJqx
realzhangxu2014-09-07 08:33:56
hadoop还是mongDB?有没建议?
万华2014-09-07 06:04:38
Error: Could not load YARN classes. This copy of Spark may not have been compiled with YARN support.
老霸王点钞机2014-09-07 12:53:21
[图片]
hadoop_d2014-09-06 03:33:47
Hadoop大数据免费公开课 免费报名地址: http://t.cn/8kkgFqN
心灵鸡汤2014-09-06 12:51:01
跪求大数据架构师,职责:负责构架与优化基于Hadoop系统的PB级别大数据仓库与大数据处理平台,日数据量30T;负责根据客户需求设计大数据技术解决方案,参与售前支持;把握Hadoop技术研究的大方向,跟进社区及主要商业版本的技术路线; 岗位要求:有相关工作经验 。工作地点:广州
罗sir2014-09-05 01:30:48
北京华联综合超市股份有限公司 Oracle retail(Retek)高级技术顾问 http://t.cn/8sBALEX BI数据分析师 http://t.cn/8sBALES 【Hadoop架构师】40W年薪 http://t.cn/8sBALEJ 广州趣乐游戏急招数值策划师,Base广州 http://t.cn/8sBALEx 风险控制员职位,薪水6-8K*15薪 http://t.cn/8sBALEi
 
  • Hadoop生态系统资料推荐