|
[Dwyer 86] R. A. Dwyer.”A simple divide-and-conquer algorithm for computing Delaunay triangulations in O(n loglog n ) expected time,” in Proc.2nd, Annual Symp. Computational Geometry, Yorktown Heights ,1986 , Pages 276 -284. [Eclipse 04] [online] The Eclipse Foundation organization, Inc,2004 , available at http://www.eclipse.org . [eDonkey 03] [online] electronic donkeys (c) MetaMachine, 2003,availiabe at http://www.edonkey.com . [Fortune 87] S.Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmic 2, 1987, Pages 153-174. [Gnultella 00] [online] Justin Frankel and Tom Pepper of Nullsoft ,Gnutella,14,March,2000 ,avialiable at http://en.wikipedia.org/wiki/gnutella. [Hu 05] Shun-Yun Hu, “Scalable Peer-to-peer Networked VirtualEnvironment,” Master’s thesis, Tamkang Univ, Taiwan, 2005. [Hu 04] Shun-Yun Hu and Guan-Ming Liao, “Scalable Peerto- Peer Networked Virtual Environment” in Proc.ACM SIGCOMM 2004 workshops on NetGames,Aug.2004, Pages, 129-133. [MMOG 05] Woodcock, Bruce Sterling “An Analysis of MMOG Subscription Growth” MMOGCHART.COM Nov 2004. 1, Jan 2005. http://www.mmog chart.com. [Napster 03] Napster LLC and subscription service, 2003-2006 Abvailable at http://www.napster.com. [RFC 768] User Datagram Protocol RFC 768 IETF ,January, 1983. [RFC 821] J. Postel Simple Mail Transfer Protocol RFC 821 IETF ,January, 1982. [RFC 854] Postel &Reynolds TELNET PROTOCOL SPECIFICATION RFC 854 IETF, January 1983. [RFC 959] Postel & Reynolds FILE TRANSFER PROTOCOL RFC 959 IETF , January 1985. [RFC 1180] Socolofsky & Kale A TCP/IP Tutorial IETF RFC 1180 IETF ,January 1991. [RFC 2460] S. Deering, R. Hinden, Internet Protocol, Version 6 Specification(IPv6) , RFC 2460, December 1998. [Sangoma 05] TCP/IP and IPX Routing Tutorial ,Sangoma Technologies Corp. 2005 http://www.sangoma.com. [Singhal&Zyda 99] S. Singhal and M. Zyda,Networked Virtual Environments : Design and Implementation. ACM Press,New York,1999.
|