一个简单在线日历的实现过程，利用asp开发。

这是一个简单的socket编程的例子，它是基于TCP协议的，从中可以看出用TCP建立连接时客户端和服务器端的程序流程，可以用来测试本地环路。-This is a simple example of the programming socket, which is based on TCP, can be seen with the establishment of TCP connections client and server-side program flow can be used to test the local loop.

一个非常简单的例子,根据域名获得IP地址列表.主要用到了IPHostEntry类以及GetHostByName方法. -A very simple example, under the domain name to obtain a list of IP addresses. IPHostEntry the main use of the category, as well as methods gethostbyname.

无线传感器器上位机软件，用串口进行通信,可显示节点拓扑-jfdkfj kdfkdf dkfjdkfjdklfjdlf

网址管理工具的源程序 网址管理工具的源程序 -Web site management tools, source code

一个用VC实现的基于STMP协议的邮件发送实例。-VC realize a use agreement-based STMP e-mail examples.

视频聊天器,在局域网中效果很好，但在公网中不是太好！-video chat devices on the LAN with good results, but in the public network is not very good!

三个实际的例子，来展示Q o S的使用。第一个例子使用的是T C P，它在三个例子中显得最“直接了当”，因为它是“面向连接”的。第二个例子使用U D P，而且没有使用任何连接调用。最后一个例子使用的则是多播U D P-three practical examples to demonstrate Q o S use.T C P The second example is the use of U P D, but did not use any connected call. A final example is the use of multicast U P D

visual C＋＋环境下，获取网卡的地址，从中可以学习硬件编程方面的知识。-visual C++ environment, the access network card address, can learn from the hardware programming knowledge.

用VC++集成环境开发的基于TCP的网络应用程序，包括服务器端和客户端。-VC++ integrated environment with the development of TCP-based network applications, including server-side and client-side.

1-持续CSMA协议下，当一个用户要发送数据时，它首先侦听信道，看是否有其他站点在传送。如果信道忙，就持续等待直到信道空闲时，便将数据送出。若发生冲突，就等待一个随机长的时间，然后重新侦听。 对于这种协议，先考虑当前帧i时的前一帧时i-1，得到前一帧时的最后一帧frame0（相对时间最大的帧）的相对时间dt0，然后再在当前帧时查看有哪些帧的相对时间会小于dt0，这些帧若是发送就会与frame0发生冲突，所以这些帧就进入持续等待状态，这些帧并没有发送。再考虑当前帧余下的帧（dt > dt0），它们中的第一帧侦听到信道处于空闲状态，所以就发送，而其他的帧由于第一帧的发送又处于等待状态。若有大于或等于2个帧的相对时间相等，且它们又同时侦听到信道空闲时，就会同时发送而导致冲突，冲突发生后的处理方法同上两个协议的一样。 -1- CSMA continued under the agreement, when a user to send data, it first interception Channel to see if there are other sites in transmission. If Channel busy, continuing to wait until the idle channel, and put more information out. If there is conflict, it is a long wait for a random time, then re-interception. Such agreements, to consider the current frame i am one of the former when i-1, be a time before the final one frame0 (relative to the time frame) the relative dt0 time, and then when the current frame to detect what the relative time frame will be less than dt0, these frames will be sent if and frame0 conflict, th