蜜桃麻豆www久久,久久av免费天堂小草播放,国内精品久久久久久中文字幕

Unix�|�络�~�程�W�三�?卷一:套接字联�|�API学习�W�记(3)

Wed, 17 May 2006 01:42:00 GMT

TCP�q�接的徏立和�l�止

��Z��帮助我们理解conncet�Q�accept�Q�close�q�几个函敎ͼ�以及使用netstat工具来调试TCP应用�E�序�Q�我们必��ȝ��解TCP�q�接是如何徏立和�l�止的和TCP状态�{换图�?br />

三次握手

当一个TCP�q�接建立�Ӟ��发生了以下场景：

The server must be prepared to accept an incoming connection. This is normally done by calling socket, bind, and listen and is called a passive open.
The client issues an active open by calling connect. This causes the client TCP to send a "synchronize" (SYN) segment, which tells the server the client's initial sequence number for the data that the client will send on the connection. Normally, there is no data sent with the SYN; it just contains an IP header, a TCP header, and possible TCP options (which we will talk about shortly).
The server must acknowledge (ACK) the client's SYN and the server must also send its own SYN containing the initial sequence number for the data that the server will send on the connection. The server sends its SYN and the ACK of the client's SYN in a single segment.
The client must acknowledge the server's SYN.

最��需要三�ơ包交换�Q�因此称作TCP的三�ơ握手，如下图所�C�：
囄��Q� TCP 的三�ơ握�?/p>

We show the client's initial sequence number as J and the server's initial sequence number as K. The acknowledgment number in an ACK is the next expected sequence number for the end sending the ACK. Since a SYN occupies one byte of the sequence number space, the acknowledgment number in the ACK of each SYN is the initial sequence number plus one. Similarly, the ACK of each FIN is the sequence number of the FIN plus one.

An everyday analogy for establishing a TCP connection is the telephone system [Nemeth 1997]. The socket function is the equivalent of having a telephone to use. bind is telling other people your telephone number so that they can call you. listen is turning on the ringer so that you will hear when an incoming call arrives. connect requires that we know the other person's phone number and dial it. accept is when the person being called answers the phone. Having the client's identity returned by accept (where the identify is the client's IP address and port number) is similar to having the caller ID feature show the caller's phone number. One difference, however, is that accept returns the client's identity only after the connection has been established, whereas the caller ID feature shows the caller's phone number before we choose whether to answer the phone or not. If the DNS is used (Chapter 11), it provides a service analogous to a telephone book. getaddrinfo is similar to looking up a person's phone number in the phone book. getnameinfo would be the equivalent of having a phone book sorted by telephone numbers that we could search, instead of a book sorted by name.

TCP 选项

Each SYN can contain TCP options. Commonly used options include the following:

MSS option. With this option, the TCP sending the SYN announces its maximum segment size, the maximum amount of data that it is willing to accept in each TCP segment, on this connection. The sending TCP uses the receiver's MSS value as the maximum size of a segment that it sends. We will see how to fetch and set this TCP option with the TCP_MAXSEG socket option (Section 7.9).
Window scale option. The maximum window that either TCP can advertise to the other TCP is 65,535, because the corresponding field in the TCP header occupies 16 bits. But, high-speed connections, common in today's Internet (45 Mbits/sec and faster, as described in RFC 1323 [Jacobson, Braden, and Borman 1992]), or long delay paths (satellite links) require a larger window to obtain the maximum throughput possible. This newer option specifies that the advertised window in the TCP header must be scaled (left-shifted) by 0�?4 bits, providing a maximum window of almost one gigabyte (65,535 x 2¹⁴). Both end-systems must support this option for the window scale to be used on a connection. We will see how to affect this option with the SO_RCVBUF socket option (Section 7.5).
To provide interoperability with older implementations that do not support this option, the following rules apply. TCP can send the option with its SYN as part of an active open. But, it can scale its windows only if the other end also sends the option with its SYN. Similarly, the server's TCP can send this option only if it receives the option with the client's SYN. This logic assumes that implementations ignore options that they do not understand, which is required and common, but unfortunately, not guaranteed with all implementations.
Timestamp option. This option is needed for high-speed connections to prevent possible data corruption caused by old, delayed, or duplicated segments. Since it is a newer option, it is negotiated similarly to the window scale option. As network programmers there is nothing we need to worry about with this option.

These common options are supported by most implementations. The latter two are sometimes called the "RFC 1323 options," as that RFC [Jacobson, Braden, and Borman 1992] specifies the options. They are also called the "long fat pipe options," since a network with either a high bandwidth or a long delay is called a long fat pipe. Chapter 24 of TCPv1 contains more details on these options.

TCP �q�接的终�?/h4>
TCP建立旉��要三�ơ通知�Q�而终止一个TCP�q�接旉��要四�ơ通知�?br />One application calls `close` first, and we say that this end performs the active close. This end's TCP sends a FIN segment, which means it is finished sending data.
The other end that receives the FIN performs the passive close. The received FIN is acknowledged by TCP. The receipt of the FIN is also passed to the application as an end-of-file (after any data that may have already been queued for the application to receive), since the receipt of the FIN means the application will not receive any additional data on the connection.
Sometime later, the application that received the end-of-file will `close` its socket. This causes its TCP to send a FIN.
The TCP on the system that receives this final FIN (the end that did the active close) acknowledges the FIN.
Since a FIN and an ACK are required in each direction, four segments are normally required. We use the qualifier "normally" because in some scenarios, the FIN in Step 1 is sent with data. Also, the segments in Steps 2 and 3 are both from the end performing the passive close and could be combined into one segment. We show these packets in Figure 2.3.
Figure 2.3. Packets exchanged when a TCP connection is closed.
A FIN occupies one byte of sequence number space just like a SYN. Therefore, the ACK of each FIN is the sequence number of the FIN plus one.
Between Steps 2 and 3 it is possible for data to flow from the end doing the passive close to the end doing the active close. This is called a half-close and we will talk about this in detail with the `shutdown` function in Section 6.6.
The sending of each FIN occurs when a socket is closed. We indicated that the application calls `close` for this to happen, but realize that when a Unix process terminates, either voluntarily (calling `exit` or having the `main` function return) or involuntarily (receiving a signal that terminates the process), all open descriptors are closed, which will also cause a FIN to be sent on any TCP connection that is still open.
Although we show the client in Figure 2.3 performing the active close, either end—the client or the server—can perform the active close. Often the client performs the active close, but with some protocols (notably HTTP/1.0), the server performs the active close.

TCP 状态�{换图

关于TCP�q�接的徏立和�l�止操作可以�׃��个状态�{换图来详�l�说明，如下图所�C�：
囄��Q�TCP 状态�{换图

There are 11 different states defined for a connection and the rules of TCP dictate the transitions from one state to another, based on the current state and the segment received in that state. For example, if an application performs an active open in the CLOSED state, TCP sends a SYN and the new state is SYN_SENT. If TCP next receives a SYN with an ACK, it sends an ACK and the new state is ESTABLISHED. This final state is where most data transfer occurs.

The two arrows leading from the ESTABLISHED state deal with the termination of a connection. If an application calls close before receiving a FIN (an active close), the transition is to the FIN_WAIT_1 state. But if an application receives a FIN while in the ESTABLISHED state (a passive close), the transition is to the CLOSE_WAIT state.

We denote the normal client transitions with a darker solid line and the normal server transitions with a darker dashed line. We also note that there are two transitions that we have not talked about: a simultaneous open (when both ends send SYNs at about the same time and the SYNs cross in the network) and a simultaneous close (when both ends send FINs at the same time). Chapter 18 of TCPv1 contains examples and a discussion of both scenarios, which are possible but rare.

One reason for showing the state transition diagram is to show the 11 TCP states with their names. These states are displayed by netstat, which is a useful tool when debugging client/server applications. We will use netstat to monitor state changes in Chapter 5.

观察包（Watching the Packets�Q?/h4>
下土昄��了一个TCP�q�接实际发生的包交换情况�Q�连接徏立，数据传输和连接终止。在每一端传输的时候，也给��Z��TCP状态。�?br />TCP �q�接的包交换
The client in this example announces an MSS of 536 (indicating that it implements only the minimum reassembly buffer size) and the server announces an MSS of 1,460 (typical for IPv4 on an Ethernet). It is okay for the MSS to be different in each direction (see Exercise 2.5).
Once a connection is established, the client forms a request and sends it to the server. We assume this request fits into a single TCP segment (i.e., less than 1,460 bytes given the server's announced MSS). The server processes the request and sends a reply, and we assume that the reply fits in a single segment (less than 536 in this example). We show both data segments as bolder arrows. Notice that the acknowledgment of the client's request is sent with the server's reply. This is called piggybacking and will normally happen when the time it takes the server to process the request and generate the reply is less than around 200 ms. If the server takes longer, say one second, we would see the acknowledgment followed later by the reply. (The dynamics of TCP data flow are covered in detail in Chapters 19 and 20 of TCPv1.)
We then show the four segments that terminate the connection. Notice that the end that performs the active close (the client in this scenario) enters the TIME_WAIT state. We will discuss this in the next section.
It is important to notice in Figure 2.5 that if the entire purpose of this connection was to send a one-segment request and receive a one-segment reply, there would be eight segments of overhead involved when using TCP. If UDP was used instead, only two packets would be exchanged: the request and the reply. But switching from TCP to UDP removes all the reliability that TCP provides to the application, pushing lots of these details from the transport layer (TCP) to the UDP application. Another important feature provided by TCP is congestion control, which must then be handled by the UDP application. Nevertheless, it is important to understand that many applications are built using UDP because the application exchanges small amounts of data and UDP avoids the overhead of TCP connection establishment and connection termination.

TIME_WAIT 状�?/h3>

毫无疑问�Q�关于网�l�编�E�中最让�h误解点之一��是 TIME_WAIT 状态�?在一端调用了close之后�Q�该端维持这个状态的旉��Z��倍最大段生存旉��Q?span class="docEmphasis">maximum segment lifetime (MSL)�Q��?/h3>
Every implementation of TCP must choose a value for the MSL. The recommended value in RFC 1122 [Braden 1989] is 2 minutes, although Berkeley-derived implementations have traditionally used a value of 30 seconds instead. This means the duration of the TIME_WAIT state is between 1 and 4 minutes. The MSL is the maximum amount of time that any given IP datagram can live in a network. We know this time is bounded because every datagram contains an 8-bit hop limit (the IPv4 TTL field in Figure A.1 and the IPv6 hop limit field in Figure A.2) with a maximum value of 255. Although this is a hop limit and not a true time limit, the assumption is made that a packet with the maximum hop limit of 255 cannot exist in a network for more than MSL seconds.
The way in which a packet gets "lost" in a network is usually the result of routing anomalies. A router crashes or a link between two routers goes down and it takes the routing protocols seconds or minutes to stabilize and find an alternate path. During that time period, routing loops can occur (router A sends packets to router B, and B sends them back to A) and packets can get caught in these loops. In the meantime, assuming the lost packet is a TCP segment, the sending TCP times out and retransmits the packet, and the retransmitted packet gets to the final destination by some alternate path. But sometime later (up to MSL seconds after the lost packet started on its journey), the routing loop is corrected and the packet that was lost in the loop is sent to the final destination. This original packet is called a lost duplicate or a wandering duplicate. TCP must handle these duplicates.
There are two reasons for the TIME_WAIT state:
To implement TCP's full-duplex connection termination reliably
To allow old duplicate segments to expire in the network
The first reason can be explained by looking at Figure 2.5 and assuming that the final ACK is lost. The server will resend its final FIN, so the client must maintain state information, allowing it to resend the final ACK. If it did not maintain this information, it would respond with an RST (a different type of TCP segment), which would be interpreted by the server as an error. If TCP is performing all the work necessary to terminate both directions of data flow cleanly for a connection (its full-duplex close), then it must correctly handle the loss of any of these four segments. This example also shows why the end that performs the active close is the end that remains in the TIME_WAIT state: because that end is the one that might have to retransmit the final ACK.
To understand the second reason for the TIME_WAIT state, assume we have a TCP connection between 12.106.32.254 port 1500 and 206.168.112.219 port 21. This connection is closed and then sometime later, we establish another connection between the same IP addresses and ports: 12.106.32.254 port 1500 and 206.168.112.219 port 21. This latter connection is called an incarnation of the previous connection since the IP addresses and ports are the same. TCP must prevent old duplicates from a connection from reappearing at some later time and being misinterpreted as belonging to a new incarnation of the same connection. To do this, TCP will not initiate a new incarnation of a connection that is currently in the TIME_WAIT state. Since the duration of the TIME_WAIT state is twice the MSL, this allows MSL seconds for a packet in one direction to be lost, and another MSL seconds for the reply to be lost. By enforcing this rule, we are guaranteed that when we successfully establish a TCP connection, all old duplicates from previous incarnations of the connection have expired in the network.
There is an exception to this rule. Berkeley-derived implementations will initiate a new incarnation of a connection that is currently in the TIME_WAIT state if the arriving SYN has a sequence number that is "greater than" the ending sequence number from the previous incarnation. Pages 958�?59 of TCPv2 talk about this in more detail. This requires the server to perform the active close, since the TIME_WAIT state must exist on the end that receives the next SYN. This capability is used by the `rsh` command. RFC 1185 [Jacobson, Braden, and Zhang 1990] talks about some pitfalls in doing this.
一般网�l�程序所使用的协�?/h3>
下图�ȝ��了一些：
Figure 2.19. Protocol usage of various common Internet applications.
The first two applications, `ping` and `traceroute`, are diagnostic applications that use ICMP. `traceroute` builds its own UDP packets to send and reads ICMP replies.
The three popular routing protocols demonstrate the variety of transport protocols used by routing protocols. OSPF uses IP directly, employing a raw socket, while RIP uses UDP and BGP uses TCP.
The next five are UDP-based applications, followed by seven TCP applications and four that use both UDP and TCP. The final five are IP telephony applications that use SCTP exclusively or optionally UDP, TCP, or SCTP.

史传�U?/a> 2006-05-17 09:42 发表评论

Unix�|�络�~�程�W�三�?卷一:套接字联�|�API学习�W�记(2)

Wed, 10 May 2006 03:13:00 GMT

该节主要展示一个简单的[日期旉��]服务器的�E�序�C�Z��.
��1.3 一个简单的日期旉��服务器程序代�?br /> �q�个服务器程序可以�ؓ上一节的客户端提供服务�?br />

 1 #include     "unp.h"

 2 #include     


 3 int

 4 main(int argc, char **argv)

 5 {

 6     int     listenfd, connfd;

 7     struct sockaddr_in servaddr;

 8     char    buff[MAXLINE];

 9     time_t ticks;


10     listenfd = Socket(AF_INET, SOCK_STREAM, 0);


11     bzeros(&servaddr, sizeof(servaddr));

12     servaddr.sin_family = AF_INET;

13     servaddr.sin_addr.s_addr = htonl(INADDR_ANY);

14     servaddr.sin_port = htons(13); /* daytime server */


15     Bind(listenfd, (SA *) &servaddr, sizeof(servaddr));


16     Listen(listenfd, LISTENQ);


17     for ( ; ; ) {

18         connfd = Accept(listenfd, (SA *) NULL, NULL);


19         ticks = time(NULL);

20         snprintf(buff, sizeof(buff), "%.24s\r\n", ctime(&ticks));

21         Write(connfd, buff, strlen(buff));


22         Close(connfd);

23     }

24 }

产生一个TCP套接�?/h4>

`10` 创徏一个TCP套接字，与客��L��一栗��?/h4>

�l�定服务器的�q��ؓ人知的端口到该套接字

11�?5 服务器通过填充�|�络套接字结构体中的端口域，以及服务器的�|�络接口�Q�IP地址�Q�，然后�q�行�l�定�Q�调用bind�Q�。在�q�里指定IP地址为INADDR_ANY�Q��ؓ了让客户端可以连接服务器的�Q一�|�络接口�Q�因为服务器可能有多块网卡，也就对应了多个IP地址�Q�，也就是说如果服务器有两个IP地址�Q�客��L��q�接��M��IP地址卛_��。后�l�章节中介绍了如何限制客��L��q�接��C��个固定的接口上�?/p>

转换为监听套接字

16 通过调用listen�Q�一个套接字��p�{换�ؓ监听套接字，�q�就是说该套接字负责接收来自客户端的�q�接��h��Q�而�ƈ不真正与客户端进行信息传输�?br />帔R��LISTENQ 是在头文�?tt>unp.h中定义的�Q�它是指能够同时监听客户端连接的个数。不��过LISTENQ的客��L��同时�q�接服务器，它们会在一个队列中排队�Q�来�{�待服务器的处理。后�l�章节有更详�l�的讨论�?br />
接收客户端连接，发送回�?/p>

17�?1 一般地�Q�服务器�q�程在调用accept之后�q�入到睡眠状态，�{�待着客户端地�q�接��h��. 一个TCP�q�接通过一个称��Z��Ҏ��手来建立�Q�当三方握手完成之后�Q�accept调用�q�回。返回值是一个新的套接字描述�W�（一个整数值connfd�Q�，�q�个新的套接字负责与客户端进行通讯。对于每一个客��L��地连接，accept都返回一个新的套接字描述�W�。整本书使用的无限��@环风格是�q�样的：

for ( ; ; ) {
    . . .
}

当前旉��和日期通过调用库函数time来获得，�q�且通过调用ctime�q�行转换�Q��得我们能够直观的阅读。如下：
Mon May 26 20:58:40 2003

�l�止�q�接

22 客户端调用close之后�Q�服务器关闭�q�接。这时候引起了一个TCP�q�接�l�止序列�Q�一个FIN发送到每一端，同时每一个FIN都要被另一端确认。在后面章节中将会对TCP�q�接建立时候的三方握手以及TCP�q�接�l�止时候的四包交换有更详细的讨论�?br /> 以上�l�出的客��L��和服务器版本都是协议相关的（IPv4�Q�，在后面将会给��Z��个协议无关的版本�Q�IPv4和IPv6都适用�Q�主要通过使用getaddrinfo函数�Q��?br /> 最后需要补充的一�Ҏ��Q�在以上涉及到Socket API调用的时候，每个函数的第一个字母变成了大写�Q�其意义和小写开头的是一��L��Q�只不过多了一个错误处理�Ş了�?/p>

史传�U?/a> 2006-05-10 11:13 发表评论

Unix�|�络�~�程�W�三�?卷一:套接字联�|�API学习�W�记(1)

Tue, 09 May 2006 12:31:00 GMT

��有关电子资料链接:http://www.unpbook.com/
��1.1 介绍

�?.1 �|�络�E�序: 客户端和服务�?/h5>

图�?.2 服务器同时处理多个客��L��

图�?.3 在同一个以太网使用TCP协议通信的客��L��和服务器

图�?.4 �q�域�|�上的客��L��与服务器�Q�例如Web��览器和Web服务器）

��1.2 代码�C�Z��和解�?/p>

1 #include "unp.h"

2 int
3 main(int argc, char **argv)
4 {
5     int     sockfd, n;
6     char    recvline[MAXLINE + 1];
7     struct sockaddr_in servaddr;

8     if (argc != 2)
9         err_quit("usage: a.out ");

10     if ( (sockfd = socket(AF_INET, SOCK_STREAM, 0)) < 0)
11         err_sys("socket error");

12     bzero(&servaddr, sizeof(servaddr));
13     servaddr.sin_family = AF_INET;
14     servaddr.sin_port = htons(13); /* daytime server */
15     if (inet_pton(AF_INET, argv[1], &servaddr.sin_addr) <= 0)
16         err_quit("inet_pton error for %s", argv[1]);

17     if (connect(sockfd, (SA *) &servaddr, sizeof(servaddr)) < 0)
18         err_sys("connect error");

19     while ( (n = read(sockfd, recvline, MAXLINE)) > 0) {
20         recvline[n] = 0;        /* null terminate */
21         if (fputs(recvline, stdout) == EOF)
22             err_sys("fputs error");
23     }
24     if (n < 0)
25         err_sys("read error");

26     exit(0);
27 }
其中unp.h是自定义的头文�g�Q?a class="" title="unp.h文�g内容" href="/sscchh-2000/archive/2006/05/09/6836.html" target="_blank">查看源代�?/a>。我们编译�ƈ执行以上代码�Q�得��C��下输出结果：

`solaris %a.out 206.168.112.96 our input`
`Mon May 26 20:58:40 2003 the program's output`

下面��要分析以�?7行代�?后箋章节中有更详�l�的讨论.

包含我们自己的头文�g

1 该头文�g包含了大多数�|�络�E�序所需要的多个头文件以及定义了我们��要使用的一些常�?例如 MAXLINE).

`命��o行参�?/font>`

`2�?` �q�是含有命��o行参数的��d��数定�?即main函数).我们以ANSI C标准来书写代�?

创徏TCP套接�?a name="ch01lev3sec3">

10�?1 socket函数调用创徏了一个网�l�流套接�?(Internet (AF_INET) stream (SOCK_STREAM) socket), 该函数返回一个整数�?它描�q�C��该套接字,以后的函数通过该整数值来使用�q�个套接�?例如connect和read�{�调�?. 其中err_开头的函数是我们自定义的函�?详见�q�里.

��定服务器IP地址和端口号

`12�?6` 我们填充了网�l�套接字地址�l�构(一个名为servaddr的结构体sockaddr_in),填充的信息包括服务器IP地址和端口号.我们把整个结构体首先清零,然后讄��地址族�ؓAF_INET(IPV6该项为AF_INET6),端口号�ؓ13(旉��服务器的端口�?是一个大安��知道的端口号).IP地址由命令行参数指定(argv[1]).IP地址和端口号必须按照指定的格式来填充,我们通过调用htons(��L��字节��到�|�络字节��的转换)和inet_pton(点分十进制到32位整数的转换)两个调用来进行�{化到所需要的格式.

在调用inet_pton的时候可而能会遇到问�?因�ؓ�q�是IPv6新增的函�?以前的IPv4版本可以调用inet_addr来替代该函数.

与服务器建立一个连�?/h4>

`17�?8` TCP套接字调用connect函数,��׃��服务�?main函数的第二个参数)建立了一个TCP�q�接,我们必须指定套接字结构体的第三个参数长度,它��L��让编译器通过C的sizeof�q�算�W�来计算.

��d��和显�C�服务器的回�?/h4>

`19�?5` 调用read来读取服务器的回�?利用标准I/O来显�C��回复信息.此外,在��用TCP的时候我们必��要注意,因�ؓ它是一个没有边界的字节��协�?服务器的回复是一�?6字节的串:

Mon May 26 20 : 58 : 40 2003\r\n

\r 是回�? \n 是换�?

�l�止�E�序
26 exit �l�止�E�序.Unix在一个进�E�结束时候��L��关闭所有打开的描�q�符,因此我们的TCP套接字此时关闭了.
后箋内容��对此有更深入的讨论.

史传�U?/a> 2006-05-09 20:31 发表评论