MétaCan
Menu
Back to cohort
Record W110329345

Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

2005· article· en· W110329345 on OpenAlex
Derek L. Eager, Carey Williamson, Sem Borst, John C. S. Lui

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsUniversity of CalgaryUniversity of Saskatchewan
Fundersnot available
KeywordsComputer sciencePresentation (obstetrics)Relevance (law)Operations researchEngineering
DOInot available

Abstract

fetched live from OpenAlex

We are pleased to present the program of the SIGMETRICS 2005 conference. The program covers a wide spectrum of performance-related topics, including peer-to-peer networks, traffic measurement and classification, bandwidth sharing and scheduling policies, network performance measurements, caching and file systems, traffic estimation and topology inference, wireless networks, network and server performance evaluation. Overall, the program features a broad mix of methodological contributions and modeling studies, balanced with a diverse range of applications of performance evaluation models and methods. The paper selection process was highly competitive. total of 237 submissions were received, of which 31 papers were accepted for presentation at the conference, while an additional 20 papers were selected for poster presentation. The papers were selected after a rigorous review process based on their originality, technical quality and relevance to the conference. For all papers, at least three independent reviews were sought from the Program Committee, whose ranks were filled with 57 established experts representing 12 countries and a variety of backgrounds in academia, industry and government institutions. For many papers, additional reviews were obtained from external specialists, resulting in a total of over 800 reviews. The final paper selection took place at the Program Committee meeting which was held at Columbia University on January 21 and 22, 2005. Throughout the entire process, every effort was made to avoid any (potential) conflict-of-interest situations, in particular during the discussions at the Program Committee meeting. A special subcommittee decided on the following two awards: Coupon Replication Systems by Laurent Massoulie, Milan Vojnovic (Microsoft Research) as the conference's best paper, and A Network Service Curve Approach for the Stochastic Analysis of Networks by Florin Ciucu, Almut Burchard, Jorg Liebeherr (University of Virginia) as the best student paper. Jussara Almeida and Thomas Bonald did an excellent job publicizing the conference. We thank Martin Arlitt, Anirban Mahanti, and Camille Sinanan for their highly capable work on finance, proceedings, and registration/local arrangements, respectively. Leana Golubchik, SIGMETRICS Chair, gave valuable advice and support at crucial moments. We received able and professional assistance from ACM Headquarters staff members, including Caryn Chan, Irene Frawley, Adrienne Griscti, Maritza Nichols, and Jessica Wilmers. Lisa Tolles, the Proceedings Coordinator at Sheridan Printing, provided dedicated and careful work on the proceedings production. Sue Williamson designed conference promotional material, with photos courtesy of the Banff/Lake Louise Tourism Bureau. The Banff Park Lodge personnel, especially Valerie Hunter-Prenger and Ann Haagaard, assisted with conference planning, and our student volunteers helped make it all happen. The main credit for the program obviously goes to the authors for contributing their finest work, as well as the tutorial speakers and the workshop organizers for their excellent contributions. We also wish to express our deep gratitude to Urs Hoelzle from Google for agreeing to give the keynote address. The Program Committee members and external reviewers made further vital contributions, lending their expertise, spending many diligent hours reviewing papers, and braving a January blizzard to attend the Program Committee meeting in New York City. We sincerely thank them for their tremendous dedication and efforts in ensuring a high-quality program. We particularly owe the members of the awards committee Thomas Bonald, Ed Coffman (chair), Arif Merchant, Philippe Nain, and Y.C. Tay for their selfless exertions in performing such a demanding task. We further thank the General Co-Chairs Derek Eager and Carey Williamson for their constant guidance, support and confidence. We are grateful to Leana Golubchik (Chair of SIGMETRICS) and several previous Program Chairs for sharing their experiences and insights. We are indebted to Sophie Majewski, Vishal Misra, Erich Nahum, and Dan Rubenstein for making the logistic arrangements for the Program Committee meeting. We applaud the Tutorial Co-Chairs Kimberly Keeton and Vishal Misra for setting up an excellent tutorial program, the Proceedings Chair Anirban Mahanti for assembling the proceedings, and the Publicity Co-Chairs Thomas Bonald and Jussara Almeida for their great job in publicizing the conference. Special thanks to Matthew Andrews, Bruce Shepherd, and Phil Whiting for contributing code to the paper assignment algorithm. Finally, big thanks to H.M. Law who served as webmaster for the conference website and administered the submission management system. Without his tireless efforts, it would have been impossible to handle hundreds of papers and reviews.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.959
Threshold uncertainty score0.180

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.066
GPT teacher head0.241
Teacher spread0.176 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations17
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicNetwork Traffic and Congestion ControlFrench-language works237,207