Table of Contents

• Google: or how I learned to love terabytesUrs Hölzle. 1 [doi]
• Coupon replication systemsLaurent Massoulié, Milan Vojnovic. 2-13 [doi]
• Low traffic overlay networks with large routing tablesChunqiang Tang, Melissa J. Buco, Rong N. Chang, Sandhya Dwarkadas, Laura Z. Luan, Edward So, Christopher Ward. 14-25 [doi]
• On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networksDerek Leonard, Vivek Rai, Dmitri Loguinov. 26-37 [doi]
• Denial-of-service resilience in peer-to-peer file sharing systemsDan Dumitriu, Edward W. Knightly, Aleksandar Kuzmanovic, Ion Stoica, Willy Zwaenepoel. 38-49 [doi]
• Internet traffic classification using bayesian analysis techniquesAndrew W. Moore, Denis Zuev. 50-60 [doi]
• A data streaming algorithm for estimating subpopulation flow size distributionAbhishek Kumar, Minho Sung, Jun Xu, Ellen W. Zegura. 61-72 [doi]
• Packet classification in large ISPs: design and evaluation of decision tree classifiersEdith Cohen, Carsten Lund. 73-84 [doi]
• A robust system for accurate real-time summaries of internet trafficKen Keys, David Moore, Cristian Estan. 85-96 [doi]
• On the performance characteristics of WLANs: revisitedSunwoong Choi, Kihong Park, Chong-kwon Kim. 97-108 [doi]
• Fixed point analysis of single cell IEEE 802.11e WLANs: uniqueness, multistability and throughput differentiationVenkatesh Ramaiyan, Anurag Kumar, Eitan Altman. 109-120 [doi]
• Modeling epidemic information dissemination on mobile devices with finite buffersChristoph Lindemann, Oliver P. Waldhorst. 121-132 [doi]
• Algorithmic aspects of capacity in wireless networksV. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan. 133-144 [doi]
• Empirical evaluation of multi-level buffer cache collaboration for storage systemsZhifeng Chen, Yan Zhang, Yuanyuan Zhou, Heidi Scott, Berni Schiefer. 145-156 [doi]
• The performance impact of kernel prefetching on buffer cache replacement algorithmsAli Raza Butt, Chris Gniady, Y. Charlie Hu. 157-168 [doi]
• Fast data-locality profiling of native executionErik Berg, Erik Hagersten. 169-180 [doi]
• Automatic measurement of memory hierarchy parametersKamen Yotov, Keshav Pingali, Paul Stodghill. 181-192 [doi]
• Optimal insensitive routing and bandwidth sharing in simple data networksMatthieu Jonckheere, Jorma T. Virtamo. 193-204 [doi]
• Nearly insensitive bounds on SMART schedulingAdam Wierman, Mor Harchol-Balter, Takayuki Osogami. 205-216 [doi]
• Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharingAbdesselem Kortebi, Luca Muscariello, Sara Oueslati, James W. Roberts. 217-228 [doi]
• Classifying scheduling policies with respect to higher moments of conditional response timeAdam Wierman, Mor Harchol-Balter. 229-240 [doi]
• Why is the internet traffic bursty in short time scales?Hao Jiang, Constantinos Dovrolis. 241-252 [doi]
• Fundamental bounds on the accuracy of network performance measurementsMatthew Roughan. 253-264 [doi]
• End-to-end estimation of the available bandwidth variation rangeManish Jain, Constantinos Dovrolis. 265-276 [doi]
• Optimization model of internet protocolsSteven H. Low, John Doyle, Lun Li, Ao Tang, Jiantao Wang. 277 [doi]
• Network utility maximization with nonconcave, coupled, and reliability-based uilitiesMung Chiang, Jang-Won Lee, A. Robert Calderbank, Daniel Pérez Palomar, Maryam Fazel. 277 [doi]
• Optimization and Control of Communication NetworksMung Chiang, Steven H. Low. 277 [doi]
• Joint pricing-network design and stochastic traffic engineering to manage demand uncertaintyDebasis Mitra. 278 [doi]
• An optimization based approach for cross-layer design in wireless communication networksNess B. Shroff, Xiaojun Lin. 278 [doi]
• Achieving fair rates with ingress policingJohn Musacchio, Jean C. Walrand. 278 [doi]
• A network service curve approach for the stochastic analysis of networksFlorin Ciucu, Almut Burchard, Jörg Liebeherr. 279-290 [doi]
• An analytical model for multi-tier internet services and its applicationsBhuvan Urgaonkar, Giovanni Pacifici, Prashant J. Shenoy, Mike Spreitzer, Asser N. Tantawi. 291-302 [doi]
• Managing server energy and operational costs in hosting centersYiyu Chen, Amitayu Das, Wubi Qin, Anand Sivasubramaniam, Qian Wang, Natarajan Gautam. 303-314 [doi]
• Evaluating the impact of simultaneous multithreading on network servers using real hardwareYaoping Ruan, Vivek S. Pai, Erich M. Nahum, John M. Tracey. 315-326 [doi]
• Efficient algorithms for large-scale topology discoveryBenoit Donnet, Philippe Raoult, Timur Friedman, Mark Crovella. 327-338 [doi]
• On AS-level path inferenceZhuoqing Morley Mao, Lili Qiu, Jia Wang, Yin Zhang. 339-349 [doi]
• Data streaming algorithms for accurate and efficient measurement of traffic and flow matricesQi Zhao, Abhishek Kumar, Jia Wang, Jun Xu. 350-361 [doi]
• Traffic matrices: balancing measurements, inference and modelingAugustin Soule, Anukool Lakhina, Nina Taft, Konstantina Papagiannaki, Kavé Salamatian, Antonio Nucci, Mark Crovella, Christophe Diot. 362-373 [doi]
• Rate-adaptive time synchronization for long-lived sensor networksSaurabh Ganeriwal, Deepak Ganesan, Mark H. Hansen, Mani B. Srivastava, Deborah Estrin. 374-375 [doi]
• Introducing permuted states for analyzing conflict rates in optimistic replicationAn-I Wang, Peter L. Reiher, Geoffrey H. Kuenning. 376-377 [doi]
• Predicting node availability in peer-to-peer networksJames W. Mickens, Brian D. Noble. 378-379 [doi]
• Troubleshooting multihop wireless networksLili Qiu, Paramvir Bahl, Ananth Rao, Lidong Zhou. 380-381 [doi]
• Fair operation of multi-server and multi-queue systemsDavid Raz, Benjamin Avi-Itzhak, Hanoch Levy. 382-383 [doi]
• Deadline scheduling for animation renderingEric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri, Terence Kelly, Norman Salazar, Cipriano A. Santos, Ram Swaminathan, Robert Endre Tarjan, Janet L. Wiener, Yunhong Zhou. 384-385 [doi]
• Smooth switching problem in buffered crossbar switchesSimin He, Shutao Sun, Wei Zhao, Yanfeng Zheng, Wen Gao. 386-387 [doi]
• Prediction of TCP throughput: formula-based and history-based methodsQi He, Constantinos Dovrolis, Mostafa H. Ammar. 388-389 [doi]
• A statistical framework for efficient monitoring of end-to-end network propertiesDavid B. Chua, Eric D. Kolaczyk, Mark Crovella. 390-391 [doi]
• TBBT: scalable and accurate trace replay for file server evaluationNingning Zhu, Jiawu Chen, Tzi-cker Chiueh, Daniel Ellard. 392-393 [doi]
• On the use of anycast in DNSSandeep Sarat, Vasileios Pappas, Andreas Terzis. 394-395 [doi]
• Managing memory access latency in packet processingJayaram Mudigonda, Harrick M. Vin, Raj Yavatkar. 396-397 [doi]
• Some observations on bitTorrent performanceAshwin R. Bharambe, Cormac Herley, Venkata N. Padmanabhan. 398-399 [doi]
• Theory and practice of cross-traffic estimationSridhar Machiraju, Darryl Veitch, François Baccelli, Antonio Nucci, Jean Bolot. 400-401 [doi]
• Characterizing the two-tier gnutella topologyDaniel Stutzbach, Reza Rejaie. 402-403 [doi]
• Analysis of search and replication in unstructured peer-to-peer networksSaurabh Tewari, Leonard Kleinrock. 404-405 [doi]
• An interposed 2-Level I/O scheduling framework for performance virtualizationJianyong Zhang, Anand Sivasubramaniam, Alma Riska, Qian Wang, Erik Riedel. 406-407 [doi]
• TurboSMARTS: accurate microarchitecture simulation sampling in minutesThomas F. Wenisch, Roland E. Wunderlich, Babak Falsafi, James C. Hoe. 408-409 [doi]
• A reactive channel model for expediting wireless network simulationChunyu Hu, Jennifer C. Hou. 410-411 [doi]
• Message delay in MANETRobin Groenevelt, Philippe Nain, Ger Koole. 412-413 [doi]