Table of Contents

• DiST: a simple, reliable and scalable method to significantly reduce processor architecture simulation timeSylvain Girbal, Gilles Mouchard, Albert Cohen, Olivier Temam. 1-12 [doi]
• A framework for modeling and optimization of prescient instruction prefetchTor M. Aamodt, Pedro Marcuello, Paul Chow, Antonio González, Per Hammarlund, Hong Wang 0003, John Paul Shen. 13-24 [doi]
• Queueing systems with long-range dependent input process and subexponential service timesCathy H. Xia, Zhen Liu. 25-36 [doi]
• An algorithm for computing the mean response time of a single server queue with generalized on/off traffic arrivalsSebastià Galmés, Ramón Puigjaner. 37-46 [doi]
• Modeling, simulation and measurements of queuing delay under long-tail internet trafficMichele Garetto, Donald F. Towsley. 47-57 [doi]
• A hybrid systems modeling framework for fast and accurate simulation of data communication networksStephan Bohacek, João P. Hespanha, Junsoo Lee, Katia Obraczka. 58-69 [doi]
• Modeling the throughput of TCP VegasCharalampos (Babis) Samios, Mary K. Vernon. 71-81 [doi]
• Maximum and asymptotic UDP throughput under CHOKeJiantao Wang, Ao Tang, Steven H. Low. 82-90 [doi]
• Fluid models and solutions for large-scale IP networksYong Liu, Francesco Lo Presti, Vishal Misra, Donald F. Towsley, Yu Gu. 91-101 [doi]
• Resilient multicast using overlaysSuman Banerjee, Seungjoon Lee, Bobby Bhattacharjee, Aravind Srinivasan. 102-113 [doi]
• Incrementally improving lookup latency in distributed hash table systemsHui Zhang 0002, Ashish Goel, Ramesh Govindan. 114-125 [doi]
• Measuring the effects of internet path faults on reactive routingNick Feamster, David G. Andersen, Hari Balakrishnan, M. Frans Kaashoek. 126-137 [doi]
• Internet intrusions: global characteristics and prevalenceVinod Yegneswaran, Paul Barford, Johannes Ullrich. 138-147 [doi]
• Conductance and congestion in power law graphsChristos Gkantsidis, Milena Mihail, Amin Saberi. 148-159 [doi]
• Run-time modeling and estimation of operating system power consumptionTao Li, Lizy Kurian John. 160-171 [doi]
• Effects of clock resolution on the scheduling of interactive and soft real-time processesYoav Etsion, Dan Tsafrir, Dror G. Feitelson. 172-183 [doi]
• Analysis of cycle stealing with switching costTakayuki Osogami, Mor Harchol-Balter, Alan Scheller-Wolf. 184-195 [doi]
• A recursive random search algorithm for large-scale network parameter configurationTao Ye, Shivkumar Kalyanaraman. 196-205 [doi]
• Fast accurate computation of large-scale IP traffic matrices from link loadsYin Zhang, Matthew Roughan, Nick G. Duffield, Albert G. Greenberg. 206-217 [doi]
• Analysis of LAS scheduling for job size distributions with high varianceIdris A. Rai, Guillaume Urvoy-Keller, Ernst Biersack. 218-228 [doi]
• Fairness and efficiency in web server protocolsEric J. Friedman, Shane G. Henderson. 229-237 [doi]
• Classifying scheduling policies with respect to unfairness in an M/GI/1Adam Wierman, Mor Harchol-Balter. 238-249 [doi]
• Estimating membership in a multicast sessionSara Alouf, Eitan Altman, Chadi Barakat, Philippe Nain. 250-260 [doi]
• Efficient implementation of a statistics counter architectureSriram Ramabhadran, George Varghese. 261-271 [doi]
• Data cache locking for higher program predictabilityXavier Vera, Björn Lisper, Jingling Xue. 272-282 [doi]
• Effect of node size on the performance of cache-conscious B:::+:::-treesRichard A. Hankins, Jignesh M. Patel. 283-294 [doi]
• Analysis of TCP s computational energy cost for mobile computingBokyung Wang, Suresh Singh. 296-297 [doi]
• Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithmsRudra Dutta, Shu Huang, George N. Rouskas. 298-299 [doi]
• Dynamic resource allocation for shared data centers using online measurementsAbhishek Chandra, Weibo Gong, Prashant J. Shenoy. 300-301 [doi]
• A self-tuning structure for adaptation in TCP/AQM networksHonggang Zhang, Donald F. Towsley, C. V. Hollot, Vishal Misra. 302-303 [doi]
• Characterizing and measuring path diversity of internet topologiesRenata Teixeira, Keith Marzullo, Stefan Savage, Geoffrey M. Voelker. 304-305 [doi]
• CacheCOW: providing QoS for storage system cachesPawan Goyal, Dharmendra S. Modha, Renu Tewari. 306-307 [doi]
• Characterization of essential dynamic instructionsSteven Lumetta, Sanjay J. Patel. 308-309 [doi]
• On the effectiveness of movement prediction to reduce energy consumption in wireless communicationSrijan Chakraborty, David K. Y. Yau, John C. S. Lui. 310-311 [doi]
• Robustness of multicast congestion control to inflated subscriptionSergey Gorinsky, Sugat Jain, Harrick M. Vin, Yongguang Zhang. 312-313 [doi]
• Choosing an accurate network path modelAlmudena Konrad, Anthony D. Joseph. 314-315 [doi]
• An empirical evaluation of wide-area internet bottlenecksAditya Akella, Srinivasan Seshan, Anees Shaikh. 316-317 [doi]
• Using SimPoint for accurate and efficient simulationErez Perelman, Greg Hamerly, Michael Van Biesbrouck, Timothy Sherwood, Brad Calder. 318-319 [doi]
• Spectroscopy of DNS update trafficAndre Broido, Evi Nemeth, Kimberly C. Claffy. 320-321 [doi]
• Gated asymptotic modEls (GAMEs): a new tool for the stability analysis of queueing systemsMarco Ajmone Marsan, Mirko Franceschinis, Paolo Giaccone, Emilio Leonardi, Fabio Neri, Alessandro Tarello. 322-323 [doi]
• Priority queueing with finite buffer size and randomized push-out mechanismKonstantin Avrachenkov, Nikita O. Vilchevsky, Georgy L. Shevlyakov. 324-325 [doi]
• Performance of estimated traffic matrices in traffic engineeringMatthew Roughan, Mikkel Thorup, Yin Zhang. 326-327 [doi]