Accepted papers

# Title Author Affiliation

2 One More Bit Is Enough Yong XiaRPI
Lakshminarayanan SubramanianUniversity of California, Berkeley
Ion StoicaUniversity of California, Berkeley
Shivkumar KalyanaramanRPI

8 Metarouting Timothy G. GriffinUniversity of Cambridge
Joao Luis SobrinhoTelecommunications Institute, Lisbon

15 Declarative Routing: Extensible Routing with Declarative Queries Boon Thau LooUniversity of California, Berkeley
Joseph M. HellersteinUniversity of California, Berkeley & Intel Research Berkeley
Ion StoicaUniversity of California, Berkeley
Raghu RamakrishnanUniversity of Wisconsin, Madison

23 Fast Hash Table Lookup Using Extended Bloom Filter: An Aid to Network Processing Haoyu SongApplied Research Lab, Washington University in St. Louis
Sarang DharmapurikarApplied Research Lab, Washington University in St. Louis
Jonathan TurnerApplied Research Lab, Washington University in St. Louis
John LockwoodApplied Research Lab, Washington University in St. Louis

50 Limitations of Equation-based Congestion Control Injong RheeDepartment of Computer Science, North Carolina State University
Lisong XuDepartment of Computer Science and Engineering, University of Nebraska, Lincoln

54 Idle Sense: An Optimal Access Method for High Throughput and Fairness in Rate Diverse Wireless LANs Martin HeusseLSR-IMAG
Franck RousseauLSR-IMAG
Andrzej DudaLSR-IMAG

64 Algorithms for Advanced Packet Classification with Ternary CAMs Karthik LakshminarayananUniversity of California, Berkeley
Anand RangarajanCypress Semiconductors
Srinivasan VenkatacharyCypress Semiconductors

70 Meridian: A Lightweight Framework for Network Positioning without Virtual Coordinates Bernard WongCornell University
Aleksandrs SlivkinsCornell University
Emin Gun SirerCornell University

102 The Power of Explicit Congestion Notification Aleksandar KuzmanovicNorthwestern University

110 Towards a global IP Anycast service Hitesh BallaniCornell University
Paul FrancisCornell University

190 Rigorous specification and conformance testing techniques for network protocols, as applied to TCP, UDP, and Sockets Steve BishopUniversity of Cambridge Computer Laboratory
Matthew FairbairnUniversity of Cambridge Computer Laboratory
Michael NorrishNICTA, Canberra
Peter SewellUniversity of Cambridge Computer Laboratory
Michael SmithUniversity of Cambridge Computer Laboratory
Keith WansbroughUniversity of Cambridge Computer Laboratory

208 BLINC: Multilevel Traffic Classification in the Dark Thomas KaragiannisUC Riverside
Dina PapagiannakiIntel Research, Cambridge
Michalis FaloutsosUC Riverside

211 Re-feedback for Policing Congestion Response in an Inter-network Bob BriscoeBT Research
Arnaud JacquetBT Research
Carla Di Cairano-GilfedderBT Research
Andrea SopperaBT Research

230 OpenDHT: A Public DHT Service and Its Uses Sean RheaUniversity of California, Berkeley
Brighten GodfreyUniversity of California, Berkeley
Brad KarpIntel Research Pittsburgh and CMU
John KubiatowiczUniversity of California, Berkeley
Sylvia RatnasamyIntel Research Berkeley
Scott ShenkerUniversity of California, Berkeley and ICSI
Ion StoicaUniversity of California, Berkeley
Harlan YuPrinceton

235 On the Predictability of Large Transfer TCP Throughput Qi HeGeorgia Institute of Technology
Constantinos DovrolisGeorgia Institute of Technology
Mostafa AmmarGeorgia Institute of Technology

241 HLP: A Next-generation Interdomain Routing Protocol Lakshminarayanan SubramanianUniversity of California, Berkeley
Matthew CaesarUniversity of California, Berkeley
Cheng Tien EeUniversity of California, Berkeley
Mark HandleyUCL London
Morley MaoUniversity of Michigan
Scott ShenkerUniversity of California, Berkeley
Ion StoicaUniversity of California, Berkeley

254 Stable Policy Routing with Provider Independence Nick FeamsterMIT
Hari BalakrishnanMIT
Ramesh JohariStanford

278 Improving Accuracy in End-to-end Packet Loss Measurement Joel SommersUniversity of Wisconsin-Madison
Paul BarfordUniversity of Wisconsin-Madison
Nick DuffieldAT&T Labs-Research
Amos RonUniversity of Wisconsin-Madison

279 Profiling Internet Backbone Traffic: Behavior Models and Applications Kuai XuUniversity of Minnesota, Twin Cities
Zhi-Li ZhangUniversity of Minnesota, Twin Cities
Supratik BhattacharyyaSprint ATL

281 Dynamic Pipelining: Making IP Lookup Truly Scalable Jahangir HasanSchool of ECE, Purdue University
T. N. VijaykumarSchool of ECE, Purdue University

295 A DoS-limiting Network Architecture Xiaowei YangUniversity of California at Irvine
David WetherallUniversity of Washington
Tom AndersonUniversity of Washington

300 Towards an Evolvable Internet Architecture Sylvia RatnasamyIntel Research Berkeley
Scott ShenkerICSI and University of California, Berkeley
Steven McCanneRiverbed Technology

317 Using redundancy to cope with failures in a Delay Tolerant Network Sushant JainUniversity of Washington
Mike DemmerUniversity of California, Berkeley
Rabin PatraUniversity of California, Berkeley
Kevin FallIntel Research Berkeley

318 A Case Study in Building Layered DHT Applications Yatin ChawatheIntel Research Seattle
Sriram RamabhadranUCSD
Sylvia RatnasamyIntel Research Berkeley
Anthony LaMarcaIntel Research Seattle
Scott ShenkerICSI and University of California, Berkeley
Joseph HellersteinIntel Research Berkeley

338 Mining Anomalies Using Traffic Distributions Anukool LakhinaDept. of Computer Science, Boston University
Mark CrovellaDept. of Computer Science, Boston University
Christophe DiotIntel Research, Cambridge, UK

351 TeXCP: Responsive yet Stable Traffic Engineering Srikanth KandulaMIT
Dina KatabiMIT
Bruce DavieCisco
Anna CharnyCisco

353 BORP: Opportunistic Multi-Hop Routing for Wireless Networks Sanjit BiswasMIT
Robert MorrisMIT

  Valid XHTML 1.0! Valid CSS!