Packet communication method and proposal node

• US 7,177,300 B2
• Filed: 05/24/2002
• Issued: 02/13/2007
• Est. Priority Date: 11/21/2001
• Status: Expired due to Fees

• Current Assignee: National Institute of Information and Communications Technology
• Original Assignee: Communications Research Laboratory Independent Administrative Institution
• Inventors: Murakami, Homare, Inoue, Masugi, Wu, Gang
• Primary Examiner(s): Phan; Man U.
• Application Number:
  US10/153,799
• Publication Number:
  US 20030095537A1
• Time in Patent Office: 1,726 Days
• Field of Search: 370216-254, 370338-352, 370394-401, 709227-234, 714748-749
• US Class Current: 370/349
• CPC Class Codes: H04L 1/1809 Selective-repeat protocols
• CPC Class Codes: H04L 1/1832 Details of sliding window management
• CPC Class Codes: H04L 1/1858 Transmission or retransmission of more than one copy of acknowledgement message
• CPC Class Codes: H04L 69/16 Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
• CPC Class Codes: H04L 69/163 In-band adaptation of TCP data exchange; In-band control procedures
• CPC Class Codes: H04L 69/165 Combined use of TCP and UDP protocols; selection criteria therefor
• CPC Class Codes: H04W 24/00 Supervisory, monitoring or testing arrangements
• CPC Class Codes: H04W 76/19 Connection re-establishment
• CPC Class Codes: H04W 80/00 Wireless network protocols or protocol adaptations to wireless operation
• CPC Class Codes: H04W 80/06 Transport layer protocols, e.g. TCP [Transport Control Protocol] over wireless transmission control protocol/Internet protocol [TCP/IP] or user datagram protocol [UDP] H04L69/16

Abstract

Upon recovery of communication, this recovery is detected by communication recover detector and then optimal times duplicated pseudo acknowledgements calculated by arithmetic unit are transmitted from ACK transmitter. During normal state, advertisement is made in small value of advertised receive window size and immediately after recovery state, advertisement is made in expanded window size.

Claims

1. Method of packet communication in network at least partially including radio communication area, said method comprising, after packet loss occurred due to interruption of communication between proposal node to make radio communication using TCP and general node placed on said network and functioning as device being able to make standard TCP communication, the method comprising the steps of:

detecting communication recovery by said proposal node;

informing of detected communication recovery from said proposal node to said general node; and

starting data retransmission by said general node upon being informed of communication recovery,

wherein said proposal node transmits D times pseudo duplicated acknowledgements, said D being calculated by

D=ceil(awnd/MSS)

where awnd represents advertised receive window size of said proposal node after expanded on recovery state and MSS represents the maximum segment size.

2. The method of packet communication as defined by claim 1, said method comprising, after packet loss occurred due to interruption of TCP using communication between said proposal node and said general node, steps of:

transmitting duplicated pseudo acknowledgements from said proposal node to said general node upon recovery of communication;

retransmitting lost packets from said general node to said proposal node on the basis of pseudo acknowledgements received by said general node;

expanding advertised receive window size of said proposal node and sending this expanded advertised receive window size by and from said proposal node to said general node; and

restarting communication including respective steps of transmitting new packets in response to respective expansions of said advertised receive window size.

3. The method of packet communication as defined by claim 1, wherein said advertised receive window side is minimized during normal state and expanded to the size corresponding to actual receiving buffer size upon recovery state.

4. The method of packet communication as defined by claim 2, wherein said advertised receive window side is minimized during normal state and expanded to the size corresponding to actual receiving buffer size upon recovery state.

5. The method of packet communication as defined by claim 1, wherein for advertisement in small value of advertised receive window size during normal state, said proposal node calculates awnd′

s satisfying both of following inequality and equation;

2>

awnd/MSS+(6−

n(n+1)/2)

and

n=(awnd−

awnd′

)/MSS

where awnd represents advertised receive window size of said proposal node after expanded on recovery state, awnd′

represents small value of advertised receive window size on normal state and MSS represents the maximum segment size.

6. The method of packet communication as defined by claim 2, wherein for advertisement in small value of advertised receive window size during normal state, said proposal node calculates awnd′

s satisfying both of following inequality and equation;

2>

awnd/MSS+(6−

n(n+1)/2)

and

n=(awnd−

awnd′

)/MSS

where awnd represents advertised receive window size of said proposal node after expanded on recovery state, awnd′

represents small value of advertised receive window size on normal state and MSS represents the maximum segment size.

7. The method of packet communication as defined by claim 3, wherein for advertisement in small value of advertised receive window size during normal state, said proposal node calculates awnd′

s satisfying both of following inequality and equation;

2>

awnd/MSS+(6−

n(n=1)/2)

and

n=(awnd−

awnd′

)/MSS

where awnd represents advertised receive window size of said proposal node after expanded on recovery state, awnd′

represents small value of advertised receive window size on normal state and MSS represents the maximum segment size.

8. The method of packet communication as defined by claim 4, wherein for advertisement in small value of advertised receive window size during normal state, said proposal node calculates awnd′

s satisfying both of following inequality and equation;

2>

awnd/MSS+(6−

n(n+1)/2)

and

n=(awnd−

awnd′

)/MSS

where awnd represents advertised receive window size of said proposal node after expanded on recovery state, awnd′

represents small value of advertised receive window size on normal state and MSS represents the maximum segment size.

9. Proposal node to make radio communication using TCP, comprising:

means to detect the end of communication interruption, to confirm that received signal power has exceeded a predetermined threshold level and thereby to detect communication recovery;

means to transmit pseudo duplicated acknowledgment; and

means for adjusting the advertised receive window size of the proposal node to transmit advertisement to said general node,

wherein said proposal node transmits D times pseudo duplicated acknowledgements, said D being calculated by

D=ceil(awnd/MSS)

where awnd represents advertised receive window size of said proposal node after expanded on recovery state and MSS represents the maximum segment size.

10. The proposal node as defined by claim 9, wherein said proposal node small value of advertised receive window size of said proposal node for advertisement during normal state and expands advertised receive window size to actual receiving buffer size using said size adjusting means after transmission of acknowledgements by said pseudo duplicated signal transmitter means and transmits the advertised receive window size expanded in this manner to said general node.

11. The proposal node as defined by claim 9, wherein for advertisement in small value of advertised receive window size during normal state, said proposal node calculates awnd′

s satisfying both of following inequality and equation;

2>

awnd/MSS+(6−

n(n+1)/2) and n=(awnd−

awnd′

)/MSS where awnd represents advertised receive window size of said proposal node after expanded on recovery state, awnd′

represents small value of advertised receive window size on normal state and MSS represents the maximum segment size and advertises the maximum value of these awnd′

s obtained in this manner.

12. The proposal node as defined by claim 10, wherein for advertisement in small value of advertised receive window size during normal state, said proposal node calculates awnd′

s satisfying both of following inequality and equation;

2>

awnd/MSS+(6−

n(n+1)/2) and n=(awnd−

awnd′

)/MSS where awnd represents advertised receive window size of said proposal node after expanded on recovery state, awnd′

represents small value of advertised receive window size on normal state and MSS represents the maximum segment size and advertises the maximum value of these awnd′

s obtained in this manner.

13. Method of packet communication in network at least partially including radio communication area, said method comprising, after packet loss occurred due to interruption of communication between proposal node to make radio communication using TCP and general node placed on said network and functioning as device being able to make standard TCP communication, the method comprising the steps of:

detecting communication recovery by said proposal node;

informing of detected communication recovery from said proposal node to said general node; and

starting data retransmission by said general node upon being informed of communication recovery,

wherein for advertisement in small value of advertised receive window size during normal state, said proposal node calculates awnd′

s satisfying both of following inequality and equation;

2>

awnd/MSS+(6−

n(n+1)/2)

and

n=(awnd−

awnd′

)/MSS

where awnd represents advertised receive window size of said proposal node after expanded on recovery state, awnd′

represents small value of advertised receive window size on normal state and MSS represents the maximum segment size.

14. The method of packet communication as defined by claim 13, wherein said advertised receive window side is minimized during normal state and expanded to the size corresponding to actual receiving buffer size upon recovery state.

15. Proposal node to make radio communication using TCP, comprising:

means to detect the end of communication interruption, to confirm that received signal power has exceeded a predetermined threshold level and thereby to detect communication recovery;

means to transmit pseudo duplicated acknowledgment; and

means for adjusting the advertised receive window size of the proposal node to transmit advertisement to said general node

wherein for advertisement in small value of advertised receive window size during normal state, said proposal node calculates awnd′

s satisfying both of following inequality and equation;

2>

awnd/MSS+(6−

n(n+1)/2) and n=(awnd−

awnd′

)/MSS where awnd represents advertised receive window size of said proposal node after expanded on recovery state, awnd′

represents small value of advertised receive window size on normal state and MSS represents the maximum segment size and advertises the maximum value of these awnd′

s obtained in this manner.