US20080239947A1 - Method and apparatus for failure resilient forwarding of data over a computer network - Google Patents
Method and apparatus for failure resilient forwarding of data over a computer network Download PDFInfo
- Publication number
- US20080239947A1 US20080239947A1 US12/135,764 US13576408A US2008239947A1 US 20080239947 A1 US20080239947 A1 US 20080239947A1 US 13576408 A US13576408 A US 13576408A US 2008239947 A1 US2008239947 A1 US 2008239947A1
- Authority
- US
- United States
- Prior art keywords
- data
- node
- marker
- receiver
- intermediate node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
- H04L67/5682—Policies or rules for updating, deleting or replacing the stored data
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
- H04L69/163—In-band adaptation of TCP data exchange; In-band control procedures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
- H04L69/165—Combined use of TCP and UDP protocols; selection criteria therefor
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/40—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection
Definitions
- the present invention relates generally to computer systems and computer networks, and relates more particularly to content delivery over computer networks. Specifically, the present invention relates to a method and apparatus for adaptive forwarding of data over a computer network.
- FIG. 1 is a schematic illustration of one embodiment of a system 100 for forwarding data over a network.
- a wide range of end-to-end computing applications (including overlay networks, end-system multicast, proxy servers, network address translation and protocol tunneling, among others) use intermediaries, or forwarding nodes 106 1 - 106 n (e.g., computing devices or routers), to route a stream 112 of data from a sender 102 (e.g., a server) to one or more receivers 104 .
- Receivers 104 may in turn deliver the data to one or more computing applications 108 .
- a typical problem with a system such as the system 100 is that a failure or disruption at any forwarding node disrupts the end-to-end chain, resulting in incomplete data delivery to the receiver(s). This is especially troublesome for large networks, as the probability of node failure increases with the number of forwarding nodes implemented.
- Conventional solutions for addressing node failure in a forwarding network include source-based repair such as a Transmission Control Protocol/Internet Protocol (TCP/IP) session between the data source and the receiver, packet number-based retransmission requests, and various application- and content-specific resiliency schemes (e.g., resuming File Transport Protocol at a specific byte offset from the start of a file, or resuming a video transmission at a specific frame number).
- TCP/IP Transmission Control Protocol/Internet Protocol
- application- and content-specific resiliency schemes e.g., resuming File Transport Protocol at a specific byte offset from the start of a file, or resuming a video transmission at a specific
- the present invention is a method and an apparatus for failure-resilient forwarding of data over a computer network.
- a marker is introduced into the data stream, e.g., at the sending node and, in turn, allows forwarding nodes and/or receivers to efficiently track data stream reception.
- the marker functions as a checkpoint for the data transport process, and is identified and indexed at each forwarding node and receiver.
- Each receiver saves the marker prior to delivering data to an application, thereby designating a point in the data stream at which all preceding data is confirmed to have been delivered to the application.
- the receiver may request stream data from an alternate forwarding node by specifying to the alternate forwarding node to provide data starting from the marker.
- FIG. 1 is a schematic illustration of one embodiment of an end-to-end computing network
- FIG. 2 is a flow diagram illustrating one embodiment of a method for enabling failure-resilient forwarding of data from a sender to one or more receivers according to the present invention
- FIG. 3 is a table illustrating one method of distributing content using the system illustrated in FIG. 2 ;
- FIG. 4 is a flow diagram illustrating one embodiment of a method for recovering lost data in a data stream.
- FIG. 5 is a high level block diagram of the present failure-resilient forwarding system that is implemented using a general purpose computing device.
- the present invention is a method and an apparatus for failure-resilient forwarding of data over a computer network.
- a trigger condition such as forwarding node failure, performance degradation, query, resource use imbalance and the like, initiates a network adaptation to correctly resume transmission reception of a data stream.
- FIG. 2 is a flow diagram illustrating the flow of data through one embodiment of a method 200 for enabling failure-resilient forwarding of data from a sender to one or more receivers according to the present invention.
- the method 200 is initialized at step 202 and proceeds to step 204 , where a sending node or a forwarding node (e.g., sender 102 or any one of the forwarding nodes 106 of FIG. 1 ) obtains (in the case of the sender) or receives (in the case of the forwarding node) at least a portion of a data stream.
- the data stream may simply be a portion or an arbitrarily sized data segment of a much larger data stream.
- a sequence of “chunks” or “portions” of the larger data stream is being sent from the sending node to a receiving node.
- the sender or a forwarding node injects a marker into the portion of the data stream, and forwards the “marked” data stream, with or without further modification, to one or more next recipient nodes in the network (e.g., one or more subsequent forwarding nodes or receiving nodes) via a point-to-point reliable transport protocol (e.g., a protocol that is packet loss resilient, such as TCP/IP and the like).
- the marker designates a reference point in the generic data stream and in one embodiment is a recognizable bit field with a unique identifier.
- the marker may be recognized by reserved bit sequences, fixed inter-marker offsets, or an offset specified by a prior marker.
- markers may be periodically injected into the data stream, so that a plurality of marked data streams is transported through the network.
- the method 200 branches off into at least one of two possible subsequent processes.
- the method executes steps in accordance with the function of a forwarding node; in steps 209 - 214 , the method 200 executes steps in accordance with the function of a receiving node.
- the method 200 inquires if the recipient of the marked data stream is a forwarding node. If the method 200 determines that the recipient is forwarding node, the method 200 proceeds to step 210 , where the method 200 inspects the received data stream, stores the data in a local buffer of the forwarding node, and creates or updates a marker index at the forwarding node.
- the marker index that the method 200 updates comprises two key components: (1) a record of the most recently received marker; and (2) a record of each marker previously received and stored by the forwarding node.
- the method 200 forwards the marked data stream to the next recipient(s) (e.g., one or more other forwarding nodes or receivers) in the network.
- the marked data stream is processed by the next recipient node(s) starting at the point in the method 200 just following step 206 , as indicated by the loop from step 210 .
- all forwarding nodes receive the marked data stream, relay the marked data stream to the next forwarding nodes or receivers, and index the markers.
- FIG. 3 is a schematic illustration of one embodiment of a marker index 300 according to the present invention, such as the marker index updated by the method 200 in step 210 of FIG. 2 .
- the marker index 300 is a table.
- the marker index 300 stores, for each marker (e.g., markers M 1 -M 3 ), the marker's unique identifier and its position in the local buffer. As will be further described below with reference to FIG. 4 , this stored information may be used to recover data lost, for example, due to a forwarding node failure.
- the method 200 terminates.
- the method 200 inquires in step 209 if the recipient is a receiving node. If the method 200 concludes that the recipient is a receiving node, the method 200 proceeds to step 212 and queues the stream data received by the receiver until the marker is encountered. In step 214 , the method 200 saves the marker and delivers the queued data (i.e., all undelivered, non-marked data preceding the marker in the data stream) to a process desiring the original data stream (e.g., an application or a storage process). Alternatively, if the method 200 concludes in step 208 that the recipient is not a receiving node, the method 200 terminates.
- the queued data i.e., all undelivered, non-marked data preceding the marker in the data stream
- one or more nodes are both forwarding and receiving nodes. That is, a node may be adapted to both receive data for delivery to an application, and also to forward the received data on to another node. Thus, the node is capable of executing both the forwarding and the receiving methods contained within the method 200 .
- the forwarding and receiving processes e.g., steps 208 - 210 and 209 - 214 , respectively
- the reference numerals do not connote an order in which the processes occur. Therefore, those skilled in the art will appreciate that the forwarding and receiving methods are executed independently, and that the methods may actually occur simultaneously, or may occur one after the other in any order.
- the sequence of the reference numerals as they apply to steps 208 - 216 is not intended to be limiting in any sense.
- the markers injected into the data stream represent checkpoints for the data transport process.
- the method 200 designates points in the data stream where all preceding data has been delivered, reliably and in order, to the waiting application.
- the method 200 also serves the function of designating points in the data stream where any succeeding data has yet to be delivered. This saved marker information may be used to recover data lost, for example, due to a forwarding node failure.
- FIG. 4 is a flow diagram illustrating one embodiment of a method 400 for recovering lost data in a data stream.
- the method 400 may be executed in the event that a forwarding node (e.g., a forwarding node 106 of FIG. 1 ) fails (e.g., due to disconnection from the network or power failure) and thus ceases to forward data to subsequent recipients.
- the method 400 is initialized at step 402 and proceeds to step 404 , where the method 400 identifies a forwarding node failure and connects a receiver (or subsequent forwarding node) to an alternate forwarding node, or a “backup node” (e.g., a node that preceded the failed node in the routing path).
- a forwarding node e.g., a forwarding node 106 of FIG. 1
- the method 400 is initialized at step 402 and proceeds to step 404 , where the method 400 identifies a forwarding node failure and connects a receiver (or subsequent forwarding node
- the method 400 may connect the receiver to any “sister” node of the failed forwarding node that is still receiving the data stream.
- the backup node is selected for efficiency. For example, if the failed node is node X n in FIG. 1 , then the backup node can be selected to be node X 1 or node X n+1 . The selection of the proper node can be based on distance, delay, computational cost and the like.
- step 406 the method 400 requests, from the backup node, the stream data starting from the last marker, M, saved by the receiver.
- the method 400 may request the stream data starting from a specified position after the last marker M (e.g., three bits after the marker M).
- the request includes the unique identifier for the marker M.
- step 407 the method 400 inquires if the backup node will accept the request presented in step 406 . If the backup node rejects the request, the method 400 returns to step 404 and connects to another backup node. Alternatively, if the backup node accepts the request in step 407 , the method 400 enables the backup node to look up the marker M in the backup node's marker index. If the marker M is present, the backup node begins sending the marked data stream, using the location of the marker M in its local buffer as the starting point. In one embodiment, any data residing in the local buffer past the point of the marker M is discarded.
- step 408 the method 400 resets a queue “write pointer” for the receiver to a position immediately following the marker M.
- the method 400 also erases data following the write pointer in the local buffer, and the receiver will now start queuing data over the new connection from the new forwarding node.
- the arriving data stream overwrites any data following the marker M in the receiver's local buffer.
- the method 400 may request discrete portions of the marked data stream from multiple backup nodes.
- the method 400 inquires if the next marker, M+1, has arrived at the receiver. If the next marker M+1 has arrived, the method 400 delivers data queued by the receiver (minus the marker M) to an application requesting the data at step 412 . If the next marker M+l has not arrived, the method 400 continues to queue data over the new connection from the backup node.
- steps 408 - 412 of the method 400 are steps typically executed by a receiver node; they have been discussed here, in the context of the method 400 , to illustrate the method by which the receiver mode may implement such steps in conjunction with the recovery of lost data.
- the method 400 is therefore able to repair failures accurately and efficiently by resuming data transmission at the point of interruption. Moreover, as the repair only requires communication with a nearby forwarding/backup node, repair paths are short and network load is fairly distributed.
- the method 400 also works at the application layer with any reliable point-to-point transport protocol, can leverage existing point-to-point protocols, and may allow reframing and multi-protocol forwarding. Thus, the method 400 works independently of transport protocols, as well as independently of data stream content.
- FIG. 5 is a high level block diagram of the present failure-resilient forwarding system that is implemented using a general purpose computing device 500 .
- a general purpose computing device 500 comprises a processor 502 , a memory 504 , a failure-resilient forwarding mechanism or module 505 and various input/output (I/O) devices 506 such as a display, a keyboard, a mouse, a modem, and the like.
- I/O input/output
- at least one I/O device is a storage device (e.g., a disk drive, an optical disk drive, a floppy disk drive).
- the failure-resilient forwarding mechanism 505 can be implemented as a physical device or subsystem that is coupled to a processor through a communication channel.
- the failure-resilient forwarding mechanism 505 can be represented by one or more software applications (or even a combination of software and hardware, e.g., using Application Specific Integrated Circuits (ASIC)), where the software is loaded from a storage medium (e.g., I/O devices 506 ) and operated by the processor 502 in the memory 504 of the general purpose computing device 500 .
- ASIC Application Specific Integrated Circuits
- the failure-resilient forwarding mechanism 505 and the associated methods described herein with reference to the preceding Figures can be stored on a computer readable medium or carrier (e.g., RAM, magnetic or optical drive or diskette, and the like).
- the present invention may have other applications in the field of content delivery.
- the present invention may be implemented to assure reliable data delivery with any network reconfiguration, and for any reason.
- Other reconfiguration techniques may include finding a backup node using a centralized or distributed registry of nodes (e.g., a known server or a Domain Name Service (DNS) lookup), a distributed hash table lookup, or a broadcast search, among others.
- DNS Domain Name Service
- Other reasons for network reconfiguration may include responding to performance degradation, optimization of network resource utilization and load balancing, among others.
- the present invention represents a significant advancement in the field of content delivery.
- a method and apparatus are provided that enable efficient, failure-resilient forwarding of data over a network.
- the network is able to accurately and efficiently resume data transmission at the point of interruption, without transmitting redundant or out-of-order data to a receiver.
- the failure and recovery of the system are substantially transparent.
- the methods of the present invention are not application specific, but may be adapted for use with any type of data stream, regardless of content, and with any type of reliable transport protocol.
Abstract
In one embodiment, the present invention is a method and an apparatus for failure-resilient forwarding of data over a computer network. In one embodiment, a marker is introduced into the data stream, e.g., at the sending node, and allows, in turn, forwarding nodes and/or receivers to efficiently track data stream reception. The marker functions as a checkpoint for the data transport process, and is identified and indexed at each forwarding node and receiver. Each receiver saves the marker prior to delivering data to an application, thereby designating a point in the data stream at which all preceding data is confirmed to have been delivered to the application. Thus, if a forwarding node fails, the receiver may request stream data from an alternate forwarding node by specifying to the alternate forwarding node to provide data starting from the marker.
Description
- This application is a divisional of U.S. patent application Ser. No. 10/830,779, filed Apr. 23, 2004, (currently allowed) which is herein incorporated by reference in its entirety.
- The present invention relates generally to computer systems and computer networks, and relates more particularly to content delivery over computer networks. Specifically, the present invention relates to a method and apparatus for adaptive forwarding of data over a computer network.
-
FIG. 1 is a schematic illustration of one embodiment of asystem 100 for forwarding data over a network. A wide range of end-to-end computing applications (including overlay networks, end-system multicast, proxy servers, network address translation and protocol tunneling, among others) use intermediaries, or forwarding nodes 106 1-106 n (e.g., computing devices or routers), to route astream 112 of data from a sender 102 (e.g., a server) to one ormore receivers 104.Receivers 104 may in turn deliver the data to one ormore computing applications 108. - A typical problem with a system such as the
system 100 is that a failure or disruption at any forwarding node disrupts the end-to-end chain, resulting in incomplete data delivery to the receiver(s). This is especially troublesome for large networks, as the probability of node failure increases with the number of forwarding nodes implemented. Conventional solutions for addressing node failure in a forwarding network include source-based repair such as a Transmission Control Protocol/Internet Protocol (TCP/IP) session between the data source and the receiver, packet number-based retransmission requests, and various application- and content-specific resiliency schemes (e.g., resuming File Transport Protocol at a specific byte offset from the start of a file, or resuming a video transmission at a specific frame number). However, these conventional solutions are subject to a number of limitations, including scalability limitations and the inability to adapt for use over a network using heterogeneous transports or delivering generic (non-content-specific) data streams. Accordingly, they are not appropriate for delivering data over an adaptively changing network using multiple point-to-point protocols in a content-independent manner. - Thus, there is a need for a method and apparatus for failure-resilient forwarding of data over a computer network.
- In one embodiment, the present invention is a method and an apparatus for failure-resilient forwarding of data over a computer network. In one embodiment, a marker is introduced into the data stream, e.g., at the sending node and, in turn, allows forwarding nodes and/or receivers to efficiently track data stream reception. The marker functions as a checkpoint for the data transport process, and is identified and indexed at each forwarding node and receiver. Each receiver saves the marker prior to delivering data to an application, thereby designating a point in the data stream at which all preceding data is confirmed to have been delivered to the application. Thus, if a forwarding node fails, the receiver may request stream data from an alternate forwarding node by specifying to the alternate forwarding node to provide data starting from the marker.
- So that the manner in which the above recited embodiments of the invention are attained and can be understood in detail, a more particular description of the invention, briefly summarized above, may be had by reference to the embodiments thereof which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrate only typical embodiments of this invention and are therefore not to be considered limiting of its scope, for the invention may admit to other equally effective embodiments.
-
FIG. 1 is a schematic illustration of one embodiment of an end-to-end computing network; -
FIG. 2 is a flow diagram illustrating one embodiment of a method for enabling failure-resilient forwarding of data from a sender to one or more receivers according to the present invention; -
FIG. 3 is a table illustrating one method of distributing content using the system illustrated inFIG. 2 ; -
FIG. 4 is a flow diagram illustrating one embodiment of a method for recovering lost data in a data stream; and -
FIG. 5 is a high level block diagram of the present failure-resilient forwarding system that is implemented using a general purpose computing device. - To facilitate understanding, identical reference numerals have been used, where possible, to designate identical elements that are common to the figures.
- The present invention is a method and an apparatus for failure-resilient forwarding of data over a computer network. In one embodiment, a trigger condition, such as forwarding node failure, performance degradation, query, resource use imbalance and the like, initiates a network adaptation to correctly resume transmission reception of a data stream.
-
FIG. 2 is a flow diagram illustrating the flow of data through one embodiment of amethod 200 for enabling failure-resilient forwarding of data from a sender to one or more receivers according to the present invention. Themethod 200 is initialized atstep 202 and proceeds tostep 204, where a sending node or a forwarding node (e.g.,sender 102 or any one of the forwarding nodes 106 ofFIG. 1 ) obtains (in the case of the sender) or receives (in the case of the forwarding node) at least a portion of a data stream. In one embodiment, the data stream may simply be a portion or an arbitrarily sized data segment of a much larger data stream. Namely, a sequence of “chunks” or “portions” of the larger data stream is being sent from the sending node to a receiving node. Instep 206, the sender or a forwarding node injects a marker into the portion of the data stream, and forwards the “marked” data stream, with or without further modification, to one or more next recipient nodes in the network (e.g., one or more subsequent forwarding nodes or receiving nodes) via a point-to-point reliable transport protocol (e.g., a protocol that is packet loss resilient, such as TCP/IP and the like). The marker designates a reference point in the generic data stream and in one embodiment is a recognizable bit field with a unique identifier. The marker may be recognized by reserved bit sequences, fixed inter-marker offsets, or an offset specified by a prior marker. Thus, markers may be periodically injected into the data stream, so that a plurality of marked data streams is transported through the network. - After injecting the marker in
step 206, themethod 200 branches off into at least one of two possible subsequent processes. In steps 208-210, the method executes steps in accordance with the function of a forwarding node; in steps 209-214, themethod 200 executes steps in accordance with the function of a receiving node. - In
step 208, themethod 200 inquires if the recipient of the marked data stream is a forwarding node. If themethod 200 determines that the recipient is forwarding node, themethod 200 proceeds tostep 210, where themethod 200 inspects the received data stream, stores the data in a local buffer of the forwarding node, and creates or updates a marker index at the forwarding node. In one embodiment, the marker index that themethod 200 updates comprises two key components: (1) a record of the most recently received marker; and (2) a record of each marker previously received and stored by the forwarding node. Once themethod 200 has updated the marker index, themethod 200 forwards the marked data stream to the next recipient(s) (e.g., one or more other forwarding nodes or receivers) in the network. The marked data stream is processed by the next recipient node(s) starting at the point in themethod 200 just followingstep 206, as indicated by the loop fromstep 210. Thus, all forwarding nodes receive the marked data stream, relay the marked data stream to the next forwarding nodes or receivers, and index the markers. -
FIG. 3 is a schematic illustration of one embodiment of amarker index 300 according to the present invention, such as the marker index updated by themethod 200 instep 210 ofFIG. 2 . In one embodiment, themarker index 300 is a table. As illustrated, themarker index 300 stores, for each marker (e.g., markers M1-M3), the marker's unique identifier and its position in the local buffer. As will be further described below with reference toFIG. 4 , this stored information may be used to recover data lost, for example, due to a forwarding node failure. - Referring back to
FIG. 2 , if themethod 200 concludes atstep 208 that the recipient of the marked data stream is not a forwarding node, themethod 200 terminates. - Also after injecting the marker in
step 206, themethod 200 inquires instep 209 if the recipient is a receiving node. If themethod 200 concludes that the recipient is a receiving node, themethod 200 proceeds to step 212 and queues the stream data received by the receiver until the marker is encountered. Instep 214, themethod 200 saves the marker and delivers the queued data (i.e., all undelivered, non-marked data preceding the marker in the data stream) to a process desiring the original data stream (e.g., an application or a storage process). Alternatively, if themethod 200 concludes instep 208 that the recipient is not a receiving node, themethod 200 terminates. - In one embodiment, one or more nodes are both forwarding and receiving nodes. That is, a node may be adapted to both receive data for delivery to an application, and also to forward the received data on to another node. Thus, the node is capable of executing both the forwarding and the receiving methods contained within the
method 200. Thus, although the forwarding and receiving processes (e.g., steps 208-210 and 209-214, respectively) are designated by sequential reference numerals, the reference numerals do not connote an order in which the processes occur. Therefore, those skilled in the art will appreciate that the forwarding and receiving methods are executed independently, and that the methods may actually occur simultaneously, or may occur one after the other in any order. Thus, the sequence of the reference numerals as they apply to steps 208-216 is not intended to be limiting in any sense. - Thus, the markers injected into the data stream represent checkpoints for the data transport process. By saving the markers at the receivers, the
method 200 designates points in the data stream where all preceding data has been delivered, reliably and in order, to the waiting application. Themethod 200 also serves the function of designating points in the data stream where any succeeding data has yet to be delivered. This saved marker information may be used to recover data lost, for example, due to a forwarding node failure. -
FIG. 4 is a flow diagram illustrating one embodiment of amethod 400 for recovering lost data in a data stream. For example, themethod 400 may be executed in the event that a forwarding node (e.g., a forwarding node 106 ofFIG. 1 ) fails (e.g., due to disconnection from the network or power failure) and thus ceases to forward data to subsequent recipients. Themethod 400 is initialized atstep 402 and proceeds to step 404, where themethod 400 identifies a forwarding node failure and connects a receiver (or subsequent forwarding node) to an alternate forwarding node, or a “backup node” (e.g., a node that preceded the failed node in the routing path). Alternatively, themethod 400 may connect the receiver to any “sister” node of the failed forwarding node that is still receiving the data stream. In one embodiment, the backup node is selected for efficiency. For example, if the failed node is node Xn inFIG. 1 , then the backup node can be selected to be node X1 or node Xn+1. The selection of the proper node can be based on distance, delay, computational cost and the like. - The
method 400 then proceeds to step 406, where themethod 400 requests, from the backup node, the stream data starting from the last marker, M, saved by the receiver. In an alternative embodiment, themethod 400 may request the stream data starting from a specified position after the last marker M (e.g., three bits after the marker M). The request includes the unique identifier for the marker M. Instep 407, themethod 400 inquires if the backup node will accept the request presented instep 406. If the backup node rejects the request, themethod 400 returns to step 404 and connects to another backup node. Alternatively, if the backup node accepts the request instep 407, themethod 400 enables the backup node to look up the marker M in the backup node's marker index. If the marker M is present, the backup node begins sending the marked data stream, using the location of the marker M in its local buffer as the starting point. In one embodiment, any data residing in the local buffer past the point of the marker M is discarded. - In
step 408, themethod 400 resets a queue “write pointer” for the receiver to a position immediately following the marker M. Themethod 400 also erases data following the write pointer in the local buffer, and the receiver will now start queuing data over the new connection from the new forwarding node. As the marked data stream arrives at the receiver over the new connection from the backup node, the arriving data stream overwrites any data following the marker M in the receiver's local buffer. In an alternative embodiment, themethod 400 may request discrete portions of the marked data stream from multiple backup nodes. - At
step 410, themethod 400 inquires if the next marker, M+1, has arrived at the receiver. If the next marker M+1 has arrived, themethod 400 delivers data queued by the receiver (minus the marker M) to an application requesting the data atstep 412. If the next marker M+l has not arrived, themethod 400 continues to queue data over the new connection from the backup node. Those skilled in the art will recognize that steps 408-412 of themethod 400 are steps typically executed by a receiver node; they have been discussed here, in the context of themethod 400, to illustrate the method by which the receiver mode may implement such steps in conjunction with the recovery of lost data. - The
method 400 is therefore able to repair failures accurately and efficiently by resuming data transmission at the point of interruption. Moreover, as the repair only requires communication with a nearby forwarding/backup node, repair paths are short and network load is fairly distributed. Themethod 400 also works at the application layer with any reliable point-to-point transport protocol, can leverage existing point-to-point protocols, and may allow reframing and multi-protocol forwarding. Thus, themethod 400 works independently of transport protocols, as well as independently of data stream content. -
FIG. 5 is a high level block diagram of the present failure-resilient forwarding system that is implemented using a generalpurpose computing device 500. In one embodiment, a generalpurpose computing device 500 comprises aprocessor 502, amemory 504, a failure-resilient forwarding mechanism ormodule 505 and various input/output (I/O)devices 506 such as a display, a keyboard, a mouse, a modem, and the like. In one embodiment, at least one I/O device is a storage device (e.g., a disk drive, an optical disk drive, a floppy disk drive). It should be understood that the failure-resilient forwarding mechanism 505 can be implemented as a physical device or subsystem that is coupled to a processor through a communication channel. - Alternatively, the failure-
resilient forwarding mechanism 505 can be represented by one or more software applications (or even a combination of software and hardware, e.g., using Application Specific Integrated Circuits (ASIC)), where the software is loaded from a storage medium (e.g., I/O devices 506) and operated by theprocessor 502 in thememory 504 of the generalpurpose computing device 500. Thus, in one embodiment, the failure-resilient forwarding mechanism 505 and the associated methods described herein with reference to the preceding Figures can be stored on a computer readable medium or carrier (e.g., RAM, magnetic or optical drive or diskette, and the like). - Although the methods described herein have been discussed with reference to system recovery from node failures, those skilled in the art will appreciate that the present invention may have other applications in the field of content delivery. For example, the present invention may be implemented to assure reliable data delivery with any network reconfiguration, and for any reason. Other reconfiguration techniques may include finding a backup node using a centralized or distributed registry of nodes (e.g., a known server or a Domain Name Service (DNS) lookup), a distributed hash table lookup, or a broadcast search, among others. Other reasons for network reconfiguration may include responding to performance degradation, optimization of network resource utilization and load balancing, among others.
- Thus, the present invention represents a significant advancement in the field of content delivery. A method and apparatus are provided that enable efficient, failure-resilient forwarding of data over a network. The network is able to accurately and efficiently resume data transmission at the point of interruption, without transmitting redundant or out-of-order data to a receiver. To an application requesting data from a sender, the failure and recovery of the system are substantially transparent. Moreover, the methods of the present invention are not application specific, but may be adapted for use with any type of data stream, regardless of content, and with any type of reliable transport protocol.
- While foregoing is directed to the preferred embodiment of the present invention, other and further embodiments of the invention may be devised without departing from the basic scope thereof, and the scope thereof is determined by the claims that follow.
Claims (18)
1. A method for resuming interrupted transport of data over a network from a sender node to a receiver node, the method comprising:
connecting to an intermediate node in the network; and
requesting data from the intermediate node starting from a last marker saved by the receiver node.
2. The method of claim 1 , further comprising:
resetting a receiver queue write pointer to a position immediately following the last marker; and
queuing data from the intermediate node to the receiver node.
3. The method of claim 1 , further comprising:
delivering data queued by the receiver node when a next marker is received from the intermediate node, wherein the data that is queued is delivered to an application.
4. The method of claim 1 , wherein said requesting data from the intermediate node comprises:
specifying a unique identifier for the last marker; and
looking up the last marker in a local buffer of the intermediate node.
5. The method of claim 4 , further comprising:
discarding any data in the local buffer received after the last marker.
6. The method of claim 1 , further comprising:
overwriting data following the last marker in a local buffer of the receiver node, wherein the data is overwritten with the data being received from the intermediate node.
7. A computer readable medium containing an executable program for resuming interrupted transport of data over a network from a sender node to a receiver node, where the program performs:
connecting to an intermediate node in the network; and
requesting data from the intermediate node starting from a last marker saved by the receiver node.
8. The computer readable medium of claim 7 , further comprising:
resetting a receiver queue write pointer to a position immediately following the last marker; and
queuing data from the intermediate node to the receiver node.
9. The computer readable medium of claim 7 , further comprising:
delivering data queued by the receiver node when a next marker is received from the intermediate node, wherein the data that is queued is delivered to an application.
10. The computer readable medium of claim 7 , wherein said requesting data from the intermediate node comprises:
specifying a unique identifier for the last marker; and
looking up the last marker in a local buffer of the intermediate node.
11. The computer readable medium of claim 10 , further comprising:
discarding any data in the local buffer received after the last marker.
12. The computer readable medium of claim 7 , further comprising:
overwriting data following the last marker in a local buffer of the receiver node, wherein the data is overwritten with the data being received from the intermediate node.
13. A system for resuming interrupted transport of data over a network from a sender node to a receiver node, comprising:
means for connecting to an intermediate node in the network; and
means for requesting data from the intermediate node starting from a last marker saved by the receiver node.
14. The system of claim 13 , further comprising:
means for resetting a receiver queue write pointer to a position immediately following the last marker; and
means for queuing data from the intermediate node to the receiver node.
15. The system of claim 13 , further comprising:
means for delivering data queued by the receiver node when a next marker is received from the intermediate node, wherein the data that is queued is delivered to an application.
16. The system of claim 13 , wherein said means for requesting data from the intermediate node, specifies a unique identifier for the last marker, and looks up the last marker in a local buffer of the intermediate node.
17. The system of claim 16 , further comprising:
means for discarding any data in the local buffer received after the last marker.
18. The system of claim 13 , further comprising:
means for overwriting data following the last marker in a local buffer of the receiver node, wherein the data is overwritten with the data being received from the intermediate node.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/135,764 US7969869B2 (en) | 2004-04-23 | 2008-06-09 | Method and apparatus for failure resilient forwarding of data over a computer network |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/830,779 US7392319B2 (en) | 2004-04-23 | 2004-04-23 | Method and apparatus for failure resilient forwarding of data over a computer network |
US12/135,764 US7969869B2 (en) | 2004-04-23 | 2008-06-09 | Method and apparatus for failure resilient forwarding of data over a computer network |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/830,779 Division US7392319B2 (en) | 2004-04-23 | 2004-04-23 | Method and apparatus for failure resilient forwarding of data over a computer network |
Publications (2)
Publication Number | Publication Date |
---|---|
US20080239947A1 true US20080239947A1 (en) | 2008-10-02 |
US7969869B2 US7969869B2 (en) | 2011-06-28 |
Family
ID=35137767
Family Applications (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/830,779 Expired - Fee Related US7392319B2 (en) | 2004-04-23 | 2004-04-23 | Method and apparatus for failure resilient forwarding of data over a computer network |
US12/135,768 Expired - Fee Related US7865609B2 (en) | 2004-04-23 | 2008-06-09 | Method and apparatus for failure resilient forwarding of data over a computer network |
US12/135,764 Expired - Fee Related US7969869B2 (en) | 2004-04-23 | 2008-06-09 | Method and apparatus for failure resilient forwarding of data over a computer network |
Family Applications Before (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/830,779 Expired - Fee Related US7392319B2 (en) | 2004-04-23 | 2004-04-23 | Method and apparatus for failure resilient forwarding of data over a computer network |
US12/135,768 Expired - Fee Related US7865609B2 (en) | 2004-04-23 | 2008-06-09 | Method and apparatus for failure resilient forwarding of data over a computer network |
Country Status (6)
Country | Link |
---|---|
US (3) | US7392319B2 (en) |
EP (1) | EP1743353A4 (en) |
JP (1) | JP4857261B2 (en) |
KR (1) | KR20070014139A (en) |
CN (1) | CN101164056A (en) |
WO (1) | WO2005104176A2 (en) |
Families Citing this family (27)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1728373B1 (en) * | 2004-03-22 | 2018-01-03 | Codemate A/S | Distribution method, preferably applied in a streaming system |
WO2006005334A1 (en) * | 2004-07-09 | 2006-01-19 | Codemate Aps | Peer of a peer-to-peer network and such network |
US8055897B2 (en) * | 2005-12-06 | 2011-11-08 | Lippershy Celestial Llc | Digital object title and transmission information |
CN100591016C (en) * | 2006-03-17 | 2010-02-17 | 华为技术有限公司 | Dynamic content continuous transmission method and system |
US7599997B1 (en) * | 2008-08-01 | 2009-10-06 | Gene Fein | Multi-homed data forwarding storage |
US7636761B1 (en) * | 2008-09-29 | 2009-12-22 | Gene Fein | Measurement in data forwarding storage |
US7636758B1 (en) * | 2008-07-10 | 2009-12-22 | Gene Fein | Advertisement forwarding storage and retrieval network |
US8745434B2 (en) * | 2011-05-16 | 2014-06-03 | Microsoft Corporation | Platform for continuous mobile-cloud services |
US8639815B2 (en) * | 2011-08-31 | 2014-01-28 | International Business Machines Corporation | Selecting a primary-secondary host pair for mirroring virtual machines |
US9461777B2 (en) | 2011-11-21 | 2016-10-04 | Qualcomm Incorporated | Hybrid networking system with seamless path switching of streams |
KR20140076836A (en) * | 2012-12-13 | 2014-06-23 | 에스케이플래닛 주식회사 | An apparatus for storing data in streaming services and a method thereof |
US9722943B2 (en) | 2012-12-17 | 2017-08-01 | Qualcomm Incorporated | Seamless switching for multihop hybrid networks |
CN104038364B (en) | 2013-12-31 | 2015-09-30 | 华为技术有限公司 | The fault-tolerance approach of distributed stream treatment system, node and system |
US9838346B2 (en) | 2014-03-17 | 2017-12-05 | Splunk Inc. | Alerting on dual-queue systems |
US9660930B2 (en) | 2014-03-17 | 2017-05-23 | Splunk Inc. | Dynamic data server nodes |
US9836358B2 (en) | 2014-03-17 | 2017-12-05 | Splunk Inc. | Ephemeral remote data store for dual-queue systems |
US9753818B2 (en) * | 2014-09-19 | 2017-09-05 | Splunk Inc. | Data forwarding using multiple data pipelines |
CN103942252B (en) * | 2014-03-17 | 2017-11-28 | 华为技术有限公司 | A kind of method and system for recovering data |
US9838467B2 (en) | 2014-03-17 | 2017-12-05 | Splunk Inc. | Dynamically instantiating dual-queue systems |
CN107451012B (en) * | 2014-07-04 | 2020-09-25 | 华为技术有限公司 | Data backup method and stream computing system |
US10462156B2 (en) * | 2014-09-24 | 2019-10-29 | Mcafee, Llc | Determining a reputation of data using a data visa |
CN104484242B (en) * | 2014-12-10 | 2018-06-22 | 上海爱数信息技术股份有限公司 | During a kind of Copy on write snapshot can breakpoint transmission method |
CN108833559B (en) * | 2018-06-25 | 2020-12-29 | 杭州迪普科技股份有限公司 | Method and device for caching and distributing video data |
US11070480B2 (en) * | 2019-07-03 | 2021-07-20 | Kaloom Inc. | Method and computing devices for enforcing packet order based on packet marking |
JP7331604B2 (en) | 2019-10-04 | 2023-08-23 | 富士通株式会社 | Information processing system, information processing method, and information processing program |
KR102364445B1 (en) * | 2021-04-28 | 2022-02-18 | 프라이빗테크놀로지 주식회사 | System for controlling network access based on controller and method of the same |
KR102410552B1 (en) * | 2022-01-26 | 2022-06-22 | 프라이빗테크놀로지 주식회사 | System for controlling transmission and reception of file of application and method thereof |
Citations (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5754754A (en) * | 1995-07-26 | 1998-05-19 | International Business Machines Corporation | Transmission order based selective repeat data transmission error recovery system and method |
US6219349B1 (en) * | 1990-07-27 | 2001-04-17 | Kabushiki Kaisha Toshiba | Broadband switching networks |
US6230215B1 (en) * | 1997-11-14 | 2001-05-08 | Agere Systems Guardian Corp. | On-demand transfer engine |
US6442663B1 (en) * | 1998-06-19 | 2002-08-27 | Board Of Supervisors Of Louisiana University And Agricultural And Mechanical College | Data collection and restoration for homogeneous or heterogeneous process migration |
US6543014B1 (en) * | 1998-09-01 | 2003-04-01 | Hitachi, Ltd. | Data transmitting/receiving apparatus for executing data retransmission and parallel processor system |
US6556577B2 (en) * | 1997-01-31 | 2003-04-29 | At&T Corp. | Architecture for lightweight signaling in ATM networks |
US20030172335A1 (en) * | 2002-03-08 | 2003-09-11 | Debendra Das Sharma | Dynamic end to end retransmit apparatus and method |
US20040128399A1 (en) * | 2002-12-31 | 2004-07-01 | Motorola, Inc. | Media stream control system and protocol |
US6862283B2 (en) * | 2000-01-13 | 2005-03-01 | Freescale Semiconductor, Inc. | Method and apparatus for maintaining packet ordering with error recovery among multiple outstanding packets between two devices |
US7206872B2 (en) * | 2004-02-20 | 2007-04-17 | Nvidia Corporation | System and method for insertion of markers into a data stream |
Family Cites Families (24)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH0561785A (en) * | 1991-09-03 | 1993-03-12 | Nec Corp | File transfer device |
JPH05298215A (en) * | 1992-04-20 | 1993-11-12 | Fujitsu Ltd | Omitted data detecting/retransmitting method |
US5539920A (en) * | 1994-04-28 | 1996-07-23 | Thomson Consumer Electronics, Inc. | Method and apparatus for processing an audio video interactive signal |
JPH10133971A (en) * | 1996-10-25 | 1998-05-22 | Nec Corp | File transfer processing system |
US6308328B1 (en) * | 1997-01-17 | 2001-10-23 | Scientific-Atlanta, Inc. | Usage statistics collection for a cable data delivery system |
JP3216618B2 (en) * | 1998-10-09 | 2001-10-09 | 日本電気株式会社 | Data failure recovery method for video server device and medium recording data failure recovery program |
JP2003324496A (en) * | 1998-11-30 | 2003-11-14 | Matsushita Electric Ind Co Ltd | Data transmission method, and packet data structure |
JP2001045040A (en) * | 1999-08-03 | 2001-02-16 | Nippon Telegr & Teleph Corp <Ntt> | Multicast routing method, device therefor and program recording medium |
US6870837B2 (en) * | 1999-08-19 | 2005-03-22 | Nokia Corporation | Circuit emulation service over an internet protocol network |
US6526447B1 (en) * | 1999-12-14 | 2003-02-25 | International Business Machines Corporation | Apparatus for restarting interrupted data transfer and method therefor |
US7318107B1 (en) * | 2000-06-30 | 2008-01-08 | Intel Corporation | System and method for automatic stream fail-over |
JP2002084239A (en) * | 2000-09-06 | 2002-03-22 | Nippon Telegr & Teleph Corp <Ntt> | Media information distribution system and media information distribution method |
JP2002135350A (en) * | 2000-10-30 | 2002-05-10 | Sony Corp | Data distribution method, data reception method, terminal state notice service providing method and communication terminal |
US7581048B1 (en) * | 2001-06-29 | 2009-08-25 | Emc Corporation | Method and apparatus for providing continuous communication between computers |
US7457883B2 (en) * | 2001-10-12 | 2008-11-25 | Cisco Technology, Inc. | Mechanism for implementing network discovery in a cable network |
CN100471267C (en) * | 2002-03-08 | 2009-03-18 | 法国电信公司 | Method for the transmission of dependent data flows |
JP2003289526A (en) * | 2002-03-28 | 2003-10-10 | Toshiba Corp | Video receiving terminal unit and method for controlling reproduction |
JP2003348125A (en) * | 2002-05-24 | 2003-12-05 | Sony Corp | Information distribution system, information processing apparatus and method, recording medium, and program |
JP2004007172A (en) * | 2002-05-31 | 2004-01-08 | Sony Corp | Information distributing system, device and method, information terminal equipment and information processing method, recording medium and program |
JP2004070712A (en) * | 2002-08-07 | 2004-03-04 | Nippon Telegr & Teleph Corp <Ntt> | Data delivery method, data delivery system, split delivery data receiving method, split delivery data receiving device and split delivery data receiving program |
US7630305B2 (en) * | 2003-07-29 | 2009-12-08 | Orbital Data Corporation | TCP selective acknowledgements for communicating delivered and missed data packets |
EP1738260B1 (en) * | 2004-01-09 | 2010-02-10 | T.W. Storage, Inc. | Method and apparatus for searching backup data based on content and attributes |
US7310716B2 (en) * | 2005-03-04 | 2007-12-18 | Emc Corporation | Techniques for producing a consistent copy of source data at a target location |
US8578228B2 (en) * | 2006-08-17 | 2013-11-05 | Telefonaktiebolaget Lm Ericcson | Error recovery for rich media |
-
2004
- 2004-04-23 US US10/830,779 patent/US7392319B2/en not_active Expired - Fee Related
-
2005
- 2005-04-22 WO PCT/US2005/013716 patent/WO2005104176A2/en active Application Filing
- 2005-04-22 EP EP05761757A patent/EP1743353A4/en not_active Withdrawn
- 2005-04-22 KR KR1020067020197A patent/KR20070014139A/en active Search and Examination
- 2005-04-22 CN CNA2005800124431A patent/CN101164056A/en active Pending
- 2005-04-22 JP JP2007509655A patent/JP4857261B2/en not_active Expired - Fee Related
-
2008
- 2008-06-09 US US12/135,768 patent/US7865609B2/en not_active Expired - Fee Related
- 2008-06-09 US US12/135,764 patent/US7969869B2/en not_active Expired - Fee Related
Patent Citations (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6219349B1 (en) * | 1990-07-27 | 2001-04-17 | Kabushiki Kaisha Toshiba | Broadband switching networks |
US5754754A (en) * | 1995-07-26 | 1998-05-19 | International Business Machines Corporation | Transmission order based selective repeat data transmission error recovery system and method |
US6556577B2 (en) * | 1997-01-31 | 2003-04-29 | At&T Corp. | Architecture for lightweight signaling in ATM networks |
US6230215B1 (en) * | 1997-11-14 | 2001-05-08 | Agere Systems Guardian Corp. | On-demand transfer engine |
US6442663B1 (en) * | 1998-06-19 | 2002-08-27 | Board Of Supervisors Of Louisiana University And Agricultural And Mechanical College | Data collection and restoration for homogeneous or heterogeneous process migration |
US6543014B1 (en) * | 1998-09-01 | 2003-04-01 | Hitachi, Ltd. | Data transmitting/receiving apparatus for executing data retransmission and parallel processor system |
US6862283B2 (en) * | 2000-01-13 | 2005-03-01 | Freescale Semiconductor, Inc. | Method and apparatus for maintaining packet ordering with error recovery among multiple outstanding packets between two devices |
US20030172335A1 (en) * | 2002-03-08 | 2003-09-11 | Debendra Das Sharma | Dynamic end to end retransmit apparatus and method |
US20040128399A1 (en) * | 2002-12-31 | 2004-07-01 | Motorola, Inc. | Media stream control system and protocol |
US7206872B2 (en) * | 2004-02-20 | 2007-04-17 | Nvidia Corporation | System and method for insertion of markers into a data stream |
Also Published As
Publication number | Publication date |
---|---|
US20090175164A1 (en) | 2009-07-09 |
EP1743353A4 (en) | 2011-11-09 |
US7865609B2 (en) | 2011-01-04 |
US7969869B2 (en) | 2011-06-28 |
US20050240677A1 (en) | 2005-10-27 |
KR20070014139A (en) | 2007-01-31 |
US7392319B2 (en) | 2008-06-24 |
EP1743353A2 (en) | 2007-01-17 |
WO2005104176A2 (en) | 2005-11-03 |
JP2007538312A (en) | 2007-12-27 |
JP4857261B2 (en) | 2012-01-18 |
WO2005104176A3 (en) | 2007-08-16 |
CN101164056A (en) | 2008-04-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7969869B2 (en) | Method and apparatus for failure resilient forwarding of data over a computer network | |
Cerf et al. | Delay-tolerant networking architecture | |
Cerf et al. | RFC 4838: Delay-tolerant networking architecture | |
US7903546B2 (en) | Detecting unavailable network connections | |
US6981032B2 (en) | Enhanced multicast-based web server | |
US6631420B1 (en) | Reducing convergence time by a protocol independent multicast (PIM) router | |
US6871235B1 (en) | Fast path forwarding of link state advertisements using reverse path forwarding | |
US8792510B2 (en) | System and method for pseudowire packet cache and re-transmission | |
US20070027976A1 (en) | Multicast delivery method, system, and content server | |
US6760766B1 (en) | Data transmission method and device | |
CN106301694B (en) | Method and device for reducing retransmission times of data packet in reliable multicast transmission | |
US7965625B2 (en) | Communication device and logical link abnormality detection method | |
WO2007078853A2 (en) | Fast processing of multicast data | |
Dong et al. | In-packet network coding for effective packet wash and packet enrichment | |
KR100534625B1 (en) | method and apparatus for reliable routing information exchange in distributed router | |
KR100240645B1 (en) | Packet error controller of multicast communication and method thereof | |
JP4490314B2 (en) | Communications system | |
US7535916B2 (en) | Method for sharing a transport connection across a multi-processor platform with limited inter-processor communications | |
US20040267960A1 (en) | Force master capability during multicast transfers | |
US8031714B2 (en) | Using a cache of outgoing packet identifiers to recover from a protocol error in GTP-u | |
US6590895B1 (en) | Adaptive retransmission for error control in computer networks | |
US20090307288A1 (en) | Backup device | |
US7978598B1 (en) | Connection replication | |
EP2073461A1 (en) | Process for delivering at least one data stream from a data source system to a data receiver system through a network | |
CN113612737A (en) | Long message reliable transmission method based on grouping and retransmission mechanism |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
REMI | Maintenance fee reminder mailed | ||
LAPS | Lapse for failure to pay maintenance fees | ||
STCH | Information on status: patent discontinuation |
Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362 |
|
FP | Lapsed due to failure to pay maintenance fee |
Effective date: 20150628 |