<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>6651</REFNUM><AUTHORS><AUTHOR>Evans,J.H.</AUTHOR><AUTHOR>Dickman,P.</AUTHOR></AUTHORS><YEAR>2002</YEAR><TITLE>Peer-to-Peer Programming with Teaq</TITLE><PLACE_PUBLISHED>Web Engineering and Peer-to-Peer Computing (workshops at Networking 2002) LNCS 2376</PLACE_PUBLISHED><PUBLISHER>LNCS, Springer</PUBLISHER><PAGES>289-294</PAGES><ISBN>3-540-44177-8</ISBN><LABEL>Evans:2002:6651</LABEL><KEYWORDS><KEYWORD>peer-to-peer</KEYWORD></KEYWORDS<ABSTRACT>This paper introduces Teaq, a new peer-to-peer programming model and implementation that places processes into a self-healing, ordered spanning tree, across which distributed object queries are routed. The programmer has control over where in the tree their process resides, how their queries are routed through the tree, and how result objects are generated and passed back to the query initiator. Default implementations are provided that the programmer may specialise. This paper introduces the two main algorithms for maintaining the tree and routing queries.</ABSTRACT></RECORD></RECORDS></XML>