{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:51Z","timestamp":1750307991707,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2006,4,28]],"date-time":"2006-04-28T00:00:00Z","timestamp":1146182400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2006,4,28]]},"abstract":"<jats:p>This April 2006 issue is thin. We hope the quality will satisfy you though. Maybe because of the SIGCOMM deadline or the season holidays or both, we only received around 10 submissions and one article was selected for publication. This acceptance rate is much lower than what we would like to see for CCR, and I take this as a failure to attract the right type of contributions. CCR looks for nicely-written papers describing new ideas, new studies, new protocols, or new mechanisms in the area of computer communication. Remember that a full validation is not necessary. Also, depending on how advanced your work is, you can either submit a ten-page article or a four-page editorial (including position papers).But maybe your expectations are different? Please send us comments. We can not improve CCR without the help of our readers (did I say that already?Another unsolved issue is the implementation of CCR as an online community where articles are available online as soon as they are submitted. This online CCR community would also be used to implement a junior researcher reviewing program where Ph.D. students and recently graduate researcher could pick papers and submit their reviews.This issue of CCR is mostly made of editorials and of SIGCOMM-community news. For the first time, we received unsolicited four-page papers. We published most of them. SIGCOMM news is also richer than usual with in particular the second issue of Michalis Faloutsos' column (co-authored with Kevin Almeroth), even more hilarious than the first one. Michalis also put together a very useful resource for measurement based research: a catalogue of publicly available traffic data and analysis tools. Last, Jim Kurose helped convince Jon Crowcroft to send his list of 10 must-read papers.Among the noticeable sigcomm news, we announce the creation of a \"Test-of-Time\" award. This award recognizes a paper published 10 to 12 years ago for its significant contribution. Please contribute.<\/jats:p>","DOI":"10.1145\/1129582.1129583","type":"journal-article","created":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T22:51:53Z","timestamp":1147128713000},"page":"3-3","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Editor's message"],"prefix":"10.1145","volume":"36","author":[{"given":"Christophe","family":"Diot","sequence":"first","affiliation":[{"name":"Thomson R&amp;D Paris Lab, Boulogne, France"}]}],"member":"320","published-online":{"date-parts":[[2006,4,28]]},"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1129582.1129583","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1129582.1129583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:16Z","timestamp":1750259176000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1129582.1129583"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4,28]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,4,28]]}},"alternative-id":["10.1145\/1129582.1129583"],"URL":"https:\/\/doi.org\/10.1145\/1129582.1129583","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2006,4,28]]},"assertion":[{"value":"2006-04-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}