SIGCOMM 2005Papers (and some slides) available atPapers (and some slides) available athttp://www.acm.org/sigs/sigcomm/sigcomm2005/techprog.html

Computer Networks & CommunicationsUniversität PassauJens Oberender

Statistics

255 submissions, 10.5% acceptance (27)255 submissions, 10.5% acceptance (27)1.100 reviews, 45k lines of text

Total of 750 authorsMost accepted papers had 3 to 4 authorsMost accepted papers had 3 to 4 authors

05.01.2009 SIGCOMM 2005 2

Overview

Invited TalksInvited TalksPapersPeople People Grants

05.01.2009 SIGCOMM 2005 3

Vinton G. Cerf,Robert E. KahnTouring Lecture

Vinton G. Cerf Robert E. Kahn

Design of Cooperation Mechanisms between Computers and Networks, namely TCP/IP1972 ARPANET -> IP1974 TCPInternet is fully accepted from governmentsInternet is fully accepted from governmentsDistinguish

NameAddressRoute

“8 bit considered sufficient for host addresses” ☺

05.01.2009 SIGCOMM 2005 4

8 bit considered sufficient for host addresses ☺

Paul Mockapetris, Nominum Inc.

The Internet and Identifiers KeynoteThe Internet and Identifiers, Keynote

DNS is more than DNSDistribute itselfProvide host namesBe extensible (DNSSec)

private DNS servers with separated name spaceUsability = good^2 bad^2Usability = good^2 – bad^2

10^12 IDs10^10 users10^11 transactions / day

Imbed data processing into data paths

05.01.2009 SIGCOMM 2005 5

Overview

Invited TalksInvited TalksPapersPeople People Grants

05.01.2009 SIGCOMM 2005 6

Timothy G. Griffin, University of Cambridge Joao Luis Sobrinho, Telecommunications Institute, Lisbon:Meta Routing

Finding algebra properties that guarantee g g p p gconvergence of routing protocolsProtocol = Mechanism + Policy

propagation describepropagation describehow establish adjacency

Algebra A = (Σ, <=, L, +, O)guarantee protocol correctnessguarantee protocol correctness

Monotonic plus certain propertiesStrict monotonic

05.01.2009 SIGCOMM 2005 7

Lakshminarayanan Subramanian, Matthew Caesar, Cheng Tien Ee, Scott Shenker, Ion Stoica, UC Berkeley Mark Handley, UCL London Morley Mao, University of Michigan HLP: next generation inter-domain routing protocol

Problem: large, dynamic routing cases large tables, g , y g g ,involving many nodesPeering relationshipsTree-ordered nodes Tree ordered nodes, where only top-nodes must be informed on current changeson current changesControl message reduction by factor 50I l t ti Implementation as filter for BGP

05.01.2009 SIGCOMM 2005 8

Yong Xia, RPI. Lakshminarayanan Subramanian, Berkeley. Ion Stoica, Berkeley. Shi k K l RPI Shivkumar Kalyanaraman, RPI. One more bit is enough

05.01.2009 SIGCOMM 2005 9

Sean Rhea, Brighten Godfrey, John Kubiatowicz, Ion Stoica, UC Berkeley Brad Karp, Intel Research Pittsburgh and CMU Sylvia Ratnasamy, Intel Research BerkeleyScott Shenker UC Berkeley and ICSI Harlan Yu Princeton Scott Shenker, UC Berkeley and ICSI , Harlan Yu, Princeton openDHT

Protect system resources: disk-per-timey pdistinguish eager users from maliciousAccept r bytes/sec new data at all times

http://opendht.org

05.01.2009 SIGCOMM 2005 10

Bernard Wong, Cornell University Aleksandrs Slivkins, Cornell University Emin Gun Sirer, Cornell UniversityEmin Gun Sirer, Cornell UniversityMeridian Location Service

Multi-resolution rings (one-dimensional by RTT)g ( y )Ask four nodes in the determined distanceIterate, until found

AppElection of Central LeaderElection of Central Leaderhttp://Closestnode.com

05.01.2009 SIGCOMM 2005 11

Yatin Chawathe, Sylvia Ratnasamy, Anthony LaMarca, Joseph Hellerstein, Intel Research Seattle Sriram Ramabhadran, UCSD S tt Sh k ICSI/UC B k l Scott Shenker, ICSI/UC Berkeley Layered DHT applications

Range query g q ytransformed to put,get only

05.01.2009 SIGCOMM 2005 12

Sushant Jain, Univ of Washington, Mike Demmer, UC Berkeley Rabin Patra, UC Berkeley Kevin Fall, Intel Research Berkeley Using redundancy to cope with failures in a Delay Tolerant Network

05.01.2009 SIGCOMM 2005 13

Sanjit Biswas, Robert Morris, MIT Student, Best Paper Award:ExOr, Opportunistic Multi-Hop Routing for Wireless Networks

Set response order in approximated distanceProbabilities of successful submission decrease with distanceClosest to target reports firstIterateIterateSuccessfully transfers select paths

05.01.2009 SIGCOMM 2005 14

Anukool Lakhina, Mark Crovella, Boston University Christophe Diot, Intel Research, Cambridge, UK Mining Anomalies Using Traffic Feature Mining Anomalies Using Traffic Feature Distribution

Packet and size entropy analysis

05.01.2009 SIGCOMM 2005 15

Xiaowei Yang, University of California at Irvine David Wetherall, University of WashingtonTom Anderson, University of Washington , y gDoS limiting architecture

“Capabilities” Capabilities allow sendingLegacy compatibility, g y p y,but without quality guarantees

05.01.2009 SIGCOMM 2005 16

Steve Bishop, Matthew Fairbairn, Peter Sewell, Michael Smith, Keith Wansbrough, University of Cambridge Michael Norrish, NICTA, Canberra Michael Norrish, NICTA, Canberra Rigorous Specification of TCP

HOL machine proof checksHOL machine proof checks7 man years, 350 pages

05.01.2009 SIGCOMM 2005 17

Bob Briscoe, Arnaud Jacquet, Carla Di Cairano-Gilfedder, Andrea Soppera, Martin Koyabe, BT Research Alessandro Salvatori, Eurecom and BT Research ,Policing congestion response using re-feedback

Backbone policingEgress dropperEgress dropper

05.01.2009 SIGCOMM 2005 18

Sachin Katti, Dina Katabi, Katarzyna Puchala, MIT :Slicing the Onion: Anonymous Routing w/o PKISlicing the Onion: Anonymous Routing w/o PKI

Information to be split onto disjoint pathsp j pOnly destination is able to recombine data

05.01.2009 SIGCOMM 2005 19

Augustin Chaintreau, James Scott, Richard Gass, Jon Crowcroft, Christophe Diot (Intel Research Cambridge)Pan Hui (University of Cambridge)( y g )Pocket Switched Networks

For areas without any infrastructureFor areas without any infrastructureUncertain routing(what device will meet which one)( )WLAN Web server to store things

05.01.2009 SIGCOMM 2005 20

Boon Thau Loo, Ion Stoica (University of California, Berkeley) Joseph M. Hellerstein (UC, Berkeley & Intel Research Berkeley) Raghu Ramakrishnan (University of Wisconsin, Madison) :g ( y , )Declarative Routing with Queries

Between hard coded and active networkingDatalog query processorprocessor

05.01.2009 SIGCOMM 2005 21

Hitesh Ballani, Cornell University Paul Francis, Cornell University Towards global IP Anycast

Reach a single group g g pnodeProxy IP Anycast ServiceServiceDecouple issue from routingApp: reaching overlays, i3

05.01.2009 SIGCOMM 2005 22

Sylvia Ratnasamy, Intel Research Berkeley Scott Shenker, ICSI and U.C.Berkeley Steven McCanne, Riverbed Technology , gyTowards an Evolvable Internet Architecture

Retain market structureAllow innovative changeschangesUniversal accessgrants service, even if not yet rolled out at own ISP

tunnelingtunneling

05.01.2009 SIGCOMM 2005 23

Posters of Interest

Zhao, Chen, Bindel / NorthwesternU:Zhao, Chen, Bindel / NorthwesternU:Scalable Deterministic Overlay Network DiagnosisGupta, Dinda, Bustamante / NorthwesternU: Di t ib t d P l it I diDistributed Popularity Indices

05.01.2009 SIGCOMM 2005 24

Peoplep

05.01.2009 SIGCOMM 2005 25

GrantsGrants

NSF, Dave ClarkR h G t Research Grants

Future Internet Design Project (FIND): Future Internet Design Project (FIND): An upcoming NSF initiative

Security, Robustnessy,Easy to manageNon-technical considerations

NGI devices

05.01.2009 SIGCOMM 2005 27

NSF, Larry PetersonR h G t Research Grants

GENI: Global Environment for Network GENI: Global Environment for Network Investigation

Research is good, but not sufficientg ,Delivering technology out of the development cycle

Remarks: discussion, whether industry and international partners participate well enough

05.01.2009 SIGCOMM 2005 28

Finally, all pieces of luggage arrived!y, p gg g

05.01.2009 SIGCOMM 2005 29