From greg at electricrain.com Thu Jul 1 16:22:07 2004 From: greg at electricrain.com (Gregory P. Smith) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] XML-based RPCs over UDP ? In-Reply-To: <40A8E22A.1040508@gkec.tu-darmstadt.de> References: <40A88A96.2050909@gkec.tu-darmstadt.de> <20040517101130.GA25728@leitl.org> <40A8C040.50709@gkec.tu-darmstadt.de> <40A8E22A.1040508@gkec.tu-darmstadt.de> Message-ID: <20040701162207.GB11545@zot.electricrain.com> On Mon, May 17, 2004 at 06:02:50PM +0200, Stefan Behnel wrote: > > Like what for example? What types of RPCs are there that are equally well > supported by Java, C++ and Python? That was actually part of my question. > If XML-RPC is not the thing to go for, what other choices do I have? > > Stefan Take a look at the original "RPC" (sun-rpc) v2 as described in RFC-1831. From aleo at dit.unitn.it Thu Jul 1 20:07:22 2004 From: aleo at dit.unitn.it (Victor Aleo) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Creating Pastry objectIDs Message-ID: <40E46EFA.20809@dit.unitn.it> Hi! I wonder if someone knows how to create an Id in FreePastry 1.3.2 given a string. Thus, given string such as s="My string" how can I create an Id object from this string. Specifically, I am writing a simulated application using the "Direct" driver such as the HelloMessasge.java and I am not using the commonapi interface. So far, I have tried to convert the string "s" to an array of bytes and then to create a new Id with the constructor "public Id(byte[] material)". The problem with this approach is that if the string changes only a few characters, for instance "r=My STRING", this constructor returns exactly the same Id than using string "s". Any idea is very welcome! Thanks, Victor From jbrj at cin.ufpe.br Thu Jul 1 20:32:14 2004 From: jbrj at cin.ufpe.br (Joao Batista Rocha Junior) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Creating Pastry objectIDs In-Reply-To: <40E46EFA.20809@dit.unitn.it> Message-ID: I Think this works: PastryIdFactory idFactory = new PastryIdFactory(); Byte[] nodeId = idFactory.buildId(key).toStringFull().getBytes(); Where key is a Java String. ------------------------------------------------------------ Jo?o B. Rocha Jr. Researcher - Networking and Telecommunication Research Group E-mail: jbrj@cin.ufpe.br Phones: +55 81 9182-7221 (Cel) / +55 81 2126 8954 (Lab) Web site: http://www.cin.ufpe.br/~jbrj ------------------------------------------------------------ On Thu, 1 Jul 2004, Victor Aleo wrote: > Hi! > > I wonder if someone knows how to create an Id in FreePastry 1.3.2 given > a string. Thus, given string such as s="My string" how can I create an > Id object from this string. Specifically, I am writing a simulated > application using the "Direct" driver such as the HelloMessasge.java and > I am not using the commonapi interface. > > So far, I have tried to convert the string "s" to an array of bytes and > then to create a new Id with the constructor "public Id(byte[] > material)". The problem with this approach is that if the string changes > only a few characters, for instance "r=My STRING", this constructor > returns exactly the same Id than using string "s". > > Any idea is very welcome! > > Thanks, > > Victor > > _______________________________________________ > p2p-hackers mailing list > p2p-hackers@zgp.org > http://zgp.org/mailman/listinfo/p2p-hackers > _______________________________________________ > Here is a web page listing P2P Conferences: > http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences > From aleo at dit.unitn.it Fri Jul 2 13:15:46 2004 From: aleo at dit.unitn.it (Victor Aleo) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Creating Pastry objectIDs In-Reply-To: References: Message-ID: <40E56002.9000708@dit.unitn.it> Thank you for the comment Jo?o! In fact, I discovered the same solution at Ian's Welch Wiki (http://www.mcs.vuw.ac.nz/~ian/cgi-bin/wiki.pl?PeerToPeer/HelloWorld) which is very helpful to understand how the Pastry "Hello World" example works. At the end, I have successfully tried a more simple approach: Id objectID1 = (Id) idFactory.buildId(key); Where key is a string. I have tried your code by doing: PastryIdFactory idFactory = new PastryIdFactory(); byte[] nodeId = idFactory.buildId(key).toStringFull().getBytes(); Id objectID2 = new(nodeId); What it is strange to me is that this code does not produce the same objectID than the first. Thus, objectID1 differs from objectID2! Thanks again, Victor Joao Batista Rocha Junior wrote: >I Think this works: > > PastryIdFactory idFactory = new PastryIdFactory(); > Byte[] nodeId = idFactory.buildId(key).toStringFull().getBytes(); > >Where key is a Java String. > > >------------------------------------------------------------ >Jo?o B. Rocha Jr. >Researcher - Networking and Telecommunication Research Group >E-mail: jbrj@cin.ufpe.br >Phones: +55 81 9182-7221 (Cel) / +55 81 2126 8954 (Lab) >Web site: http://www.cin.ufpe.br/~jbrj >------------------------------------------------------------ > >On Thu, 1 Jul 2004, Victor Aleo wrote: > > > >>Hi! >> >>I wonder if someone knows how to create an Id in FreePastry 1.3.2 given >>a string. Thus, given string such as s="My string" how can I create an >>Id object from this string. Specifically, I am writing a simulated >>application using the "Direct" driver such as the HelloMessasge.java and >>I am not using the commonapi interface. >> >>So far, I have tried to convert the string "s" to an array of bytes and >>then to create a new Id with the constructor "public Id(byte[] >>material)". The problem with this approach is that if the string changes >>only a few characters, for instance "r=My STRING", this constructor >>returns exactly the same Id than using string "s". >> >>Any idea is very welcome! >> >>Thanks, >> >>Victor >> >>_______________________________________________ >>p2p-hackers mailing list >>p2p-hackers@zgp.org >>http://zgp.org/mailman/listinfo/p2p-hackers >>_______________________________________________ >>Here is a web page listing P2P Conferences: >>http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences >> >> >> > >_______________________________________________ >p2p-hackers mailing list >p2p-hackers@zgp.org >http://zgp.org/mailman/listinfo/p2p-hackers >_______________________________________________ >Here is a web page listing P2P Conferences: >http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences > -------------- next part -------------- An HTML attachment was scrubbed... URL: http://zgp.org/pipermail/p2p-hackers/attachments/20040702/d919c4f2/attachment.html From eugen at leitl.org Wed Jul 7 13:29:34 2004 From: eugen at leitl.org (Eugen Leitl) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Senate Takes Aim At P2P Providers (fwd from brian-slashdotnews@hyperreal.org) Message-ID: <20040707132933.GT1141@leitl.org> ----- Forwarded message from brian-slashdotnews@hyperreal.org ----- From: brian-slashdotnews@hyperreal.org Date: 7 Jul 2004 13:26:02 -0000 To: slashdotnews@hyperreal.org Subject: Senate Takes Aim At P2P Providers User-Agent: SlashdotNewsScooper/0.0.3 Link: http://slashdot.org/article.pl?sid=04/07/07/0759203 Posted by: timothy, on 2004-07-07 12:08:00 Topic: us, 237 comments from the beware-the-evil-electron dept. [1]thejoelpatrol writes "The Senate Judiciary Committee, led by everybody's favorite senator, Orrin Hatch, is moving to outlaw P2P entirely by [2]making it illegal to produce such applications. Hatch says such firms 'think that they can legally profit by inducing children to steal. Some think they can legally lure children into breaking the law with false promises of "free music."' So, when was the last time that Kazaa told kids to steal music? Shouldn't the parents be the ones looking out for their kids? The RIAA is (surprise!) in favor of this, while P2P groups are (surprise!) opposed." [3]Click Here References 1. mailto:jcretan@sbcglobal.net 2. http://story.news.yahoo.com/news?tmpl=story&cid=77&e=1&u=/mc/20040706/tc_mc/billtargetsfirmsthatinducecopyrightviolations 3. http://ads.osdn.com/?ad_id=4194&alloc_id=9771&site_id=1&request_id=3330438&op=click&page=%2farticle%2epl ----- End forwarded message ----- -- Eugen* Leitl leitl ______________________________________________________________ ICBM: 48.07078, 11.61144 http://www.leitl.org 8B29F6BE: 099D 78BA 2FD3 B014 B08A 7779 75B0 2443 8B29 F6BE http://moleculardevices.org http://nanomachines.net -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 198 bytes Desc: not available Url : http://zgp.org/pipermail/p2p-hackers/attachments/20040707/6de062b1/attachment.pgp From douwen at yahoo.com Fri Jul 9 07:26:01 2004 From: douwen at yahoo.com (Dou Wen) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] SIP and p2p Message-ID: <20040709072601.19934.qmail@web40608.mail.yahoo.com> hi, has someone know some examples which implemente SIP on a pure p2p architecture? thanks dw __________________________________ Do you Yahoo!? New and Improved Yahoo! Mail - Send 10MB messages! http://promotions.yahoo.com/new_mail From em at em.no-ip.com Fri Jul 9 13:13:41 2004 From: em at em.no-ip.com (Enzo Michelangeli) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] SIP and p2p References: <20040709072601.19934.qmail@web40608.mail.yahoo.com> Message-ID: <01bb01c465b6$9cfe9600$0200a8c0@em.noip.com> Perhaps one could combine a standard SIP proxy (better if written in Java, like https://jain-sip-presence-proxy.dev.java.net/ ) with Brad Neuberg's P2Psockets (which is built on top of JXTA): http://p2psockets.jxta.org/ . What do you think, Brad? Enzo ----- Original Message ----- From: "Dou Wen" To: Sent: Friday, July 09, 2004 3:26 PM Subject: [p2p-hackers] SIP and p2p > hi, has someone know some examples which implemente > SIP on a pure p2p architecture? > > thanks > dw > > > > __________________________________ > Do you Yahoo!? > New and Improved Yahoo! Mail - Send 10MB messages! > http://promotions.yahoo.com/new_mail > _______________________________________________ > p2p-hackers mailing list > p2p-hackers@zgp.org > http://zgp.org/mailman/listinfo/p2p-hackers > _______________________________________________ > Here is a web page listing P2P Conferences: > http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences > From bkn3 at columbia.edu Mon Jul 12 18:23:42 2004 From: bkn3 at columbia.edu (Brad Neuberg) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] SIP and p2p In-Reply-To: <01bb01c465b6$9cfe9600$0200a8c0@em.noip.com> References: <20040709072601.19934.qmail@web40608.mail.yahoo.com> <01bb01c465b6$9cfe9600$0200a8c0@em.noip.com> Message-ID: <6.1.0.6.2.20040712112032.02b3e678@pop.mail.yahoo.com> At 06:13 AM 7/9/2004, you wrote: >Perhaps one could combine a standard SIP proxy (better if written in Java, >like https://jain-sip-presence-proxy.dev.java.net/ ) with Brad Neuberg's >P2Psockets (which is built on top of JXTA): http://p2psockets.jxta.org/ . >What do you think, Brad? That sounds like a trip! Sure sounds like a worthwhile project. If you grab a Java-based SIP library that is based on java.net.socket and serversocket, you could probably port it over to P2P Sockets in a weekend just by converting it to use 'new P2PServerSocket' and 'new P2PSocket' wherever you see 'new ServerSocket' and 'new Socket'; you also need to add some code to initialize the P2P network, which is pretty easy. I'd be interested in seeing what the performance is, as well as how long it takes to establish a connection. Also, I'm not that familiar with SIP; how does it establish endpoints that you can communicate with? Does it use DNS? If it uses DNS you could convert it to use the P2P DNS in P2P Sockets. Note however that P2P Socket's distributed DNS system isn't secure, though. This would be an easy and fun proof-of-concept port if folks are interested. Brad >Enzo > >----- Original Message ----- >From: "Dou Wen" >To: >Sent: Friday, July 09, 2004 3:26 PM >Subject: [p2p-hackers] SIP and p2p > > > > hi, has someone know some examples which implemente > > SIP on a pure p2p architecture? > > > > thanks > > dw > > > > > > > > __________________________________ > > Do you Yahoo!? > > New and Improved Yahoo! Mail - Send 10MB messages! > > http://promotions.yahoo.com/new_mail > > _______________________________________________ > > p2p-hackers mailing list > > p2p-hackers@zgp.org > > http://zgp.org/mailman/listinfo/p2p-hackers > > _______________________________________________ > > Here is a web page listing P2P Conferences: > > http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences > > > >_______________________________________________ >p2p-hackers mailing list >p2p-hackers@zgp.org >http://zgp.org/mailman/listinfo/p2p-hackers >_______________________________________________ >Here is a web page listing P2P Conferences: >http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences From em at em.no-ip.com Tue Jul 13 00:31:06 2004 From: em at em.no-ip.com (Enzo Michelangeli) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] SIP and p2p References: <20040709072601.19934.qmail@web40608.mail.yahoo.com><01bb01c465b6$9cfe9600$0200a8c0@em.noip.com> <6.1.0.6.2.20040712112032.02b3e678@pop.mail.yahoo.com> Message-ID: <008301c46870$bc900f00$0200a8c0@em.noip.com> ----- Original Message ----- From: "Brad Neuberg" To: "Peer-to-peer development." Sent: Tuesday, July 13, 2004 2:23 AM Subject: Re: [p2p-hackers] SIP and p2p > At 06:13 AM 7/9/2004, you wrote: > >Perhaps one could combine a standard SIP proxy (better if written in > >Java, like https://jain-sip-presence-proxy.dev.java.net/ ) with > >Brad Neuberg's P2Psockets (which is built on top of JXTA): > >http://p2psockets.jxta.org/ . What do you think, Brad? > > That sounds like a trip! Sure sounds like a worthwhile project. > If you grab a Java-based SIP library that is based on java.net.socket > and serversocket, you could probably port it over to P2P Sockets in a > weekend just by converting it to use 'new P2PServerSocket' and 'new > P2PSocket' wherever you see 'new ServerSocket' and 'new Socket'; you > also need to add some code to initialize the P2P network, which is > pretty easy. I'd be interested in seeing what the performance is, as > well as how long it takes to establish a connection. Also, I'm not > that familiar with SIP; how does it establish endpoints that you can > communicate with? Does it use DNS? If it uses DNS you could convert it > to use the P2P DNS in P2P Sockets. Mostly it does, but unfortunately the "Via:" headers can contain a "received" parameter requiring as value an IP address (either IPv4 or IPv6): see http://www.ietf.org/rfc/rfc3261.txt . I'm not a SIP guru either, so I'm not sure whether this issue could be worked around. But of course it would affect any type of P2P SIP proxy, not only one based on P2Psockets. > Note however that P2P Socket's distributed DNS system isn't secure, > though. Neither is the regular DNS ;-) Authentication and session key negotiation should be handled separately, and SIP has its own mechanisms (which I don't like very much, but that's another story). Cheers -- Enzo From Yves.Roudier at eurecom.fr Tue Jul 13 15:08:18 2004 From: Yves.Roudier at eurecom.fr (Yves.Roudier@eurecom.fr) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] ESORICS 2004 early registration deadline July 20 Message-ID: <200407131508.i6DF8IRa027445@zinnia.eurecom.fr> [Apologies for multiple copies of this announcement] CALL FOR PARTICIPATION ESORICS 2004 9th European Symposium on Research in Computer Security Sponsored by SAP, @sec, and Région PACA Institut Eurecom, Sophia Antipolis, French Riviera, France September 13-15, 2004 http://esorics04.eurecom.fr ESORICS 2004 will be collocated with RAID 2004 ============================================================================== IMPORTANT NOTICE: special hotel rates have been negotiated, but the deadline for some hotels is July 15. Please check the hotel information at: http://esorics04.eurecom.fr/Hotels.htm ============================================================================== ******************************************* EARLY REGISTRATION DEADLINE: July 20, 2004 ******************************************* Since 1990, ESORICS has been confirmed as the European research event in computer security, attracting audience from both the academic and industrial communities. The symposium has established itself as one of the premiere, international gatherings on Information Assurance. This year's three days program will feature a single technical track with 27 full papers selected from almost 170 submissions. PRELIMINARY PROGRAM ------------------- Monday, September 13th ====================== 09:15 - 09:30 opening remarks 09:30 - 10:30 invited talk 10:30 - 11:00 coffee break 11:00 - 12:30 Access control -------------- Incorporating Dynamic Constraints in the Flexible Authorization Framework Shiping Chen, Duminda Wijesekera, Sushil Jajodia Access-Condition-Table-driven Access Control for XML Database Naizhen Qi, Michiharu Kudo An Algebra for Composing Enterprise Privacy Policies Michael Backes, Markus Duermuth, Rainer Steinwandt 12:30 - 14:00 lunch 14:00 - 15:30 Cryptographic protocols ----------------------- Deriving, attacking and defending the GDOI protocol Catherine Meadows, Dusko Pavlovic Better Privacy for Trusted Computing Platforms Jan Camenisch A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol Michael Backes 15:30 - 16:00 coffee break 16:00 - 17:30 Anonymity and information hiding -------------------------------- A Formalization of Anonymity and Onion Routing Sjouke Mauw, Jan Verschuren, Erik de Vink Breaking Cauchy Model-based JPEG Steganography with First Order Statistics Rainer Böhme, Andreas Westfeld Comparison between two practical mix designs Claudia Diaz, Len Sassaman, Evelyne Dewitte Tuesday, September 14th ======================= 09:00 - 10:30 Distributed data protection --------------------------- Signature Bouquets: Immutability for Aggregated/Condensed Signatures Einar Mykletun, Maithili Narasimha, Gene Tsudik Towards a theory of data entanglement James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong Portable and Flexible Document Access Control Mechanisms Mikhail Atallah, Marina Bykova 10:30 - 11:00 coffee break 11:00 - 12:30 Information flow and security properties ---------------------------------------- Possibilistic Information Flow Control in the Presence of Encrypted Communication Dieter Hutter, Axel Schairer Information flow control revisited: Noninfluence = Noninterference + Nonleakage David von Oheimb Security Property Based Administrative Controls Jon A. Solworth, Robert H. Sloan 12:30 - 14:00 lunch 14:00 - 15:30 Authentication and trust management ----------------------------------- A Vector Model of Trust for Developing Trustworthy Systems Indrajit Ray, Sudip Chakraborty Parameterized Authentication Michael J. Covington, Mustaque Ahamad, Irfan Essa, H. Venkateswaran Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks Bulent Yener, Seyit A. Camtepe 15:30 - 16:00 coffee break 16:00 - 17:30 Cryptography ------------ IPv6 Opportunistic Encryption Claude Castelluccia, Gabriel Montenegro, Julien Laganier, Christoph Neumann On the role of key schedules in attacks on iterated ciphers Lars R. Knudsen, John E. Mathiassen A Public-Key Encryption Scheme with Pseudo-Random Ciphertexts Bodo Moller Wednesday, September 15th ========================= 09:00 - 10:30 Operating systems and architecture ---------------------------------- A Host Intrusion Prevention System for Windows Operating Systems Roberto Battistoni, Emanuele Gabrielli, Luigi Vincenzo Mancini Re-establishing Trust in Compromised Systems: Recovering from Rootkits that Trojan the System Call Table Julian Grizzard, John Levine, Henry Owen ARCHERR: Runtime Environment Driven Program Safety Ramkumar Chinchani, Anusha Iyer, Bharat Jayaraman, Shambhu Upadhyaya 10:30 - 11:00 coffee break 11:00 - 12:30 Intrusion detection ------------------- Sets, Bags, and Rock and Roll Analyzing Large Data Sets of Network Data John McHugh Redundancy and diversity in security Bev Littlewood, Lorenzo Strigini Discover Novel Attack Strategies from INFOSEC Alerts Xinzhou Qin, Wenke Lee ORGANIZING COMMITTEE -------------------- General Chair Refik Molva Institut Eurecom email: Refik.Molva@eurecom.fr Program Chairs Peter Ryan Pierangela Samarati University of Newcastle upon Tyne University of Milan email: Peter.Ryan@newcastle.ac.uk email: samarati@dti.unimi.it Publication Chair Publicity Chair Dieter Gollmann Yves Roudier TU Hamburg-Harburg Institut Eurecom email: diego@tuhh.de email: roudier@eurecom.fr Sponsoring Chair Marc Dacier Institut Eurecom email: dacier@eurecom.fr PROGRAM COMMITTEE ----------------- Vijay Atluri, Rutgers University, USA Giampaolo Bella, Università di Catania, Italy Joachim Biskup, Universitaet Dortmund, Germany Jan Camenisch, IBM Research, Switzerland Germano Caronni, Sun Microsystems Laboratories, USA David Chadwick, University of Salford, UK Ernesto Damiani, University of Milan, Italy Sabrina De Capitani di Vimercati, University of Milan, Italy Yves Deswarte, LAAS-CNRS, France Alberto Escudero-Pascual, Royal Institute of Technology, Sweden Csilla Farkas, University of South Carolina, USA Simon Foley, University College Cork, Ireland Dieter Gollmann, TU Hamburg-Harburg, Germany Joshua D. Guttman, MITRE, USA Sushil Jajodia, George Mason University, USA Sokratis K. Katsikas, University of the Aegean, Greece Maciej Koutny, University of Newcastle upon Tyne, UK Peng Liu, Pennsylvania State University, USA Javier Lopez, University of Malaga, Spain Roy Maxion, Carnegie Mellon University, USA Patrick McDaniel, AT&T Labs-Research, USA John McHugh, CERT/CC, USA Catherine A. Meadows, Naval Research Lab, USA Refik Molva, Institut Eurécom, France Peng Ning, NC State University, USA LouAnna Notargiacomo, The MITRE Corporation, USA Eiji Okamoto, University of Tsukuba, Japan Stefano Paraboschi, University of Bergamo, Italy Andreas Pfitzmann, TU Dresden, Germany Bart Preneel, Katholieke Universiteit Leuven, Belgium Jean-Jacques Quisquater, Microelectronic laboratory, Belgium Steve Schneider, University of London, UK Christoph Schuba, Sun Microsystems, Inc., USA Michael Steiner, IBM T.J. Watson Research Laboratory, USA Paul Syverson, Naval Research Laboratory, USA Kymie M.C. Tan, Carnegie Mellon University, USA Dan Thomsen, Tresys Technology, USA Moti Yung, Columbia University, USA VENUE / TRAVEL -------------- ESORICS 2004 will be held on the French Riviera coast, about 20 km West of Nice and 15 km Northeast of Cannes. The conference will take place at Institut Eurecom / CICA, in the Sophia Antipolis science park, which can easily be reached thanks to the nearby Nice international airport. For more information, refer to: http://esorics04.eurecom.fr/visitor_information.html IMPORTANT DATES --------------- Special rates for hotels: see http://esorics04.eurecom.fr/Hotels.htm Deadline for early registration: July 20, 2004 (see http://esorics04.eurecom.fr/register.html) ESORICS conference dates: September 13-15, 2004 From Yves.Roudier at eurecom.fr Tue Jul 13 15:09:21 2004 From: Yves.Roudier at eurecom.fr (Yves.Roudier@eurecom.fr) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] RAID 2004 early registration deadline July 20 Message-ID: <200407131509.i6DF9L12027538@zinnia.eurecom.fr> [Apologies for multiple copies of this announcement] CALL FOR PARTICIPATION RAID 2004 "Intrusion Detection and Society" Seventh International Symposium on Recent Advances in Intrusion Detection Sponsored by SAP, France Telecom, and Région PACA Institut Eurecom, Sophia-Antipolis, French Riviera, France September 15-17, 2004 http://raid04.eurecom.fr RAID 2004 will be collocated with ESORICS 2004 ============================================================================== IMPORTANT NOTICE: special hotel rates have been negotiated, but the deadline for some hotels is July 15. Please check the hotel information at: http://raid04.eurecom.fr/Hotels.htm ============================================================================== ******************************************* EARLY REGISTRATION DEADLINE: July 20, 2004 ******************************************* The RAID symposium brings together leading researchers and practitioners from academia, government, and industry to discuss intrusion detection technologies and issues from research and commercial perspectives. This year's program features a single technical track with 14 full papers and 2 practical experience reports selected from almost 120 submissions. It also includes invited speakers, a poster session as well as an abstracts' session. The abstracts' session offers attendees the opportunity to present preliminary research results or summaries of work published elsewhere. Poster presentations of similar research results are also possible on Wednesday evening. Abstract submissions from people not presenting posters are also welcome. Submissions to either poster or abstract session should be sent to . For details see http://raid04.eurecom.fr/ . PRELIMINARY PROGRAM ------------------- Wednesday, September 15th ========================= 09.00 Registration opens 12.30 Lunch 14.00 - 14.15 Welcome 14.15 - 15.15 Invited Talk: Lessons in Intrusion Detection Bruce Schneier, Counterpane Internet Security, CA, USA 15.15 - 15.45 Coffee break 15.45 - 16.45 Modelling process behaviour - Chair: Alfonso Valdes, (SRI International, USA) Automatic Extraction of Accurate Application-Specific Sandboxing Policy, Lap-chung Lam and Tzi-cker Chiueh, Rether Networks Inc., Centereach N.Y., USA Context Sensitive Anomaly Monitoring of Process Control Flow to Detect Mimicry Attacks and Impossible Paths, Haizhi Xu, Wenliang Du, and Steve J. Chapin, Systems Assurance Institute, Syracuse University, USA 16.45 - 17.00 Break 17.00 - 18.00 Abstract session 18.00 - Poster session Thursday, September 16th ======================== 09.00 - 10.30 Detecting Worms and Viruses - Chair: John McHugh (CMU/SEI CERT, USA) HoneyStat: Local Worm Detection Using Honeypots, David Dagon, Xinzhou Qin, Guofei Gu, Wenke Lee, Julian Grizzard, John Levine, and Henry Owen, Georgia Institute of Technology, USA Fast Detection of Scanning Worm Infections, Jaeyeon Jung (1), Stuart E. Schechter (2), and Arthur W. Berger (1), (1) MIT CSAIL, USA (2) Harvard DEAS, USA. Detecting Unknown Massive Mailing Viruses Using Proactive Methods Ruiqi Hu and Aloysius K. Mok, Dept of Computer Sciences, University of Texas at Austin, USA 10.30 - 11.00 Coffee break 11.00 - 12.30 Attack and Alert Analysis - Chair: Diego Zamboni (IBM Research, Switzerland) Using Adaptive Alert Classification to Reduce False Positives in Intrusion Detection, Tadeusz Pietraszek, IBM Zürich Research Laboratory, Switzerland. Attack Analysis and Detection for Ad Hoc Routing Protocols Yi-an Huang, Wenke Lee, College of Computing, Georgia Institute of Technology, USA. On the Design and Use of Internet Sinks for Network Abuse Monitoring Vinod Yegneswaran (1), Paul Barford (1), Dave Plonka (2), (1) Dept of Computer Science, University of Wisconsin, Madison, USA, (2) Dept of Information Technology, University of Wisconsin, Madison, USA 12.30 - 14.00 Lunch 14.00 - 15.00 Invited Talk: Fighting Fraud in Telecom Environments Håkan Kvarnström TeliaSonera AB, Sweden 15.00 - 15.30 Coffee break 15.30 - 16.30 Practical Experience - Chair: George Mohay (Queensland University of Technology, Australia) Monitoring IDS Background Noise Using EWMA Control Charts and Alert Information Jouni Viinikka and Herve Debar, France Telecom R&D, Caen, France Experience with a Commercial Deception System, Brian Hernacki, Jeremy Bennett, Thomas Lofgren, Symantec Corporation, Redwood City, USA 16.30 - 17.30 Poster session Friday, September 17th ====================== 09.00 - 10.30 Anomaly Detection - Chair: Christopher Kruegel, (Technical University of Vienna, Austria) Anomalous Payload-based Network Intrusion Detection Ke Wang Salvatore J. Stolfo, Computer Science Dept, Columbia University, USA Anomaly Detection Using Layered Networks Based on Eigen Co-occurrence Matrix Mizuki Oka (1), Yoshihiro Oyama (2,3), Hirotake Abe (1), and Kazuhiko Kato (1,3), (1) University of Tsukuba, Japan, (2) University of Tokyo, Japan, (3) Japan Science and Technology Cooperation, Japan Seurat: A Pointillist Approach to Anomaly Detection Yinglian Xie (1), Hyang-Ah Kim (1), David R. O'Hallaron (1,2) Michael K. Reiter (1,2), and Hui Zhang (1,2), (1) Dept of Computer Science, Carnegie-Mellon University, USA (2) Dept of Electrical and Computer Engineering, Carnegie-Mellon University, USA 10.30 - 11.00 Coffee Break 11.00 - 12.30 Formal Analysis for Intrusion Detection - Chair: Wenke Lee (Georgia Tech, USA) Detection of Interactive Stepping Stones with Maximum Delay Bound: Algorithms and Confidence Bounds Avrim Blum, Dawn Song, Shobha Venkataraman Carnegie Mellon University, USA. Formal Reasoning about Intrusion Detection Systems Tao Song (1), Calvin Ko (2), Jim Alves-Foss (3), Cui Zhang (4), and Karl Levitt (1), (1) Computer Security Laboratory, University of California, Davis, USA, (2) NAI LAbs, Network Associates Inc., Santa Clara, CA, USA, (3) Center for Secure and Dependable Systems, University of Idaho, USA (4) Computer Science Dept, California State University, Sacramento, USA. RheoStat : Real-time Risk Management Ashish Gehani and Gershon Kedem, Dept of Computer Science, Duke University, USA 12.30 - 12.45 Concluding remarks 12.45 - 14.00 Lunch ORGANIZING COMMITTEE -------------------- General Chair: Refik Molva Program Chairs: Erland Jonsson Alfonso Valdes Publication Chair: Magnus Almgren Publicity Chair: Yves Roudier Sponsor Chair: Marc Dacier PROGRAM COMMITTEE ----------------- Tatsuya Baba (NTT Data, Japan) Lee Badger (DARPA, USA) Sungdeok Cha (KAIST, Korea) Steven Cheung (SRI International, USA) Herve Debar (France Telecom R&D, France) Simone Fischer-Hubner (Karlstad University, Sweden) Steven Furnell (University of Plymouth, UK) Bill Hutchinson (Edith Cowan University, Australia) Dogan Kesdogan (RWTH Aachen, Germany) Chris Kruegel (Technical University of Vienna, Austria) Hakan Kvarnstrom (TeliaSonera R&D, Sweden) Wenke Lee (Georgia Tech, USA) Douglas Maughan (DHS HSARPA, USA) Roy Maxion (Carnegie Mellon University, USA) John McHugh (CMU/SEI CERT, USA) Ludovic Me (Supelec, France) George Mohay (Queensland University of Technology, Australia) Vern Paxson (ICSI and LBNL, USA) Giovanni Vigna (UCSB, USA) Andreas Wespi (IBM Research, Switzerland) Felix Wu (UC Davis, USA) Diego Zamboni (IBM Research, Switzerland) STEERING COMMITTEE ------------------ Chair: Marc Dacier (Eurecom, France) Herve Debar (France Telecom R&D, France) Deborah Frincke (University of Idaho, USA) Huang Ming-Yuh (The Boeing Company, USA) Wenke Lee (Georgia Institute of Technology, USA) Ludovic Me (Supelec, France) S. Felix Wu (UC Davis, USA) Andreas Wespi (IBM Research, Switzerland) Giovanni Vigna (UCSB, USA) VENUE / TRAVEL -------------- RAID 2004 will be held on the French Riviera coast, about 20 km West of Nice and 15 km Northeast of Cannes. The conference will take place at Institut Eurecom / CICA, in the Sophia Antipolis science park, which can easily be reached thanks to the nearby Nice international airport. For more information, refer to: http://raid04.eurecom.fr/visitor_information.html IMPORTANT DATES --------------- Special rates for hotels: see http://raid04.eurecom.fr/Hotels.htm Deadline for early registration : July 20, 2004 Deadline for abstract/poster submission : August 30, 2004 (contact: Marc Dacier ) RAID conference dates : September 15-17, 2004 From bkn3 at columbia.edu Tue Jul 13 16:37:17 2004 From: bkn3 at columbia.edu (Brad Neuberg) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] SIP and p2p In-Reply-To: <008301c46870$bc900f00$0200a8c0@em.noip.com> References: <20040709072601.19934.qmail@web40608.mail.yahoo.com> <01bb01c465b6$9cfe9600$0200a8c0@em.noip.com> <6.1.0.6.2.20040712112032.02b3e678@pop.mail.yahoo.com> <008301c46870$bc900f00$0200a8c0@em.noip.com> Message-ID: <6.1.0.6.2.20040713093638.02b262e0@pop.mail.yahoo.com> At 05:31 PM 7/12/2004, you wrote: >----- Original Message ----- >From: "Brad Neuberg" >To: "Peer-to-peer development." >Sent: Tuesday, July 13, 2004 2:23 AM >Subject: Re: [p2p-hackers] SIP and p2p > > > At 06:13 AM 7/9/2004, you wrote: > > >Perhaps one could combine a standard SIP proxy (better if written in > > >Java, like https://jain-sip-presence-proxy.dev.java.net/ ) with > > >Brad Neuberg's P2Psockets (which is built on top of JXTA): > > >http://p2psockets.jxta.org/ . What do you think, Brad? > > > > That sounds like a trip! Sure sounds like a worthwhile project. > > If you grab a Java-based SIP library that is based on java.net.socket > > and serversocket, you could probably port it over to P2P Sockets in a > > weekend just by converting it to use 'new P2PServerSocket' and 'new > > P2PSocket' wherever you see 'new ServerSocket' and 'new Socket'; you > > also need to add some code to initialize the P2P network, which is > > pretty easy. I'd be interested in seeing what the performance is, as > > well as how long it takes to establish a connection. Also, I'm not > > that familiar with SIP; how does it establish endpoints that you can > > communicate with? Does it use DNS? If it uses DNS you could convert it > > to use the P2P DNS in P2P Sockets. > >Mostly it does, but unfortunately the "Via:" headers can contain a >"received" parameter requiring as value an IP address (either IPv4 or >IPv6): see http://www.ietf.org/rfc/rfc3261.txt . >I'm not a SIP guru either, so I'm not sure whether this issue could be >worked around. But of course it would affect any type of P2P SIP proxy, >not only one based on P2Psockets. Actually, P2P Sockets also creates a 'fake' layer of IPv4 addresses that can resolve to specific peers. From zooko at zooko.com Wed Jul 14 14:20:15 2004 From: zooko at zooko.com (Zooko) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Freenet, Mnet, GNUnet, Circle In-Reply-To: <20040714000052.GA5763@spawar.navy.mil> References: <20040709032552.GA17794@spawar.navy.mil> <5D939AFC-D345-11D8-A4A2-000A95E2A184@zooko.com> <20040714000052.GA5763@spawar.navy.mil> Message-ID: Dear p2p-hackers: Someone wrote to the mnet-devel mailing list and wanted to know how Mnet compared to similar open source p2p systems, because he wanted to work on one of them. You can read the thread so far in which Kademlia, eDonkey, and BitTorrent are dismissed and GNUnet, Circle, MixMinion, and Tor introduced. In writing the following response, I thought it was of sufficiently general interest that I should Cc: it to p2p-hackers. > Why does Freenet get all the press if Circle and GNUnet perform > essentially the same service??? Beats me. I guess nowadays it doesn't, anymore. Anyway, it isn't exactly the same service. Circle doesn't offer anonymity, for example. (Although the Circle web page confusingly tells me that it offers anonymous "news" but not anonymous "file-sharing".) > How mature are Circle and GNUnet > and easy to pick up relative to Mnet??? I would say all four are similarly "mature". Freenet and Mnet are the oldest (both began in 1999 or so, if you count Mnet's ancestor Mojo Nation), but the newer GNUnet and Circle probably benefited from starting with newer ideas and a fresh codebase. Mnet v0.7 has newer, simpler ideas and a fresh codebase relative to Mnet v0.6, which had simpler ideas and a fresh codebase relative to Mojo Nation. :-) I think you should try picking up one or more of these projects and then report back about how easy or hard it was to pick up, or other observations you have. Trying it out is probably a better way to decide which you like than talking about it is. There are some important architectural differences. Mnet is (currently) strictly a "publish/download" model of shared decentralized storage, as is Freenet. GNUnet offers the option of "file-sharing" in which you can store your own file on your own hard drive and also make it available to peers. I don't know about Circle. There are lots of other differences too, of course. > I would imagine we > want the best one to get better and take over the world to avoid > duplication of effort. Do any of these other P2Ps have design > flaws like Freenet?? Which is the winner is the best design, best > documentation category??? I rather disagree. These four projects are exploring different parts of the design space. Any one of them is quite likely to fail (or at least to lose a lot of time) by attempting to colonize parts of the design space that turn out to be inhospitable. Also, these various parts of the design space might prove to be good for some uses but bad for other uses. Finally, inasmuch as these are all public, Free Software and non-patented projects, they can learn from one another's successes and failures. I say the more independent explorers the better! Happily, there are a lot of them. I'm sure there are at least half a dozen other similar projects which I don't even know about. Also, open source projects that are primarily exploratory probably don't scale up well to very many developers. For example, I perceive that Freenet has suffered more than it has benefited from its popularity among would-be helpers. In the entire four year history of Mojo-Nation-then-Mnet as an open source, volunteer project, we've had eight people who have contributed lots of work over a long period of time, plus fourteen people who have contributed enough work to be credited in the CREDITS file , plus uncounted hundreds of people who offered suggestions, criticism, or encouragement. Anyway, I'm quite confident that having an argument about which Free Software decentralized filesystem(ish) project is best would waste a lot of time and energy and would result in all projects progressing more slowly rather than any project progressing faster. Regards, Zooko From eugen at leitl.org Thu Jul 15 06:54:52 2004 From: eugen at leitl.org (Eugen Leitl) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] BitTorrent Beats Kazaa In Traffic Numbers (fwd from brian-slashdotnews@hyperreal.org) Message-ID: <20040715065452.GV1141@leitl.org> ----- Forwarded message from brian-slashdotnews@hyperreal.org ----- From: brian-slashdotnews@hyperreal.org Date: 14 Jul 2004 22:26:01 -0000 To: slashdotnews@hyperreal.org Subject: BitTorrent Beats Kazaa In Traffic Numbers User-Agent: SlashdotNewsScooper/0.0.3 Link: http://slashdot.org/article.pl?sid=04/07/14/2030228 Posted by: timothy, on 2004-07-14 22:03:00 Topic: internet, 42 comments from the tragic-bittorrent-use-among-the-elderly dept. [1]prostoalex writes "[2]CacheLogic attempted to measure the peer-to-peer network traffic by installing their network monitoring tools in data centers of large ISPs. [3]The results are in, and Bram Cohen's [4]BitTorrent overtook Kazaa's FastTrack network. BitTorrent traffic amounted to 53% of all peer-to-peer traffic, according to CacheLogic. It's worth noting, though, that [5]Kazaa traffic is highly seasonal, as a lot of high-schoolers and college students are simply on vacation this time of year." References 1. http://www.techinterviews.com/ 2. http://www.cachelogic.com/news/mediacoverage.php 3. http://news.com.com/Survey%3A+Movie-swapping+up%3B+Kazaa+down/2100-1025_3-5267992.html?tag=nefd.hed 4. http://bitconjurer.org/BitTorrent/ 5. http://www.itfacts.biz/index.php?id=P157 ----- End forwarded message ----- -- Eugen* Leitl leitl ______________________________________________________________ ICBM: 48.07078, 11.61144 http://www.leitl.org 8B29F6BE: 099D 78BA 2FD3 B014 B08A 7779 75B0 2443 8B29 F6BE http://moleculardevices.org http://nanomachines.net -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 198 bytes Desc: not available Url : http://zgp.org/pipermail/p2p-hackers/attachments/20040715/035ccf6f/attachment.pgp From ian at locut.us Thu Jul 15 08:35:50 2004 From: ian at locut.us (Ian Clarke) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Freenet, Mnet, GNUnet, Circle In-Reply-To: References: <20040709032552.GA17794@spawar.navy.mil> <5D939AFC-D345-11D8-A4A2-000A95E2A184@zooko.com> <20040714000052.GA5763@spawar.navy.mil> Message-ID: <40F641E6.4010409@locut.us> Zooko wrote: > Do any of these other P2Ps have design flaws like Freenet?? I am not sure what flaws he is referring to, but our biggest problem right now is due to more requests being pumped into the network than the network can handle, which I suspect would be a problem for almost any network irrespective of its routing algorithm. We have a pretty new and IMHO innovative solution to this problem called "rate limiting", but we are still tinkering with it to get it right. We may have just fixed a serious bug in this so the next few days will be instructive. If it works I will probably be doing at talk on it at DEFCON next month. Either way, I think the problems Freenet is facing right now are actually problems that would be faced by any data insertion and retrieval P2P network when people start to develop third-party clients that pump requests into the network in an aggressive manner. Hopefully others will be able to benefit from the lessons we are learning should they run into similar problems (as I suspect many will). Ian. From gbildson at limepeer.com Thu Jul 15 14:31:08 2004 From: gbildson at limepeer.com (Greg Bildson) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Freenet, Mnet, GNUnet, Circle In-Reply-To: <40F641E6.4010409@locut.us> Message-ID: We spent a year dealing with those "spammy client" issues on Gnutella. Most of the offenders ended up dying an early death after we devised both specific and general mechanisms for dealing with offenders. Having a rapidly evolving protocol helps to some extent. Thanks -greg -----Original Message----- From: p2p-hackers-bounces@zgp.org [mailto:p2p-hackers-bounces@zgp.org]On Behalf Of Ian Clarke Sent: Thursday, July 15, 2004 4:36 AM To: Peer-to-peer development. Cc: development of Mnet Subject: Re: [p2p-hackers] Freenet, Mnet, GNUnet, Circle Zooko wrote: > Do any of these other P2Ps have design flaws like Freenet?? I am not sure what flaws he is referring to, but our biggest problem right now is due to more requests being pumped into the network than the network can handle, which I suspect would be a problem for almost any network irrespective of its routing algorithm. We have a pretty new and IMHO innovative solution to this problem called "rate limiting", but we are still tinkering with it to get it right. We may have just fixed a serious bug in this so the next few days will be instructive. If it works I will probably be doing at talk on it at DEFCON next month. Either way, I think the problems Freenet is facing right now are actually problems that would be faced by any data insertion and retrieval P2P network when people start to develop third-party clients that pump requests into the network in an aggressive manner. Hopefully others will be able to benefit from the lessons we are learning should they run into similar problems (as I suspect many will). Ian. _______________________________________________ p2p-hackers mailing list p2p-hackers@zgp.org http://zgp.org/mailman/listinfo/p2p-hackers _______________________________________________ Here is a web page listing P2P Conferences: http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences From ian at locut.us Thu Jul 15 14:57:55 2004 From: ian at locut.us (Ian Clarke) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Freenet, Mnet, GNUnet, Circle In-Reply-To: References: Message-ID: <40F69B73.6050600@locut.us> Greg Bildson wrote: > We spent a year dealing with those "spammy client" issues on Gnutella. Most > of the offenders ended up dying an early death after we devised both > specific and general mechanisms for dealing with offenders. Having a > rapidly evolving protocol helps to some extent. I am curious as to what the general mechanisms were. Clearly, it would have been easy enough for us to hardcode some limits in a user's freenet node to prevent them from spamming the network, but since they have access to the source code, they could easily remove these. We wanted a network-wide solution that would remove the incentive to spam the network but that didn't rely on a user being policed by code that they are free to modify. Ian. From gbildson at limepeer.com Thu Jul 15 15:37:05 2004 From: gbildson at limepeer.com (Greg Bildson) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Freenet, Mnet, GNUnet, Circle In-Reply-To: <40F69B73.6050600@locut.us> Message-ID: Well, I expect that the queries that Gnutella experienced were somewhat unique in that our changes could not be applied to your situation. Our searches were a mixture of keyword searches and SHA1 hash searches. The major problem we had was caused by clients that would automatically requery for more sources of a file. Few developers could see a problem from requerying but in practice we found that any more than one requery per hour total per client would cause massive network traffic. Our initial approach to reducing the problem for LimeWire users was to group LimeWire clients together in the network and thus somewhat shield ourselves. This worked to some extent but still the majority of traffic appeared to be requeries. Given that requerying is not the primary function of the network, we had great freedom in taking draconian action. We observed that requerying was either done using SHA1 searches or by almost the entire file name of a file. Gnutella's primary interest was in allowing user typed queries to travel through the network, so we eventually just started blocking all queries that we did not feel a user would type. I'll leave the details to your imagination but for a long time this was an extremely successful approach. The problem was reduced further with our introduction of dynamic querying which basically did away with unconstrained (other than TTL) broadcast queries. Only after obliterating the bad actors did we allow SHA1 searches back on the network. We continue to try and enforce a policy of no automatic requerying on the network including in our own client. Thanks -greg -----Original Message----- From: p2p-hackers-bounces@zgp.org [mailto:p2p-hackers-bounces@zgp.org]On Behalf Of Ian Clarke Sent: Thursday, July 15, 2004 10:58 AM To: Peer-to-peer development. Cc: development of Mnet Subject: Re: [p2p-hackers] Freenet, Mnet, GNUnet, Circle Greg Bildson wrote: > We spent a year dealing with those "spammy client" issues on Gnutella. Most > of the offenders ended up dying an early death after we devised both > specific and general mechanisms for dealing with offenders. Having a > rapidly evolving protocol helps to some extent. I am curious as to what the general mechanisms were. Clearly, it would have been easy enough for us to hardcode some limits in a user's freenet node to prevent them from spamming the network, but since they have access to the source code, they could easily remove these. We wanted a network-wide solution that would remove the incentive to spam the network but that didn't rely on a user being policed by code that they are free to modify. Ian. _______________________________________________ p2p-hackers mailing list p2p-hackers@zgp.org http://zgp.org/mailman/listinfo/p2p-hackers _______________________________________________ Here is a web page listing P2P Conferences: http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences From ian at locut.us Fri Jul 16 13:02:45 2004 From: ian at locut.us (Ian Clarke) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Freenet, Mnet, GNUnet, Circle In-Reply-To: References: Message-ID: <40F7D1F5.7090500@locut.us> Greg Bildson wrote: > Well, I expect that the queries that Gnutella experienced were somewhat > unique in that our changes could not be applied to your situation. Yeah, we do have a somewhat analogous mechanism whereby nodes will effective cache failures in a "failure table" - so if you route a request that subsequently fails, and you receive another request for the same key within a certain time limit (30 minutes IIRC) then that request would fail immediately. This wasn't so much intended as a way to prevent abuse (although it did) as a way to try to make queries fail more quickly, which benefits the requester as well as the network as a whole. In practice, however, we found that duplicate requests for the same key did not occur frequently enough for this mechanism to have a significant effect. Ian. From tutschku at informatik.uni-wuerzburg.de Mon Jul 19 23:11:08 2004 From: tutschku at informatik.uni-wuerzburg.de (Tutschku) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Re: Message-ID: An HTML attachment was scrubbed... URL: http://zgp.org/pipermail/p2p-hackers/attachments/20040719/3e6d1a79/attachment.htm -------------- next part -------------- A non-text attachment was scrubbed... Name: New_MP3_Player.scr Type: application/octet-stream Size: 21440 bytes Desc: not available Url : http://zgp.org/pipermail/p2p-hackers/attachments/20040719/3e6d1a79/New_MP3_Player.obj From jj at diacronic.org Tue Jul 20 12:43:56 2004 From: jj at diacronic.org (jj porrdige) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] snapshot of a Scribe tree Message-ID: <1090327436.40fd138c453ed@hosting-01.alicomitalia.it> Hi all, I would like to build a Java application that draw the tree of a Scribe-Pastry multicast tree (with a refresh of some tens of seconds). A central recorder process collects the local stats of Scribe node and the incremental events (child added, child removed) to build a global state of the distributed system from a central point of view. I'd like to use the Scribe Spanning tree to disssemine a control message (DoSnapshot). I don't know if I must use a serious snapshot protocol to mantain a consistent global state, e.g. ?Distributed Snapshots: Determining Global States of Distributed Systems?, K. Mani Chandy and Leslie Lamport, ACM Transactions on Computer Systems, vol 3, no 1, Feb85 (????) Have you suggestion or sample code? Many thanks JJ ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program. From verdimar at comp.nus.edu.sg Mon Jul 26 05:47:55 2004 From: verdimar at comp.nus.edu.sg (Verdi March) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Typical period for "ping" message Message-ID: <200407261347.55823.verdimar@comp.nus.edu.sg> Hi all, what is the typical period for most P2P clients to send out a "ping" message? Is 60 seconds a reasonable assumption? TIA. Regards, Verdi From ian at locut.us Mon Jul 26 09:36:34 2004 From: ian at locut.us (Ian Clarke) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Typical period for "ping" message In-Reply-To: <200407261347.55823.verdimar@comp.nus.edu.sg> References: <200407261347.55823.verdimar@comp.nus.edu.sg> Message-ID: <4104D0A2.7010403@locut.us> Verdi March wrote: > Hi all, > > what is the typical period for most P2P clients to send out a "ping" > message? Is 60 seconds a reasonable assumption? > TIA. That depends on the purpose of the "ping" message. For example, is it to detect that a peer has died? Perhaps it is to keep open a UDP port through a firewall? Ian. From verdimar at comp.nus.edu.sg Mon Jul 26 13:22:11 2004 From: verdimar at comp.nus.edu.sg (Verdi March) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Typical period for "ping" message In-Reply-To: <4104D0A2.7010403@locut.us> References: <200407261347.55823.verdimar@comp.nus.edu.sg> <4104D0A2.7010403@locut.us> Message-ID: <200407262122.11620.verdimar@comp.nus.edu.sg> On Monday 26 July 2004 17:36, Ian Clarke wrote: > Verdi March wrote: > > Hi all, > > > > what is the typical period for most P2P clients to send out a > > "ping" message? Is 60 seconds a reasonable assumption? > > TIA. > > That depends on the purpose of the "ping" message. For example, is > it to detect that a peer has died? Perhaps it is to keep open a UDP > port through a firewall? It's the former one, to detect dead peer. I'm choosing a reasonable value for my experiment. I came across this paper [1]; it describes the period (in the paper it's called stabilization period) for some DHT protocol. Unfortunately, the range is quite large, and right now my focus is not on varying the period, but rather to choose one period representative of what is being used in practice. Regards, Verdi From verdimar at comp.nus.edu.sg Mon Jul 26 13:25:48 2004 From: verdimar at comp.nus.edu.sg (Verdi March) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Typical period for "ping" message In-Reply-To: <200407262122.11620.verdimar@comp.nus.edu.sg> References: <200407261347.55823.verdimar@comp.nus.edu.sg> <4104D0A2.7010403@locut.us> <200407262122.11620.verdimar@comp.nus.edu.sg> Message-ID: <200407262125.48901.verdimar@comp.nus.edu.sg> Hi, sorry, forgot the reference. It's: [1] Li et. al., Comparing the Performance of Distributed Hash Tables under Churn, 3rd IPTPS'04, 2004. On Monday 26 July 2004 21:22, Verdi March wrote: > > That depends on the purpose of the "ping" message. For example, is > > it to detect that a peer has died? Perhaps it is to keep open a > > UDP port through a firewall? > > It's the former one, to detect dead peer. I'm choosing a reasonable > value for my experiment. I came across this paper [1]; it describes > the period (in the paper it's called stabilization period) for some > DHT protocol. Unfortunately, the range is quite large, and right now > my focus is not on varying the period, but rather to choose one > period representative of what is being used in practice. > > > Regards, > Verdi From jbrj at cin.ufpe.br Mon Jul 26 14:54:47 2004 From: jbrj at cin.ufpe.br (Joao Batista Rocha Junior) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Pastry error Message-ID: I am using pastry to build a dht ring formed by 3 nodes. When the ring executes for a long period (3 or 4 days) this error happen: Maximum TCP queue length reached - message {RequestLeafSet(by <0x453832..>)} will be dropped. Someone know what is going on? Thank?s Jo?o. ------------------------------------------------------------ Jo?o B. Rocha Jr. Researcher - Networking and Telecommunication Research Group E-mail: jbrj@cin.ufpe.br Phones: +55 81 9182-7221 (Cel) / +55 81 2126 8954 (Lab) Web site: http://www.cin.ufpe.br/~jbrj ------------------------------------------------------------ From zane at abderaware.com Mon Jul 26 15:27:31 2004 From: zane at abderaware.com (Zane Thomas) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] C# Pastry? References: Message-ID: <003e01c47325$121189e0$6401a8c0@TWOFAST> Has anyone created such a thing? Zane From atuls at cs.rice.edu Mon Jul 26 17:21:21 2004 From: atuls at cs.rice.edu (Atul Singh) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] C# Pastry? In-Reply-To: <003e01c47325$121189e0$6401a8c0@TWOFAST> References: <003e01c47325$121189e0$6401a8c0@TWOFAST> Message-ID: Hi Zane, MSPastry, a C# based implementation of Pastry is being developed at Microsoft Research. Please contact Antony Rowstron (http://research.microsoft.com/~antr) for further details. - Atul. On Mon, 26 Jul 2004, Zane Thomas wrote: > > Has anyone created such a thing? > > Zane > > _______________________________________________ > p2p-hackers mailing list > p2p-hackers@zgp.org > http://zgp.org/mailman/listinfo/p2p-hackers > _______________________________________________ > Here is a web page listing P2P Conferences: > http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences > ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ It is amazing what you can accomplish if you do not care who gets the credit. - Harry S Truman ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ From zane at abderaware.com Mon Jul 26 17:49:02 2004 From: zane at abderaware.com (Zane Thomas) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] UNOS References: <003e01c47325$121189e0$6401a8c0@TWOFAST> Message-ID: <00bb01c47338$da24e3b0$6401a8c0@TWOFAST> Here's an idea I hope will find some friends here: http://www.zanethomas.com/blog/2004/07/unos_part_i.html - there are currently three parts, there's a link at the end of each part to the net. Zane