控件ASLanMsg是个很强大的工具，可以组织局域网中用户间消息的传递。操作时，该控件使用单向进程间通讯（IPC）机制Windows MailSlots，允许收...

完整的FTP上传、下载代码，压缩包内的DEMO直接用一个FTP站点做测试，请各位不要删站点内的东西。-integrity of the FTP upload, download code and compressed within the DEMO direct an FTP site testing, please do not delete everything inside the site.

VB telnet 源码。 英文版，只支持TELNET和TRACE ROUTE-VB telnet source. The English version only supports TELNET and TRACE ROUTE

WINDOWS网络播放软件-Windows software Webcast

用dreamweaver搭的教育网站框架。-Dreamweaver ride with the framework of educational websites.

p-持续CSMA协议下，一个用户在发送之前，先侦听信道，若是空闲，就以概率p发送出去，而以q =1-p的概率推迟到下一帧时。如果下一帧时仍是空闲，便再次以概率p发送而以q推迟到再下一帧时。直到发送成功或另外一用户开始发送时为止。若一开始就侦听到信道忙，它就等到下一帧时，然后再开始上述过程。若发生冲突，这等待一随机时间后重新开始。本实验中取q值为0.5。求的是0.5-持续CSMA。 -p-persistent CSMA agreement, a user before sending the first interception channel, if idle, with probability p sent, and to q = 1-p probability postponed to the next frames. If the next frame was still idle, they again sent with probability p and q to further postponed to the next frames. Until this a success or other users at the beginning of this date. If an interception at the start of the busy channel, it will wait till the next frames, and then begin the process. If conflict breaks out, waiting for a random period of time after the re-start. The experiments take q value of 0.5. For the 0.5-sustained CSMA.

Windows网络编程第二版补充材料,包含原代码与书中没有的NetB方面的介绍，是清华大学出版的.NET丛书里的-Network Programming Windows version of the second supplementary materials, and include the original code book not NetB the presentation, is published by the Tsinghua University. The NET Series

VC++网络高级编程:该实例向读者展示利用ATL编写ActiveX控制的编程方法-VC network programming : the reader to display examples of the use of ATL prepared ActiveX control Programming

windows消息收发程序-windows news receiving and dispatching procedure

使用winpcap将tcp报文dump到本地文件（需要下载winpcap库）-use winpcap to tcp reported to the local dump the text document (download winpcap Treasurer)

电脑之间实现消息的发送和接收，实现简单的聊天程序！-Between the computer to send and receive messages and achieve a simple chat program!