Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network
Reexamination Certificate
1998-08-27
2002-01-29
Olms, Douglas (Department: 2661)
Multiplex communications
Data flow congestion prevention or control
Control of data admission to the network
C370S237000, C370S218000
Reexamination Certificate
active
06343067
ABSTRACT:
BACKGROUND OF THE INVENTION
The present invention relates generally to methods and apparatuses for controlling the flow of data between nodes (or two points) in a computer network, and more particularly to a method and apparatus for controlling the flow of data between two nodes (or two points) in a system area network.
For the purposes of this application, the term “node” will be used to describe either an origination point of a message or the termination point of a message. The term “point” will be used to refer to a transient location in a transmission between two nodes. The present invention includes communications between either a first node and a second node, a node and a switch, which is part of a link, between a first switch and a second switch, which comprise a link, and between a switch and a node.
An existing flow control protocol, known as Stop and Wait ARQ, transmits a data packet and then waits for an acknowledgment (ACK) before transmitting the next packet. As data packets flow through the network from one point to the next point, latency becomes a problem. Latency results from the large number of links and switches in fabrics which make up the network. This is because each packet requires an acknowledgment of successful receipt from a receiving node before the next data packet is sent from a transmitting node. Consequently, there is an inherent delay due to the transit time for the acknowledgment to reach the transmitting node from the receiving node.
One solution, which is known as Go Back n ARQ, uses sequentially numbered packets, in which a sequence number is sent in the header of the frame containing the packet. In this case, several successive packets are sent without waiting for the return of the acknowledgment. According to this protocol, the receiving node only accepts the packets in the correct order and sends request numbers (RN) back to the transmitting node. The effect of a given request number is to acknowledge all packets prior to the requested packet and to request transmission of the packet associated with the request number. The go back number n is a parameter that determines how many successive packets can be sent from the transmitter in the absence of a request for a new packet. Specifically, the transmitting node is not allowed to send packet i+n before i has been acknowledged (i.e., before i+1 has been requested). Thus, if i is the most recently received request from the receiving node, there is a window of n packets that the transmitter is allowed to send before receiving the next acknowledgment. In this protocol, if there is an error, the entire window must be resent as the receiving node will only permit reception of the packets in order. Thus, even if the error lies near the end of the window, the entire window must be retransmitted. This protocol is most suitable for large scaled networks having high probabilities of error.
In an architecture that permits large data packets, unnecessarily retransmitting excess packets can become a significant efficiency concern. For example, retransmitting an entire window of data packets, each on the order of 4 Gigabytes, would be relatively inefficient.
Other known flow control protocols require retransmission of only the packet received in error. This requires the receiver to maintain a buffer of the correctly received packets and to reorder them upon successful receipt of the retransmitted packet. While keeping the bandwidth requirements to a minimum, this protocol significantly complicates the receiver design as compared to that required by Go Back n ARQ.
The present invention is therefore directed to the problem of developing a method and apparatus for controlling the flow of data between nodes in a system area network that improves the efficiency of the communication without overly complicating the processing at the receiving end.
SUMMARY OF THE INVENTION
The present invention provides a method for transmitting data in a network from a source node to a destination node. According to the method of the present invention, data packets are transmitted from the source node to at least one intermediary point via a path of links. Upon receiving a predetermined number of error indications that at least one of the data packets was not correctly received by a point subsequent to the source node in the transmission path, the data packet is returned to the source node.
The present invention provides an apparatus for communicating data between two node made of multiple links and multiple fabrics. The apparatus includes two switches and a controller. The first switch is disposed in a first fabric, and transmits the data packets from a first node to a second node. Upon receiving data from the first node, the first switch sends an acknowledgment that each packet was successfully received. The controller determines after a predetermined number of error indications that at least one of the links has failed. At this time, the first switch returns the data to the first node. The second switch is disposed in a second fabric, and receives data returned by the first switch and transmitting the data packets to the second node via an alternate path.
REFERENCES:
patent: 5146452 (1992-09-01), Pekarske
patent: 5222061 (1993-06-01), Doshi et al.
patent: 5398236 (1995-03-01), Hemmady et al.
patent: 6111853 (2000-08-01), Goodman
Cameron Donald F.
Drottar Ken
Dunning David S.
Intel Corporation
Kenyon & Kenyon
Olms Douglas
Vanderpuye Ken
LandOfFree
Method and apparatus for failure and recovery in a computer... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for failure and recovery in a computer..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for failure and recovery in a computer... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2833271